math-exercises 2.0.1 → 2.0.3

package/lib/exercises/functions/basics/inverseImageFunctionGeogebra.js

@@ -1,145 +1,188 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.inverseImageFunctionGeogebra = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const polynomial_1 = require("../../../math/polynomials/polynomial");
-const randint_1 = require("../../../math/utils/random/randint");
-const round_1 = require("../../../math/utils/round");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const shuffle_1 = require("../../../utils/shuffle");
-const getInverseImageFunctionGeogebra = () => {
-    const rand = (0, coinFlip_1.coinFlip)();
-    const xValue = (0, randint_1.randint)(-5, 6);
-    const yValue = (0, randint_1.randint)(-5, 6);
-    let polynome1;
-    do {
-        polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-5, 6, [0])]);
-    } while (polynome1.calculate(xValue) > 10 || polynome1.calculate(xValue) < -10);
-    let polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10) - yValue, (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-4, 5, [0])]);
-    let roots = polynome2.getRoots();
-    if (roots.length === 2)
-        while (roots[0] > 10 || roots[0] < -10 || roots[1] > 10 || roots[1] < -10) {
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10) - yValue, (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-4, 5, [0])]);
-            roots = polynome2.getRoots();
-        }
-    if (roots.length === 1)
-        while (roots[0] < -10 || roots[0] > 10) {
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10) - yValue, (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-4, 5, [0])]);
-            roots = polynome2.getRoots();
-        }
-    const statement = rand
-        ? `Déterminer le ou les antécédents de $${polynome1.calculate(xValue)}$ par la fonction $f$ représentée ci dessous.`
-        : `Déterminer le ou les antécédents de $${yValue}$ par la fonction $f$ représentée ci dessous.`;
-    let answer = rand
-        ? xValue
-        : roots.length === 2
-            ? `\\left\\{${(0, round_1.round)(roots[0], 1)};${(0, round_1.round)(roots[1], 1)}\\right\\}`
-            : roots.length === 1
-                ? roots[0]
-                : `\\emptyset`;
-    const optimum = polynome2.derivate().getRoots()[0];
-    let xmin = 0, xmax = 0, ymin = 0, ymax = 0;
-    if (rand) {
-        if (polynome1.calculate(xValue) > 0) {
-            ymax = polynome1.calculate(xValue) + 1;
-            ymin = -1;
-        }
-        else {
-            ymin = polynome1.calculate(xValue) - 1;
-            ymax = 1;
-        }
-        if (xValue > 0) {
-            xmax = xValue + 1;
-            xmin = -1;
-        }
-        else {
-            xmin = xValue - 1;
-            xmax = 1;
-        }
-    }
-    else {
-        if (roots.length === 2) {
-            if (yValue > polynome2.calculate(optimum) + yValue) {
-                ymax = yValue + 2;
-                ymin = polynome2.calculate(optimum) + yValue - 2;
-            }
-            else {
-                ymin = yValue - 2;
-                ymax = polynome2.calculate(optimum) + yValue + 2;
-            }
-            xmax = Math.max(roots[0], roots[1]) + 1;
-            xmin = Math.min(roots[0], roots[1]) - 1;
-        }
-        if (roots.length === 1) {
-            if (yValue > 0) {
-                ymax = yValue + 5;
-                ymin = yValue - 1;
-            }
-            else {
-                ymin = yValue - 5;
-                ymax = yValue + 1;
-            }
-            xmax = optimum + 5;
-            xmin = optimum - 5;
-        }
-        if (roots.length === 0) {
-            if (yValue > polynome2.calculate(optimum) + yValue) {
-                ymax = yValue + 1;
-                ymin = polynome2.calculate(optimum) + yValue - 3;
-            }
-            else {
-                ymin = yValue - 1;
-                ymax = polynome2.calculate(optimum) + yValue + 3;
-            }
-            xmax = optimum + 5;
-            xmin = optimum - 5;
-        }
-    }
-    const commands = [
-        rand
-            ? polynome1.toString()
-            : yValue !== 0
-                ? polynome2.add(new polynomial_1.Polynomial([yValue])).toString()
-                : polynome2.toString(),
-    ];
-    answer = (answer + '').replaceAll('.', ',');
-    const question = {
-        instruction: statement,
-        answer,
-        keys: ['S', 'equal', 'lbrace', 'rbrace', 'semicolon', 'emptyset'],
-        commands,
-        coords: [xmin, xmax, ymin, ymax],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, roots, xValue, polynome1Coeffs: polynome1.coefficients },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, roots, xValue, polynome1Coeffs }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
-    while (propositions.length < n) {
-        const wrongAnswer = (0, coinFlip_1.coinFlip)()
-            ? (0, randint_1.randint)(-9, 10, [polynome1.calculate(xValue)])
-            : roots.length === 2
-                ? `\\{${(0, randint_1.randint)(-9, 10)};${(0, randint_1.randint)(-9, 10)} \\}`
-                : roots.length === 1
-                    ? (0, randint_1.randint)(-9, 10, [roots[0]])
-                    : `\\emptyset`;
-        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer + '');
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.inverseImageFunctionGeogebra = {
-    id: 'inverseImageFunctionGeogebra',
-    connector: '\\iff',
-    label: "Lecture d'antécédents",
-    levels: ['3ème', '2nde', 'CAP', '2ndPro', '1rePro', '1reTech'],
-    sections: ['Fonctions'],
-    isSingleStep: true,
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInverseImageFunctionGeogebra, nb),
-    qcmTimer: 60,
-    freeTimer: 60,
-    getPropositions,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inverseImageFunctionGeogebra = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const polynomial_1 = require("../../../math/polynomials/polynomial");
+const randint_1 = require("../../../math/utils/random/randint");
+const round_1 = require("../../../math/utils/round");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const shuffle_1 = require("../../../utils/shuffle");
+const getInverseImageFunctionGeogebra = () => {
+    const isAffine = (0, coinFlip_1.coinFlip)();
+    const xValue = (0, randint_1.randint)(-5, 6);
+    const yValue = (0, randint_1.randint)(-5, 6);
+    let affine;
+    do {
+        affine = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-5, 6, [0])]);
+    } while (affine.calculate(xValue) > 10 || affine.calculate(xValue) < -10);
+    let trinom = new polynomial_1.Polynomial([
+        (0, randint_1.randint)(-9, 10) - yValue,
+        (0, randint_1.randint)(-9, 10),
+        (0, randint_1.randint)(-4, 5, [0]),
+    ]);
+    let roots = trinom.getRoots();
+    if (roots.length === 2)
+        while (roots[0] > 10 || roots[0] < -10 || roots[1] > 10 || roots[1] < -10) {
+            trinom = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10) - yValue,
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-4, 5, [0]),
+            ]);
+            roots = trinom.getRoots();
+        }
+    else if (roots.length === 1)
+        while (roots[0] < -10 || roots[0] > 10) {
+            trinom = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10) - yValue,
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-4, 5, [0]),
+            ]);
+            roots = trinom.getRoots();
+        }
+    const statement = isAffine
+        ? `Déterminer le ou les antécédents de $${affine.calculate(xValue)}$ par la fonction $f$ représentée ci dessous.`
+        : `Déterminer le ou les antécédents de $${yValue}$ par la fonction $f$ représentée ci dessous.`;
+    let answer = isAffine
+        ? xValue
+        : roots.length === 2
+            ? `${(0, round_1.round)(roots[0], 1).toString().replace(".", ",")}\\text{ et }${(0, round_1.round)(roots[1], 1)
+                .toString()
+                .replace(".", ",")}`
+            : roots.length === 1
+                ? roots[0].toString().replace(".", ",")
+                : `\\text{Aucun}`;
+    const optimum = trinom.derivate().getRoots()[0];
+    let xmin = 0, xmax = 0, ymin = 0, ymax = 0;
+    if (isAffine) {
+        if (affine.calculate(xValue) > 0) {
+            ymax = affine.calculate(xValue) + 1;
+            ymin = -1;
+        }
+        else {
+            ymin = affine.calculate(xValue) - 1;
+            ymax = 1;
+        }
+        if (xValue > 0) {
+            xmax = xValue + 1;
+            xmin = -1;
+        }
+        else {
+            xmin = xValue - 1;
+            xmax = 1;
+        }
+    }
+    else {
+        if (roots.length === 2) {
+            if (yValue > trinom.calculate(optimum) + yValue) {
+                ymax = yValue + 2;
+                ymin = trinom.calculate(optimum) + yValue - 2;
+            }
+            else {
+                ymin = yValue - 2;
+                ymax = trinom.calculate(optimum) + yValue + 2;
+            }
+            xmax = Math.max(roots[0], roots[1]) + 1;
+            xmin = Math.min(roots[0], roots[1]) - 1;
+        }
+        if (roots.length === 1) {
+            if (yValue > 0) {
+                ymax = yValue + 5;
+                ymin = yValue - 1;
+            }
+            else {
+                ymin = yValue - 5;
+                ymax = yValue + 1;
+            }
+            xmax = optimum + 5;
+            xmin = optimum - 5;
+        }
+        if (roots.length === 0) {
+            if (yValue > trinom.calculate(optimum) + yValue) {
+                ymax = yValue + 1;
+                ymin = trinom.calculate(optimum) + yValue - 3;
+            }
+            else {
+                ymin = yValue - 1;
+                ymax = trinom.calculate(optimum) + yValue + 3;
+            }
+            xmax = optimum + 5;
+            xmin = optimum - 5;
+        }
+    }
+    const commands = [
+        isAffine
+            ? affine.toString()
+            : yValue !== 0
+                ? trinom.add(new polynomial_1.Polynomial([yValue])).toString()
+                : trinom.toString(),
+    ];
+    answer = (answer + "").replaceAll(".", ",");
+    const question = {
+        instruction: statement,
+        answer,
+        keys: ["et", "aucun"],
+        commands,
+        coords: [xmin, xmax, ymin, ymax],
+        answerFormat: "tex",
+        identifiers: {
+            xValue,
+            affineCoeffs: affine.coefficients,
+            trinomCoeffs: trinom.coefficients,
+            yValue,
+            isAffine,
+        },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, xValue, affineCoeffs, trinomCoeffs, yValue, isAffine }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    const polynome1 = new polynomial_1.Polynomial(affineCoeffs);
+    const roots = new polynomial_1.Polynomial(trinomCoeffs).getRoots();
+    while (propositions.length < n) {
+        const wrongAnswer = isAffine
+            ? (0, randint_1.randint)(-9, 10, [polynome1.calculate(xValue)])
+            : roots.length === 2
+                ? `${(0, randint_1.randint)(-9, 10)}\\text{ et }${(0, randint_1.randint)(-9, 10)}`.replaceAll(".", ",")
+                : roots.length === 1
+                    ? (0, randint_1.randint)(-9, 10, [roots[0]]).toString().replace(".", ",")
+                    : `\\text{Aucun}`;
+        (0, exercise_1.tryToAddWrongProp)(propositions, wrongAnswer + "");
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { answer, xValue, affineCoeffs, trinomCoeffs, yValue, isAffine }) => {
+    const antecedents = [];
+    if (isAffine) {
+        antecedents.push(xValue);
+    }
+    else {
+        const trinom = new polynomial_1.Polynomial(trinomCoeffs);
+        const roots = trinom.getRoots();
+        antecedents.push(...roots);
+    }
+    if (!antecedents.length)
+        return ans === `\\text{Aucun}`;
+    const studentNumbers = ans
+        .split("\\text{ et }")
+        .map((n) => Number(n.replace(",", ".")))
+        .filter((n) => !isNaN(n))
+        .sort((a, b) => a - b);
+    antecedents.sort((a, b) => a - b);
+    return (!!studentNumbers.length &&
+        studentNumbers.every((nb, index) => Math.abs(nb - antecedents[index]) < 0.2));
+};
+exports.inverseImageFunctionGeogebra = {
+    id: "inverseImageFunctionGeogebra",
+    connector: "\\iff",
+    label: "Lecture d'antécédents",
+    levels: ["3ème", "2nde", "CAP", "2ndPro", "1rePro", "1reTech"],
+    sections: ["Fonctions"],
+    isSingleStep: true,
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getInverseImageFunctionGeogebra, nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    getPropositions,
+    isAnswerValid,
+};

package/lib/exercises/functions/cube/cubicEquation.d.ts

@@ -1,9 +1,7 @@
-import { MathExercise } from '../../../exercises/exercise';
-type QCMProps = {
-    answer: string;
-    k: number;
-};
-type VEAProps = {};
-export declare const cubicEquation: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    k: number;
+};
+export declare const cubicEquation: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=cubicEquation.d.ts.map

package/lib/exercises/functions/cube/cubicEquation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cubicEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/cube/cubicEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAMlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA8BnB,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAY1D,CAAC"}
+{"version":3,"file":"cubicEquation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/cube/cubicEquation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AASlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAuCF,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,WAAW,CAcnD,CAAC"}

package/lib/exercises/functions/cube/cubicEquation.js

@@ -1,43 +1,55 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.cubicEquation = void 0;
-const exercise_1 = require("../../../exercises/exercise");
-const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
-const randint_1 = require("../../../math/utils/random/randint");
-const shuffle_1 = require("../../../utils/shuffle");
-const getCubicEquationQuestion = () => {
-    const x = (0, randint_1.randint)(-10, 11);
-    const k = x ** 3;
-    const answer = `S=\\left\\{${x}\\right\\}`;
-    const question = {
-        answer: answer,
-        instruction: `Résoudre l'équation suivante : $x^3 = ${k}$`,
-        keys: ['S', 'equal', 'lbrace', 'semicolon', 'rbrace', 'emptyset'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, k },
-    };
-    return question;
-};
-const getPropositions = (n, { answer, k }) => {
-    const propositions = [];
-    (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${k ** 3}\\}`);
-    while (propositions.length < n) {
-        const wrongAnswer = (0, randint_1.randint)(-10, 11) + '';
-        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${wrongAnswer}\\}`);
-    }
-    return (0, shuffle_1.shuffle)(propositions);
-};
-exports.cubicEquation = {
-    id: 'cubicEquation',
-    connector: '\\iff',
-    label: 'Résoudre une équation du type $x^3 = k$',
-    levels: ['2nde', '1reESM', '1reSpé', '1reTech'],
-    isSingleStep: true,
-    sections: ['Fonctions de référence', 'Fonction cube', 'Équations'],
-    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCubicEquationQuestion, nb, 20),
-    qcmTimer: 60,
-    freeTimer: 60,
-    maxAllowedQuestions: 20,
-    getPropositions,
-};
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cubicEquation = void 0;
+const exercise_1 = require("../../../exercises/exercise");
+const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
+const equationKeys_1 = require("../../../exercises/utils/keys/equationKeys");
+const randint_1 = require("../../../math/utils/random/randint");
+const equationSolutionNode_1 = require("../../../tree/nodes/equations/equationSolutionNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
+const shuffle_1 = require("../../../utils/shuffle");
+const getCubicEquationQuestion = () => {
+    const x = (0, randint_1.randint)(-10, 11);
+    const k = x ** 3;
+    const answer = `S=\\left\\{${x}\\right\\}`;
+    const question = {
+        answer: answer,
+        instruction: `Résoudre l'équation suivante : $x^3 = ${k}$`,
+        keys: equationKeys_1.equationKeys,
+        answerFormat: "tex",
+        identifiers: { k },
+    };
+    return question;
+};
+const getPropositions = (n, { answer, k }) => {
+    const propositions = [];
+    (0, exercise_1.addValidProp)(propositions, answer);
+    (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${k ** 3}\\}`);
+    while (propositions.length < n) {
+        const wrongAnswer = (0, randint_1.randint)(-10, 11) + "";
+        (0, exercise_1.tryToAddWrongProp)(propositions, `S=\\{${wrongAnswer}\\}`);
+    }
+    return (0, shuffle_1.shuffle)(propositions);
+};
+const isAnswerValid = (ans, { k }) => {
+    const sol = Math.cbrt(k);
+    const answerTree = new equationSolutionNode_1.EquationSolutionNode(new discreteSetNode_1.DiscreteSetNode([new numberNode_1.NumberNode(sol)]));
+    const texs = answerTree.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
+exports.cubicEquation = {
+    id: "cubicEquation",
+    connector: "\\iff",
+    label: "Résoudre une équation du type $x^3 = k$",
+    levels: ["2nde", "1reESM", "1reSpé", "1reTech"],
+    isSingleStep: true,
+    sections: ["Fonctions de référence", "Fonction cube", "Équations"],
+    generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getCubicEquationQuestion, nb, 20),
+    isAnswerValid,
+    qcmTimer: 60,
+    freeTimer: 60,
+    maxAllowedQuestions: 20,
+    getPropositions,
+};

package/lib/exercises/functions/cube/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./cubicEquation";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/cube/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/cube/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC"}

package/lib/exercises/functions/cube/index.js

@@ -0,0 +1,17 @@
+"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 __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./cubicEquation"), exports);

package/lib/exercises/functions/index.d.ts

@@ -0,0 +1,7 @@
+export * from "./absolute";
+export * from "./affines";
+export * from "./basics";
+export * from "./cube";
+export * from "./rationalFraction";
+export * from "./trinoms";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/exercises/functions/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,oBAAoB,CAAC;AACnC,cAAc,WAAW,CAAC"}

package/lib/exercises/functions/index.js

@@ -0,0 +1,22 @@
+"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 __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./absolute"), exports);
+__exportStar(require("./affines"), exports);
+__exportStar(require("./basics"), exports);
+__exportStar(require("./cube"), exports);
+__exportStar(require("./rationalFraction"), exports);
+__exportStar(require("./trinoms"), exports);

package/lib/exercises/functions/rationalFraction/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./rationalFractionForbiddenValue";
+//# sourceMappingURL=index.d.ts.map

package/lib/exercises/functions/rationalFraction/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/rationalFraction/index.ts"],"names":[],"mappings":"AAAA,cAAc,kCAAkC,CAAC"}

package/lib/exercises/functions/rationalFraction/index.js

@@ -0,0 +1,17 @@
+"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 __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./rationalFractionForbiddenValue"), exports);

package/lib/exercises/functions/rationalFraction/rationalFractionForbiddenValue.d.ts

@@ -1,12 +1,10 @@
-import { MathExercise } from "../../../exercises/exercise";
-type QCMProps = {
-    answer: string;
-    a: number;
-    b: number;
-    c: number;
-    d: number;
-};
-type VEAProps = {};
-export declare const rationalFractionForbiddenValue: MathExercise<QCMProps, VEAProps>;
-export {};
+import { MathExercise } from "../../../exercises/exercise";
+type Identifiers = {
+    a: number;
+    b: number;
+    c: number;
+    d: number;
+};
+export declare const rationalFractionForbiddenValue: MathExercise<Identifiers>;
+export {};
 //# sourceMappingURL=rationalFractionForbiddenValue.d.ts.map

package/lib/exercises/functions/rationalFraction/rationalFractionForbiddenValue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rationalFractionForbiddenValue.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/rationalFraction/rationalFractionForbiddenValue.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AASlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAuCnB,eAAO,MAAM,8BAA8B,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW3E,CAAC"}
+{"version":3,"file":"rationalFractionForbiddenValue.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/rationalFraction/rationalFractionForbiddenValue.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAQlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX,CAAC;AAsDF,eAAO,MAAM,8BAA8B,EAAE,YAAY,CAAC,WAAW,CAapE,CAAC"}