math-exercises 2.0.13 → 2.0.15
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/exercises/calcul/fractions/simplifyFraction.js +1 -1
- package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.d.ts.map +1 -1
- package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType0.js +6 -4
- package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType1.js +1 -1
- package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType2.js +1 -1
- package/lib/exercises/calculLitteral/inequations/firstDegreeInequationsType3.js +1 -1
- package/lib/exercises/conversion/massConversion.d.ts.map +1 -1
- package/lib/exercises/conversion/massConversion.js +2 -0
- package/lib/exercises/functions/affines/affineExpressionReading.d.ts.map +1 -1
- package/lib/exercises/functions/affines/affineExpressionReading.js +9 -6
- package/lib/exercises/functions/trinoms/secondDegreeInequation.d.ts.map +1 -1
- package/lib/exercises/functions/trinoms/secondDegreeInequation.js +16 -3
- package/lib/exercises/limits/limitReading.js +1 -1
- package/lib/exercises/probaStat/diceBasicProbas.js +1 -1
- package/lib/exercises/squareRoots/squareRootsSum.d.ts.map +1 -1
- package/lib/exercises/squareRoots/squareRootsSum.js +3 -2
- package/lib/math/polynomials/trinom.d.ts.map +1 -1
- package/package.json +1 -1
|
@@ -10,7 +10,7 @@ const getSimplifyFraction = () => {
|
|
|
10
10
|
const rationalTex = rational.toTree().toTex();
|
|
11
11
|
const answer = rational.simplify().toTree().toTex();
|
|
12
12
|
const question = {
|
|
13
|
-
instruction: `
|
|
13
|
+
instruction: `Mettre sous forme irréductible : $${rationalTex}$`,
|
|
14
14
|
startStatement: rationalTex,
|
|
15
15
|
answer,
|
|
16
16
|
keys: [],
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;
|
|
1
|
+
{"version":3,"file":"firstDegreeInequationsType0.d.ts","sourceRoot":"","sources":["../../../../src/exercises/calculLitteral/inequations/firstDegreeInequationsType0.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAGlC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAW3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AA2DF,eAAO,MAAM,2BAA2B,EAAE,YAAY,CAAC,WAAW,CAajE,CAAC"}
|
|
@@ -18,7 +18,7 @@ const getFirstDegreeInequationsQuestion = () => {
|
|
|
18
18
|
const c = (0, randint_1.randint)(-10, 11);
|
|
19
19
|
const result = c - affine.b;
|
|
20
20
|
const ineqType = inequation_1.InequationSymbolConstructor.random();
|
|
21
|
-
const answer = `x${ineqType}${result}`;
|
|
21
|
+
const answer = `x${ineqType.symbol}${result}`;
|
|
22
22
|
const question = {
|
|
23
23
|
answer: answer,
|
|
24
24
|
instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,
|
|
@@ -41,11 +41,13 @@ const getPropositions = (n, { answer, ineqType, b, c }) => {
|
|
|
41
41
|
}
|
|
42
42
|
return (0, shuffle_1.shuffle)(propositions);
|
|
43
43
|
};
|
|
44
|
-
const isAnswerValid = (ans, { ineqType, b, c }) => {
|
|
44
|
+
const isAnswerValid = (ans, { answer, ineqType, b, c }) => {
|
|
45
45
|
const result = c - b;
|
|
46
46
|
const ineq = new inequationNode_1.InequationNode([new variableNode_1.VariableNode("x"), new numberNode_1.NumberNode(result)], ineqType);
|
|
47
|
-
|
|
48
|
-
const
|
|
47
|
+
console.log(answer);
|
|
48
|
+
const tree = new inequationSolutionNode_1.InequationSolutionNode(ineq.toInterval());
|
|
49
|
+
const texs = tree.toAllValidTexs();
|
|
50
|
+
console.log(texs);
|
|
49
51
|
return texs.includes(ans);
|
|
50
52
|
};
|
|
51
53
|
exports.firstDegreeInequationsType0 = {
|
|
@@ -19,7 +19,7 @@ const getFirstDegreeInequationsQuestion = () => {
|
|
|
19
19
|
const result = new rational_1.Rational(b, affine.a).simplify().toTree().toTex();
|
|
20
20
|
const ineqType = inequation_1.InequationSymbolConstructor.random();
|
|
21
21
|
const invIneqType = ineqType.reversed();
|
|
22
|
-
const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
|
|
22
|
+
const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
|
|
23
23
|
const question = {
|
|
24
24
|
answer: answer,
|
|
25
25
|
instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${b}$ `,
|
|
@@ -22,7 +22,7 @@ const getFirstDegreeInequationsQuestion = () => {
|
|
|
22
22
|
.toTex();
|
|
23
23
|
const ineqType = inequation_1.InequationSymbolConstructor.random();
|
|
24
24
|
const invIneqType = ineqType.reversed();
|
|
25
|
-
const answer = `x${affine.a > 0 ? ineqType : invIneqType}${result}`;
|
|
25
|
+
const answer = `x${affine.a > 0 ? ineqType.symbol : invIneqType}${result}`;
|
|
26
26
|
const question = {
|
|
27
27
|
answer: answer,
|
|
28
28
|
instruction: `Résoudre l'inéquation : $${affine.toTex()} ${ineqType} ${c}$ `,
|
|
@@ -23,7 +23,7 @@ const getFirstDegreeInequationsQuestion = () => {
|
|
|
23
23
|
const coeff = affine1.a - affine2.a;
|
|
24
24
|
const ineqType = inequation_1.InequationSymbolConstructor.random();
|
|
25
25
|
const invIneqType = ineqType.reversed();
|
|
26
|
-
const answer = `x${coeff > 0 ? ineqType : invIneqType}${result}`;
|
|
26
|
+
const answer = `x${coeff > 0 ? ineqType.symbol : invIneqType}${result}`;
|
|
27
27
|
const question = {
|
|
28
28
|
answer: answer,
|
|
29
29
|
instruction: `Résoudre l'inéquation : $${affine1.toTex()} ${ineqType} ${affine2.toTex()}$ `,
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"massConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/massConversion.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AAGrB,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,MAAM,CAAC;IACxB,0BAA0B,EAAE,MAAM,CAAC;IACnC,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;
|
|
1
|
+
{"version":3,"file":"massConversion.d.ts","sourceRoot":"","sources":["../../../src/exercises/conversion/massConversion.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,YAAY,EAQb,MAAM,aAAa,CAAC;AAGrB,KAAK,WAAW,GAAG;IACjB,eAAe,EAAE,MAAM,CAAC;IACxB,0BAA0B,EAAE,MAAM,CAAC;IACnC,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AA0DF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAYpD,CAAC"}
|
|
@@ -8,6 +8,7 @@ const exercise_1 = require("../exercise");
|
|
|
8
8
|
const getDistinctQuestions_1 = require("../utils/getDistinctQuestions");
|
|
9
9
|
const units = ["mg", "cg", "dg", "g", "dag", "hg", "kg"];
|
|
10
10
|
const getMassConversion = () => {
|
|
11
|
+
console.log("mass conv gen");
|
|
11
12
|
const randomUnitIndex = (0, randint_1.randint)(0, 7);
|
|
12
13
|
const randomUnitInstructionIndex = (0, randint_1.randint)(0, 7, [randomUnitIndex]);
|
|
13
14
|
const randomMass = decimal_1.DecimalConstructor.random(0, 1000, (0, randint_1.randint)(0, 4));
|
|
@@ -32,6 +33,7 @@ const getPropositions = (n, { answer, randomMass, randomUnitIndex, randomUnitIns
|
|
|
32
33
|
(0, exercise_1.addValidProp)(propositions, answer);
|
|
33
34
|
const massDecimal = new decimal_1.Decimal(randomMass);
|
|
34
35
|
while (propositions.length < n) {
|
|
36
|
+
console.log("mass conv prop");
|
|
35
37
|
const wrongAnswer = massDecimal
|
|
36
38
|
.multiplyByPowerOfTen((0, randint_1.randint)(-3, 4, [randomUnitIndex - randomUnitInstructionIndex]))
|
|
37
39
|
.value.toString()
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"affineExpressionReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/affineExpressionReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;
|
|
1
|
+
{"version":3,"file":"affineExpressionReading.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/affines/affineExpressionReading.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAalC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB,CAAC;AA2GF,eAAO,MAAM,uBAAuB,EAAE,YAAY,CAAC,WAAW,CAa7D,CAAC"}
|
|
@@ -45,12 +45,15 @@ const getAffineExpressionReadingQuestion = () => {
|
|
|
45
45
|
const getPropositions = (n, { answer, b, secondPoint }) => {
|
|
46
46
|
const propositions = [];
|
|
47
47
|
(0, exercise_1.addValidProp)(propositions, answer);
|
|
48
|
-
const wrongAs = [
|
|
49
|
-
|
|
50
|
-
new rational_1.Rational(secondPoint[
|
|
51
|
-
|
|
52
|
-
new rational_1.Rational(secondPoint[1]
|
|
53
|
-
]
|
|
48
|
+
const wrongAs = [];
|
|
49
|
+
if (secondPoint[1] - b !== 0)
|
|
50
|
+
wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] - b).simplify().toTree());
|
|
51
|
+
if (secondPoint[0] !== 0)
|
|
52
|
+
wrongAs.push(new rational_1.Rational(secondPoint[1] + b, secondPoint[0]).simplify().toTree());
|
|
53
|
+
if (secondPoint[1] + b !== 0)
|
|
54
|
+
wrongAs.push(new rational_1.Rational(secondPoint[0], secondPoint[1] + b).simplify().toTree());
|
|
55
|
+
if (b !== 0)
|
|
56
|
+
wrongAs.push(new rational_1.Rational(secondPoint[1] - secondPoint[0], b).simplify().toTree());
|
|
54
57
|
const fx = new variableNode_1.VariableNode("f(x)");
|
|
55
58
|
const x = new variableNode_1.VariableNode("x");
|
|
56
59
|
wrongAs.forEach((coeff) => {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"secondDegreeInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/secondDegreeInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;
|
|
1
|
+
{"version":3,"file":"secondDegreeInequation.d.ts","sourceRoot":"","sources":["../../../../src/exercises/functions/trinoms/secondDegreeInequation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,gBAAgB,EAGjB,MAAM,mCAAmC,CAAC;AAa3C,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,gBAAgB,CAAC;CAC5B,CAAC;AAgHF,eAAO,MAAM,sBAAsB,EAAE,YAAY,CAAC,WAAW,CAa5D,CAAC"}
|
|
@@ -5,8 +5,10 @@ const exercise_1 = require("../../../exercises/exercise");
|
|
|
5
5
|
const getDistinctQuestions_1 = require("../../../exercises/utils/getDistinctQuestions");
|
|
6
6
|
const inequation_1 = require("../../../math/inequations/inequation");
|
|
7
7
|
const trinom_1 = require("../../../math/polynomials/trinom");
|
|
8
|
+
const randint_1 = require("../../../math/utils/random/randint");
|
|
8
9
|
const inequationSolutionNode_1 = require("../../../tree/nodes/inequations/inequationSolutionNode");
|
|
9
10
|
const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
|
|
11
|
+
const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
|
|
10
12
|
const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
|
|
11
13
|
const unionIntervalNode_1 = require("../../../tree/nodes/sets/unionIntervalNode");
|
|
12
14
|
const getAnswer = ({ a, roots, ineqType }) => {
|
|
@@ -26,8 +28,15 @@ const getAnswer = ({ a, roots, ineqType }) => {
|
|
|
26
28
|
return new inequationSolutionNode_1.InequationSolutionNode(tree);
|
|
27
29
|
};
|
|
28
30
|
const getSecondDegreeInequationQuestion = () => {
|
|
29
|
-
const
|
|
30
|
-
const
|
|
31
|
+
const a = (0, randint_1.randint)(-5, 6, [0]);
|
|
32
|
+
const x1 = (0, randint_1.randint)(-5, 6);
|
|
33
|
+
const x2 = (0, randint_1.randint)(-5, 6, [x1]);
|
|
34
|
+
const roots = x1 < x2
|
|
35
|
+
? [new numberNode_1.NumberNode(x1), new numberNode_1.NumberNode(x2)]
|
|
36
|
+
: [new numberNode_1.NumberNode(x2), new numberNode_1.NumberNode(x1)];
|
|
37
|
+
const c = a * x1 * x2;
|
|
38
|
+
const b = -a * x2 - a * x1;
|
|
39
|
+
const trinom = new trinom_1.Trinom(a, b, c);
|
|
31
40
|
const ineqType = inequation_1.InequationSymbolConstructor.random();
|
|
32
41
|
const answer = getAnswer({ a: trinom.a, roots, ineqType }).toTex();
|
|
33
42
|
const question = {
|
|
@@ -50,18 +59,22 @@ const getPropositions = (n, { answer, a, b, c, ineqType }) => {
|
|
|
50
59
|
const propositions = [];
|
|
51
60
|
(0, exercise_1.addValidProp)(propositions, answer);
|
|
52
61
|
const roots = new trinom_1.Trinom(a, b, c).getRootsNode();
|
|
62
|
+
console.log("prop", roots.length);
|
|
53
63
|
const ineq = new inequation_1.InequationSymbol(ineqType);
|
|
54
64
|
(0, exercise_1.tryToAddWrongProp)(propositions, getAnswer({ a: -a, ineqType: ineq, roots }).toTex());
|
|
55
65
|
(0, exercise_1.tryToAddWrongProp)(propositions, getAnswer({ a, ineqType: ineq.toStrictnessToggled(), roots }).toTex());
|
|
56
66
|
(0, exercise_1.tryToAddWrongProp)(propositions, getAnswer({ a: -a, ineqType: ineq.toStrictnessToggled(), roots }).toTex());
|
|
57
67
|
return (0, exercise_1.shuffleProps)(propositions, n);
|
|
58
68
|
};
|
|
59
|
-
const isAnswerValid = (ans, { a, b, c, ineqType }) => {
|
|
69
|
+
const isAnswerValid = (ans, { answer, a, b, c, ineqType }) => {
|
|
60
70
|
const trinom = new trinom_1.Trinom(a, b, c);
|
|
61
71
|
const roots = trinom.getRootsNode();
|
|
72
|
+
console.log("vea", roots.length);
|
|
62
73
|
const ineq = new inequation_1.InequationSymbol(ineqType);
|
|
63
74
|
const tree = getAnswer({ a, ineqType: ineq, roots });
|
|
64
75
|
const texs = tree.toAllValidTexs();
|
|
76
|
+
console.log("2ndIneq VEA texs", texs);
|
|
77
|
+
console.log("2ndIneq VEA Answer", answer);
|
|
65
78
|
return texs.includes(ans);
|
|
66
79
|
};
|
|
67
80
|
exports.secondDegreeInequation = {
|
|
@@ -71,7 +71,7 @@ const getLimitReadingQuestion = () => {
|
|
|
71
71
|
}
|
|
72
72
|
const question = {
|
|
73
73
|
answer,
|
|
74
|
-
instruction: `Ci-dessous est
|
|
74
|
+
instruction: `Ci-dessous est tracée la courbe représentative d'une fonction $f$. Déterminer la limite: $\\displaystyle ${new limitNode_1.LimitNode(to, new variableNode_1.VariableNode("f(x)"), from).toTex()}$`,
|
|
75
75
|
keys: [],
|
|
76
76
|
commands: [fct],
|
|
77
77
|
coords: [-10, 10, -10, 10],
|
|
@@ -24,7 +24,7 @@ const getDiceBasicProbasQuestion = () => {
|
|
|
24
24
|
: `\\frac{1}{${nbFaces}}`;
|
|
25
25
|
const question = {
|
|
26
26
|
answer,
|
|
27
|
-
instruction: `On lance un dé à ${nbFaces} faces. Quelle est la probabilité d'obtenir ${target} ?`,
|
|
27
|
+
instruction: `On lance un dé équilibré à ${nbFaces} faces. Quelle est la probabilité d'obtenir ${target} ?`,
|
|
28
28
|
keys: [],
|
|
29
29
|
answerFormat: "tex",
|
|
30
30
|
identifiers: { isParityQuestion, isEvenQuestion, nbFaces },
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"squareRootsSum.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;
|
|
1
|
+
{"version":3,"file":"squareRootsSum.d.ts","sourceRoot":"","sources":["../../../src/exercises/squareRoots/squareRootsSum.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,0BAA0B,CAAC;AAUlC,KAAK,WAAW,GAAG;IACjB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACtB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACvB,CAAC;AA+EF,eAAO,MAAM,cAAc,EAAE,YAAY,CAAC,WAAW,CAapD,CAAC"}
|
|
@@ -55,13 +55,14 @@ const getPropositions = (n, { answer, b }) => {
|
|
|
55
55
|
}
|
|
56
56
|
return (0, exercise_1.shuffleProps)(propositions, n);
|
|
57
57
|
};
|
|
58
|
-
const isAnswerValid = (ans, { a, b, c, d, y, x, z }) => {
|
|
58
|
+
const isAnswerValid = (ans, { answer, a, b, c, d, y, x, z }) => {
|
|
59
59
|
let coeff = a * Math.sqrt(x) + c * Math.sqrt(y);
|
|
60
60
|
if (!!d && !!z) {
|
|
61
61
|
coeff += d * Math.sqrt(z);
|
|
62
62
|
}
|
|
63
|
-
const tree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b)));
|
|
63
|
+
const tree = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(coeff), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(b))).simplify();
|
|
64
64
|
const texs = tree.toAllValidTexs();
|
|
65
|
+
console.log("vea SumSQRT answer: ", answer, "texs : ", texs);
|
|
65
66
|
return texs.includes(ans);
|
|
66
67
|
};
|
|
67
68
|
exports.squareRootsSum = {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAIvE,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAO1C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAE/D,
|
|
1
|
+
{"version":3,"file":"trinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/trinom.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAIvE,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAO1C,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAE/D,8BAAsB,iBAAiB;IACrC,MAAM,CAAC,MAAM,CACX,OAAO,GAAE,OAER,EACD,OAAO,GAAE,OAAqC,EAC9C,OAAO,GAAE,OAAqC,GAC7C,MAAM;IAST,MAAM,CAAC,eAAe,CACpB,OAAO,GAAE,OAER,EACD,WAAW,GAAE,OAAqC,EAClD,UAAU,GAAE,OAAqC,GAChD,MAAM;IAUT,MAAM,CAAC,gBAAgB,CACrB,OAAO,GAAE,OAER,EACD,QAAQ,GAAE,OAAqC,EAC/C,QAAQ,GAAE,OAAqC,GAC9C,MAAM;CAcV;AAED,qBAAa,MAAO,SAAQ,UAAU;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;gBACL,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY;IAQnE,QAAQ;IAGR,YAAY,IAAI,UAAU;IAI1B,QAAQ;IAUR,YAAY,IAAI,aAAa,EAAE;IAoD/B,2BAA2B;IAO3B,QAAQ;IAGR,YAAY;IAIZ,OAAO;IAIP,WAAW;IAIX,iBAAiB;IA4CjB,gBAAgB;IAsBhB,SAAS;CAGV"}
|