math-exercises 2.2.78 → 2.2.80
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/math/calculLitteral/inequations/firstDegreeInequationsType0.d.ts +5 -1
- package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType0.d.ts.map +1 -1
- package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType0.js +95 -20
- package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType1.d.ts +4 -1
- package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType1.d.ts.map +1 -1
- package/lib/exercises/math/calculLitteral/inequations/firstDegreeInequationsType1.js +104 -26
- package/lib/exercises/math/derivation/derivative/firstDegreeDerivative.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/firstDegreeDerivative.js +44 -5
- package/lib/exercises/math/derivation/derivative/lnDerivativeOne.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/lnDerivativeOne.js +17 -7
- package/lib/exercises/math/derivation/derivative/lnDerivativeThree.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/lnDerivativeThree.js +46 -27
- package/lib/exercises/math/derivation/derivative/lnDerivativeTwo.js +1 -1
- package/lib/exercises/math/derivation/derivative/rootFunctionDerivative.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/rootFunctionDerivative.js +57 -26
- package/lib/exercises/math/derivation/derivative/secondDegreeDerivative.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/secondDegreeDerivative.js +50 -8
- package/lib/exercises/math/derivation/derivative/secondDerivativeOfExpoFunction.js +1 -1
- package/lib/exercises/math/derivation/derivative/thirdDegreeDerivative.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/thirdDegreeDerivative.js +67 -13
- package/lib/exercises/math/derivation/derivative/usualderivative.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/usualderivative.js +1 -2
- package/lib/exercises/math/functions/affines/signFunction.d.ts.map +1 -1
- package/lib/exercises/math/functions/affines/signFunction.js +66 -27
- package/lib/exercises/math/functions/basics/graphicInequation.d.ts.map +1 -1
- package/lib/exercises/math/functions/basics/graphicInequation.js +57 -36
- package/lib/exercises/math/functions/exponential/expEquation.js +1 -1
- package/lib/exercises/math/functions/exponentials/exponentialsVariations.d.ts +9 -0
- package/lib/exercises/math/functions/exponentials/exponentialsVariations.d.ts.map +1 -0
- package/lib/exercises/math/functions/exponentials/exponentialsVariations.js +124 -0
- package/lib/exercises/math/functions/exponentials/index.d.ts +2 -0
- package/lib/exercises/math/functions/exponentials/index.d.ts.map +1 -0
- package/lib/exercises/math/functions/exponentials/index.js +17 -0
- package/lib/exercises/math/functions/index.d.ts +1 -0
- package/lib/exercises/math/functions/index.d.ts.map +1 -1
- package/lib/exercises/math/functions/index.js +1 -0
- package/lib/exercises/math/functions/integral/integralFractions.js +1 -1
- package/lib/exercises/math/functions/logarithm/log10Simplifying.d.ts.map +1 -1
- package/lib/exercises/math/functions/logarithm/log10Simplifying.js +6 -2
- package/lib/exercises/math/functions/logarithm/logEquation.d.ts.map +1 -1
- package/lib/exercises/math/functions/logarithm/logEquation.js +22 -14
- package/lib/exercises/math/functions/logarithm/logPowerEquation.d.ts.map +1 -1
- package/lib/exercises/math/functions/logarithm/logPowerEquation.js +14 -12
- package/lib/exercises/math/functions/logarithm/logSimplifiying.d.ts.map +1 -1
- package/lib/exercises/math/functions/logarithm/logSimplifiying.js +36 -16
- package/lib/exercises/math/geometry/areas/rectangleArea.d.ts.map +1 -1
- package/lib/exercises/math/geometry/areas/rectangleArea.js +5 -2
- package/lib/exercises/math/geometry/vectors/vectorLinearCombination.js +4 -4
- package/lib/exercises/math/index.d.ts +1 -0
- package/lib/exercises/math/index.d.ts.map +1 -1
- package/lib/exercises/math/index.js +1 -0
- package/lib/exercises/math/matrices/matrixInversibilityDomain.js +1 -0
- package/lib/exercises/math/percent/applyPercent.d.ts.map +1 -1
- package/lib/exercises/math/percent/applyPercent.js +2 -0
- package/lib/exercises/math/percent/findEndValueAfterEvolution.d.ts +8 -0
- package/lib/exercises/math/percent/findEndValueAfterEvolution.d.ts.map +1 -0
- package/lib/exercises/math/percent/findEndValueAfterEvolution.js +104 -0
- package/lib/exercises/math/percent/index.d.ts +1 -0
- package/lib/exercises/math/percent/index.d.ts.map +1 -1
- package/lib/exercises/math/percent/index.js +1 -0
- package/lib/exercises/math/powers/index.d.ts +1 -0
- package/lib/exercises/math/powers/index.d.ts.map +1 -1
- package/lib/exercises/math/powers/index.js +1 -0
- package/lib/exercises/math/powers/powersMixOperations.d.ts +11 -0
- package/lib/exercises/math/powers/powersMixOperations.d.ts.map +1 -0
- package/lib/exercises/math/powers/powersMixOperations.js +99 -0
- package/lib/exercises/math/primitive/logarithmePrimitive.d.ts.map +1 -1
- package/lib/exercises/math/primitive/logarithmePrimitive.js +11 -3
- package/lib/exercises/math/sampling/confidenceInterval.d.ts +9 -0
- package/lib/exercises/math/sampling/confidenceInterval.d.ts.map +1 -0
- package/lib/exercises/math/sampling/confidenceInterval.js +134 -0
- package/lib/exercises/math/sampling/fluctuationInterval.d.ts +9 -0
- package/lib/exercises/math/sampling/fluctuationInterval.d.ts.map +1 -0
- package/lib/exercises/math/sampling/fluctuationInterval.js +131 -0
- package/lib/exercises/math/sampling/index.d.ts +4 -0
- package/lib/exercises/math/sampling/index.d.ts.map +1 -0
- package/lib/exercises/math/sampling/index.js +19 -0
- package/lib/exercises/math/sampling/isSamplingRepresentative.d.ts +11 -0
- package/lib/exercises/math/sampling/isSamplingRepresentative.d.ts.map +1 -0
- package/lib/exercises/math/sampling/isSamplingRepresentative.js +116 -0
- package/lib/exercises/math/sequences/geometric/geometricVariations.d.ts +9 -0
- package/lib/exercises/math/sequences/geometric/geometricVariations.d.ts.map +1 -0
- package/lib/exercises/math/sequences/geometric/geometricVariations.js +124 -0
- package/lib/exercises/math/sequences/geometric/index.d.ts +1 -0
- package/lib/exercises/math/sequences/geometric/index.d.ts.map +1 -1
- package/lib/exercises/math/sequences/geometric/index.js +1 -0
- package/lib/exercises/math/sets/intervals/inequalityToInterval.d.ts.map +1 -1
- package/lib/exercises/math/sets/intervals/inequalityToInterval.js +11 -11
- package/lib/exercises/options/inequationSolutionFormat.d.ts +3 -0
- package/lib/exercises/options/inequationSolutionFormat.d.ts.map +1 -0
- package/lib/exercises/options/inequationSolutionFormat.js +12 -0
- package/lib/exercises/pc/pH.js +1 -1
- package/lib/index.d.ts +35 -2
- package/lib/index.d.ts.map +1 -1
- package/lib/math/numbers/integer/integer.d.ts +1 -1
- package/lib/math/numbers/rationals/rational.d.ts +3 -1
- package/lib/math/numbers/rationals/rational.d.ts.map +1 -1
- package/lib/math/numbers/rationals/rational.js +3 -1
- package/lib/math/numbers/reals/real.d.ts +1 -1
- package/lib/playground.d.ts.map +1 -1
- package/lib/playground.js +6 -1
- package/lib/tree/nodes/algebraicNode.d.ts +1 -0
- package/lib/tree/nodes/algebraicNode.d.ts.map +1 -1
- package/lib/tree/nodes/inequations/inequationNode.d.ts +5 -2
- package/lib/tree/nodes/inequations/inequationNode.d.ts.map +1 -1
- package/lib/tree/nodes/inequations/inequationNode.js +40 -3
- package/lib/tree/nodes/numbers/numberNode.d.ts +2 -2
- package/lib/tree/nodes/numbers/numberNode.d.ts.map +1 -1
- package/lib/tree/nodes/numbers/numberNode.js +7 -1
- package/lib/tree/nodes/operators/addNode.d.ts.map +1 -1
- package/lib/tree/nodes/operators/addNode.js +15 -1
- package/lib/tree/nodes/operators/fractionNode.d.ts.map +1 -1
- package/lib/tree/nodes/operators/fractionNode.js +8 -0
- package/lib/tree/nodes/operators/multiplyNode.d.ts.map +1 -1
- package/lib/tree/nodes/operators/multiplyNode.js +4 -0
- package/lib/tree/nodes/polynomials/monomNode.d.ts +6 -0
- package/lib/tree/nodes/polynomials/monomNode.d.ts.map +1 -1
- package/lib/tree/nodes/polynomials/monomNode.js +126 -2
- package/lib/tree/nodes/sets/intervalNode.d.ts +2 -2
- package/lib/tree/nodes/sets/intervalNode.d.ts.map +1 -1
- package/lib/tree/nodes/sets/intervalNode.js +2 -2
- package/lib/tree/nodes/sets/setNode.d.ts +1 -0
- package/lib/tree/nodes/sets/setNode.d.ts.map +1 -1
- package/lib/tree/nodes/sets/unionIntervalNode.d.ts +1 -1
- package/lib/tree/nodes/sets/unionIntervalNode.d.ts.map +1 -1
- package/lib/tree/nodes/sets/unionIntervalNode.js +1 -1
- package/lib/tree/parsers/affineParser.d.ts.map +1 -1
- package/lib/tree/parsers/affineParser.js +2 -1
- package/lib/tree/parsers/inequationParser.d.ts +7 -0
- package/lib/tree/parsers/inequationParser.d.ts.map +1 -0
- package/lib/tree/parsers/inequationParser.js +30 -0
- package/lib/tree/parsers/intervalParser.d.ts +8 -0
- package/lib/tree/parsers/intervalParser.d.ts.map +1 -0
- package/lib/tree/parsers/intervalParser.js +44 -0
- package/lib/tree/parsers/latexParser.d.ts.map +1 -1
- package/lib/tree/parsers/latexParser.js +29 -6
- package/lib/tree/parsers/monomParser.d.ts +1 -3
- package/lib/tree/parsers/monomParser.d.ts.map +1 -1
- package/lib/tree/parsers/monomParser.js +7 -129
- package/lib/tree/parsers/polynomialParser.d.ts.map +1 -1
- package/lib/tree/parsers/polynomialParser.js +2 -1
- package/lib/tree/parsers/powerParser.d.ts +1 -1
- package/lib/tree/parsers/powerParser.d.ts.map +1 -1
- package/lib/tree/parsers/powerParser.js +2 -1
- package/lib/tree/parsers/rationalParser.d.ts +1 -1
- package/lib/tree/parsers/trinomParser.js +2 -2
- package/lib/tree/parsers/unionIntervalParser.d.ts +9 -0
- package/lib/tree/parsers/unionIntervalParser.d.ts.map +1 -0
- package/lib/tree/parsers/unionIntervalParser.js +26 -0
- package/lib/types/keyIds.d.ts +1 -1
- package/lib/types/keyIds.d.ts.map +1 -1
- package/package.json +1 -1
|
@@ -1,12 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.
|
|
4
|
-
const oppositeNode_1 = require("../nodes/functions/oppositeNode");
|
|
5
|
-
const fractionNode_1 = require("../nodes/operators/fractionNode");
|
|
6
|
-
const multiplyNode_1 = require("../nodes/operators/multiplyNode");
|
|
7
|
-
const powerNode_1 = require("../nodes/operators/powerNode");
|
|
3
|
+
exports.monomParser = void 0;
|
|
8
4
|
const monomNode_1 = require("../nodes/polynomials/monomNode");
|
|
9
|
-
const variableNode_1 = require("../nodes/variables/variableNode");
|
|
10
5
|
const latexParser_1 = require("./latexParser");
|
|
11
6
|
const monomParser = (str, { variable, maxDegree, minDegree } = {
|
|
12
7
|
variable: "x",
|
|
@@ -15,132 +10,15 @@ const monomParser = (str, { variable, maxDegree, minDegree } = {
|
|
|
15
10
|
}) => {
|
|
16
11
|
try {
|
|
17
12
|
const parsed = (0, latexParser_1.parseAlgebraic)(str);
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
else
|
|
24
|
-
return false;
|
|
13
|
+
// const parsed = (2).toTree();
|
|
14
|
+
return (0, monomNode_1.isMonom)(parsed, { variable, maxDegree, minDegree }) ? parsed : false;
|
|
15
|
+
// if (isFractionNode(parsed)) {
|
|
16
|
+
// !unimplemented
|
|
17
|
+
// return false;
|
|
18
|
+
// } else return false;
|
|
25
19
|
}
|
|
26
20
|
catch (err) {
|
|
27
21
|
return false;
|
|
28
22
|
}
|
|
29
23
|
};
|
|
30
24
|
exports.monomParser = monomParser;
|
|
31
|
-
const isMonom = (node, { variable, maxDegree, minDegree } = {
|
|
32
|
-
variable: "x",
|
|
33
|
-
maxDegree: undefined,
|
|
34
|
-
minDegree: 0,
|
|
35
|
-
}) => {
|
|
36
|
-
variable = variable ?? "x";
|
|
37
|
-
maxDegree = maxDegree ?? undefined;
|
|
38
|
-
minDegree = minDegree ?? 0;
|
|
39
|
-
if ((0, monomNode_1.isMonomNode)(node)) {
|
|
40
|
-
if (node.variable !== variable)
|
|
41
|
-
return false;
|
|
42
|
-
if (maxDegree && node.degree > maxDegree)
|
|
43
|
-
return false;
|
|
44
|
-
if (minDegree && node.degree < minDegree)
|
|
45
|
-
return false;
|
|
46
|
-
return true;
|
|
47
|
-
}
|
|
48
|
-
if (node.isNumeric && minDegree === 0)
|
|
49
|
-
return true;
|
|
50
|
-
//not monom
|
|
51
|
-
if ((0, variableNode_1.isVariableNode)(node) && node.name === variable && minDegree < 2)
|
|
52
|
-
return true;
|
|
53
|
-
//new MonomNode(1, 1, { variable });
|
|
54
|
-
if ((0, oppositeNode_1.isOppositeNode)(node) &&
|
|
55
|
-
(0, variableNode_1.isVariableNode)(node.child) &&
|
|
56
|
-
node.child.name === variable &&
|
|
57
|
-
minDegree < 2)
|
|
58
|
-
return true;
|
|
59
|
-
// new MonomNode(-1, 1, {variable})
|
|
60
|
-
if ((0, powerNode_1.isSquareNode)(node)) {
|
|
61
|
-
if (minDegree > 2)
|
|
62
|
-
return false;
|
|
63
|
-
if (maxDegree && maxDegree < 2)
|
|
64
|
-
return false;
|
|
65
|
-
return (0, variableNode_1.isVariableNode)(node.leftChild) && node.leftChild.name === "x";
|
|
66
|
-
}
|
|
67
|
-
if ((0, oppositeNode_1.isOppositeNode)(node) && (0, powerNode_1.isSquareNode)(node.child)) {
|
|
68
|
-
if (minDegree > 2)
|
|
69
|
-
return false;
|
|
70
|
-
if (maxDegree && maxDegree < 2)
|
|
71
|
-
return false;
|
|
72
|
-
return ((0, variableNode_1.isVariableNode)(node.child.leftChild) && node.child.leftChild.name === "x");
|
|
73
|
-
}
|
|
74
|
-
if ((0, powerNode_1.isPowerNode)(node)) {
|
|
75
|
-
if (!node.rightChild.isNumeric)
|
|
76
|
-
return false;
|
|
77
|
-
const powerEv = node.rightChild.evaluate();
|
|
78
|
-
if (maxDegree && powerEv > maxDegree)
|
|
79
|
-
return false;
|
|
80
|
-
if (minDegree && powerEv < minDegree)
|
|
81
|
-
return false;
|
|
82
|
-
return (0, variableNode_1.isVariableNode)(node.leftChild) && node.leftChild.name === "x";
|
|
83
|
-
}
|
|
84
|
-
if ((0, oppositeNode_1.isOppositeNode)(node) && (0, powerNode_1.isPowerNode)(node.child)) {
|
|
85
|
-
if (!node.child.rightChild.isNumeric)
|
|
86
|
-
return false;
|
|
87
|
-
const powerEv = node.child.rightChild.evaluate();
|
|
88
|
-
if (maxDegree && powerEv > maxDegree)
|
|
89
|
-
return false;
|
|
90
|
-
if (minDegree && powerEv < minDegree)
|
|
91
|
-
return false;
|
|
92
|
-
return ((0, variableNode_1.isVariableNode)(node.child.leftChild) && node.child.leftChild.name === "x");
|
|
93
|
-
}
|
|
94
|
-
if ((0, multiplyNode_1.isMultiplyNode)(node)) {
|
|
95
|
-
const numericChild = node.leftChild.isNumeric
|
|
96
|
-
? "left"
|
|
97
|
-
: node.rightChild.isNumeric
|
|
98
|
-
? "right"
|
|
99
|
-
: undefined;
|
|
100
|
-
if (!numericChild)
|
|
101
|
-
return false;
|
|
102
|
-
const varChild = numericChild === "left" ? node.rightChild : node.leftChild;
|
|
103
|
-
if ((0, variableNode_1.isVariableNode)(varChild) && varChild.name === variable && minDegree < 2)
|
|
104
|
-
return true;
|
|
105
|
-
//new MonomNode(numericChild, 1, {variable});
|
|
106
|
-
if ((0, powerNode_1.isPowerNode)(varChild) &&
|
|
107
|
-
(0, variableNode_1.isVariableNode)(varChild.leftChild) &&
|
|
108
|
-
varChild.leftChild.name === variable &&
|
|
109
|
-
varChild.rightChild.isNumeric) {
|
|
110
|
-
const powerEv = varChild.rightChild.evaluate();
|
|
111
|
-
if (maxDegree && powerEv > maxDegree)
|
|
112
|
-
return false;
|
|
113
|
-
if (minDegree && powerEv < minDegree)
|
|
114
|
-
return false;
|
|
115
|
-
// new MonomNode(numericChild, powerEv, { variable });
|
|
116
|
-
return true;
|
|
117
|
-
}
|
|
118
|
-
}
|
|
119
|
-
if ((0, oppositeNode_1.isOppositeNode)(node) && (0, multiplyNode_1.isMultiplyNode)(node.child)) {
|
|
120
|
-
const numericChild = node.child.leftChild.isNumeric
|
|
121
|
-
? "left"
|
|
122
|
-
: node.child.rightChild.isNumeric
|
|
123
|
-
? "right"
|
|
124
|
-
: undefined;
|
|
125
|
-
if (!numericChild)
|
|
126
|
-
return false;
|
|
127
|
-
const varChild = numericChild === "left" ? node.child.rightChild : node.child.leftChild;
|
|
128
|
-
if ((0, variableNode_1.isVariableNode)(varChild) && varChild.name === variable && minDegree < 2)
|
|
129
|
-
return true;
|
|
130
|
-
//new MonomNode(numericChild, 1, {variable});
|
|
131
|
-
if ((0, powerNode_1.isPowerNode)(varChild) &&
|
|
132
|
-
(0, variableNode_1.isVariableNode)(varChild.leftChild) &&
|
|
133
|
-
varChild.leftChild.name === variable &&
|
|
134
|
-
varChild.rightChild.isNumeric) {
|
|
135
|
-
const powerEv = varChild.rightChild.evaluate();
|
|
136
|
-
if (maxDegree && powerEv > maxDegree)
|
|
137
|
-
return false;
|
|
138
|
-
if (minDegree && powerEv < minDegree)
|
|
139
|
-
return false;
|
|
140
|
-
// new MonomNode(numericChild, powerEv, { variable });
|
|
141
|
-
return true;
|
|
142
|
-
}
|
|
143
|
-
}
|
|
144
|
-
return false;
|
|
145
|
-
};
|
|
146
|
-
exports.isMonom = isMonom;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"polynomialParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/polynomialParser.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;
|
|
1
|
+
{"version":3,"file":"polynomialParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/polynomialParser.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAWvD,eAAO,MAAM,gBAAgB,QAAS,MAAM,8OAmC3C,CAAC"}
|
|
@@ -4,6 +4,7 @@ exports.polynomialParser = void 0;
|
|
|
4
4
|
const oppositeNode_1 = require("../nodes/functions/oppositeNode");
|
|
5
5
|
const addNode_1 = require("../nodes/operators/addNode");
|
|
6
6
|
const substractNode_1 = require("../nodes/operators/substractNode");
|
|
7
|
+
const monomNode_1 = require("../nodes/polynomials/monomNode");
|
|
7
8
|
const latexParser_1 = require("./latexParser");
|
|
8
9
|
const monomParser_1 = require("./monomParser");
|
|
9
10
|
const numberParser_1 = require("./numberParser");
|
|
@@ -37,7 +38,7 @@ const polynomialParser = (ans) => {
|
|
|
37
38
|
}
|
|
38
39
|
};
|
|
39
40
|
recursive(parsed);
|
|
40
|
-
if (externals.every((node) => (0,
|
|
41
|
+
if (externals.every((node) => (0, monomNode_1.isMonom)(node))) {
|
|
41
42
|
return parsed;
|
|
42
43
|
}
|
|
43
44
|
}
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
export declare const powerParser: (ans: string) => false | import("../nodes/operators/
|
|
1
|
+
export declare const powerParser: (ans: string) => false | import("../nodes/operators/fractionNode").FractionNode | import("../nodes/functions/sqrtNode").SqrtNode | import("../nodes/operators/powerNode").PowerNode;
|
|
2
2
|
//# sourceMappingURL=powerParser.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"powerParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/powerParser.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"powerParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/powerParser.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,WAAW,QAAS,MAAM,uKAgBtC,CAAC"}
|
|
@@ -1,6 +1,7 @@
|
|
|
1
1
|
"use strict";
|
|
2
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
3
|
exports.powerParser = void 0;
|
|
4
|
+
const sqrtNode_1 = require("../nodes/functions/sqrtNode");
|
|
4
5
|
const numberNode_1 = require("../nodes/numbers/numberNode");
|
|
5
6
|
const fractionNode_1 = require("../nodes/operators/fractionNode");
|
|
6
7
|
const powerNode_1 = require("../nodes/operators/powerNode");
|
|
@@ -10,7 +11,7 @@ const powerParser = (ans) => {
|
|
|
10
11
|
const parsed = (0, latexParser_1.parseAlgebraic)(ans);
|
|
11
12
|
if (!parsed)
|
|
12
13
|
return false;
|
|
13
|
-
if ((0, powerNode_1.isPowerNode)(parsed))
|
|
14
|
+
if ((0, powerNode_1.isPowerNode)(parsed) || (0, sqrtNode_1.isSqrtNode)(parsed))
|
|
14
15
|
return parsed;
|
|
15
16
|
if ((0, fractionNode_1.isFractionNode)(parsed) &&
|
|
16
17
|
(0, numberNode_1.isNumberNode)(parsed.leftChild) &&
|
|
@@ -1,3 +1,3 @@
|
|
|
1
1
|
import { FractionNode } from "../nodes/operators/fractionNode";
|
|
2
|
-
export declare const rationalParser: (ans: string) => false | import("../nodes/numbers/constantNode").ConstantNode | import("../nodes/numbers/numberNode").NumberNode | import("../nodes/functions/oppositeNode").OppositeNode<import("../nodes/algebraicNode").AlgebraicNode
|
|
2
|
+
export declare const rationalParser: (ans: string) => false | import("../nodes/numbers/constantNode").ConstantNode | import("../nodes/numbers/numberNode").NumberNode | FractionNode | import("../nodes/functions/oppositeNode").OppositeNode<import("../nodes/algebraicNode").AlgebraicNode>;
|
|
3
3
|
//# sourceMappingURL=rationalParser.d.ts.map
|
|
@@ -3,8 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
|
|
|
3
3
|
exports.trinomParser = void 0;
|
|
4
4
|
const addNode_1 = require("../nodes/operators/addNode");
|
|
5
5
|
const substractNode_1 = require("../nodes/operators/substractNode");
|
|
6
|
+
const monomNode_1 = require("../nodes/polynomials/monomNode");
|
|
6
7
|
const latexParser_1 = require("./latexParser");
|
|
7
|
-
const monomParser_1 = require("./monomParser");
|
|
8
8
|
const trinomParser = (ans, variable = "x") => {
|
|
9
9
|
try {
|
|
10
10
|
//! difficile !
|
|
@@ -13,7 +13,7 @@ const trinomParser = (ans, variable = "x") => {
|
|
|
13
13
|
const parsed = (0, latexParser_1.parseAlgebraic)(ans);
|
|
14
14
|
if (!parsed)
|
|
15
15
|
return false;
|
|
16
|
-
if ((0,
|
|
16
|
+
if ((0, monomNode_1.isMonom)(parsed, { variable, maxDegree: 2, minDegree: 2 }))
|
|
17
17
|
return parsed;
|
|
18
18
|
if ((0, addNode_1.isAddNode)(parsed) || (0, substractNode_1.isSubstractNode)(parsed)) {
|
|
19
19
|
const children = [parsed.leftChild, parsed.rightChild];
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
import { IntervalNode } from "../nodes/sets/intervalNode";
|
|
2
|
+
import { UnionIntervalNode } from "../nodes/sets/unionIntervalNode";
|
|
3
|
+
type Opts = {
|
|
4
|
+
allowCommaInsteadOfSemicolon?: boolean;
|
|
5
|
+
allowNoBrackets?: boolean;
|
|
6
|
+
};
|
|
7
|
+
export declare const unionIntervalParser: (ans: string, opts?: Opts) => false | UnionIntervalNode | IntervalNode;
|
|
8
|
+
export {};
|
|
9
|
+
//# sourceMappingURL=unionIntervalParser.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"unionIntervalParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/unionIntervalParser.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAIpE,KAAK,IAAI,GAAG;IACV,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AACF,eAAO,MAAM,mBAAmB,QAAS,MAAM,SAAS,IAAI,6CAe3D,CAAC"}
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.unionIntervalParser = void 0;
|
|
4
|
+
const unionIntervalNode_1 = require("../nodes/sets/unionIntervalNode");
|
|
5
|
+
const intervalParser_1 = require("./intervalParser");
|
|
6
|
+
const unionIntervalParser = (ans, opts) => {
|
|
7
|
+
try {
|
|
8
|
+
const intervals = [];
|
|
9
|
+
const splitted = ans.split("\\cup");
|
|
10
|
+
splitted.forEach((s) => {
|
|
11
|
+
const parsed = (0, intervalParser_1.intervalParser)(s, opts);
|
|
12
|
+
if (!parsed)
|
|
13
|
+
return;
|
|
14
|
+
intervals.push(parsed);
|
|
15
|
+
});
|
|
16
|
+
if (intervals.length === 0)
|
|
17
|
+
return false;
|
|
18
|
+
if (intervals.length === 1)
|
|
19
|
+
return intervals[0];
|
|
20
|
+
return new unionIntervalNode_1.UnionIntervalNode(intervals);
|
|
21
|
+
}
|
|
22
|
+
catch (err) {
|
|
23
|
+
return false;
|
|
24
|
+
}
|
|
25
|
+
};
|
|
26
|
+
exports.unionIntervalParser = unionIntervalParser;
|
package/lib/types/keyIds.d.ts
CHANGED
|
@@ -14,7 +14,7 @@ export type KeyId =
|
|
|
14
14
|
/**sets */
|
|
15
15
|
| "belongs" | "notin" | "cap" | "cup" | "lbrace" | "rbrace" | "lbracket" | "lbracketNoSpace" | "rbracket" | "rbracketNoSpace" | "varnothing" | "naturals" | "integers" | "rationals" | "decimals" | "reals" | "complex" | "ast" | "del" | "right" | "left" | "rightarrow" | "overrightarrow" | "infty"
|
|
16
16
|
/**fcts */
|
|
17
|
-
| "log" | "ln" | "exp" | "epower" | "sin" | "cos" | "tan" | "arccos" | "arcsin" | "arctan" | "abs" | "fx" | "fParenthesis"
|
|
17
|
+
| "log" | "ln" | "exp" | "epower" | "sin" | "cos" | "tan" | "arccos" | "arcsin" | "arctan" | "abs" | "fx" | "fParenthesis" | "lnBrackets" | "logBrackets"
|
|
18
18
|
/**sequences */
|
|
19
19
|
| "un" | "unplus1"
|
|
20
20
|
/**probas */
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"keyIds.d.ts","sourceRoot":"","sources":["../../src/types/keyIds.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,KAAK;AACf,gBAAgB;AACd,YAAY,GACZ,aAAa,GACb,mBAAmB,GACnB,oBAAoB;AACtB,WAAW;GACT,IAAI,GACJ,KAAK,GACL,SAAS,GACT,IAAI,GACJ,KAAK,GACL,IAAI,GACJ,IAAI,GACJ,SAAS,GACT,OAAO,GACP,eAAe;AAEjB,aAAa;GACX,QAAQ,GACR,OAAO,GACP,MAAM,GACN,YAAY,GACZ,KAAK,GACL,OAAO,GACP,QAAQ,GACR,KAAK;AAEP,WAAW;GACT,IAAI,GACJ,IAAI,GACJ,OAAO;AAET,cAAc;GACZ,gBAAgB,GAChB,QAAQ,GACR,SAAS,GACT,SAAS;AAEX,gBAAgB;GACd,MAAM,GACN,OAAO,GACP,OAAO,GACP,MAAM,GACN,QAAQ,GACR,MAAM,GACN,SAAS,GACT,QAAQ,GACR,MAAM,GACN,OAAO,GACP,SAAS,GACT,iBAAiB,GACjB,uBAAuB,GACvB,kBAAkB,GAClB,yBAAyB,GACzB,OAAO,GACP,OAAO,GACP,WAAW,GACX,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,SAAS,GACT,OAAO,GACP,YAAY;AAEd,UAAU;GACR,SAAS,GACT,OAAO,GACP,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,UAAU,GACV,iBAAiB,GACjB,UAAU,GACV,iBAAiB,GACjB,YAAY,GACZ,UAAU,GACV,UAAU,GACV,WAAW,GACX,UAAU,GACV,OAAO,GACP,SAAS,GACT,KAAK,GACL,KAAK,GACL,OAAO,GACP,MAAM,GACN,YAAY,GACZ,gBAAgB,GAChB,OAAO;AAET,UAAU;GACR,KAAK,GACL,IAAI,GACJ,KAAK,GACL,QAAQ,GACR,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,KAAK,GACL,IAAI,GACJ,cAAc;
|
|
1
|
+
{"version":3,"file":"keyIds.d.ts","sourceRoot":"","sources":["../../src/types/keyIds.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,KAAK;AACf,gBAAgB;AACd,YAAY,GACZ,aAAa,GACb,mBAAmB,GACnB,oBAAoB;AACtB,WAAW;GACT,IAAI,GACJ,KAAK,GACL,SAAS,GACT,IAAI,GACJ,KAAK,GACL,IAAI,GACJ,IAAI,GACJ,SAAS,GACT,OAAO,GACP,eAAe;AAEjB,aAAa;GACX,QAAQ,GACR,OAAO,GACP,MAAM,GACN,YAAY,GACZ,KAAK,GACL,OAAO,GACP,QAAQ,GACR,KAAK;AAEP,WAAW;GACT,IAAI,GACJ,IAAI,GACJ,OAAO;AAET,cAAc;GACZ,gBAAgB,GAChB,QAAQ,GACR,SAAS,GACT,SAAS;AAEX,gBAAgB;GACd,MAAM,GACN,OAAO,GACP,OAAO,GACP,MAAM,GACN,QAAQ,GACR,MAAM,GACN,SAAS,GACT,QAAQ,GACR,MAAM,GACN,OAAO,GACP,SAAS,GACT,iBAAiB,GACjB,uBAAuB,GACvB,kBAAkB,GAClB,yBAAyB,GACzB,OAAO,GACP,OAAO,GACP,WAAW,GACX,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,SAAS,GACT,OAAO,GACP,YAAY;AAEd,UAAU;GACR,SAAS,GACT,OAAO,GACP,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,UAAU,GACV,iBAAiB,GACjB,UAAU,GACV,iBAAiB,GACjB,YAAY,GACZ,UAAU,GACV,UAAU,GACV,WAAW,GACX,UAAU,GACV,OAAO,GACP,SAAS,GACT,KAAK,GACL,KAAK,GACL,OAAO,GACP,MAAM,GACN,YAAY,GACZ,gBAAgB,GAChB,OAAO;AAET,UAAU;GACR,KAAK,GACL,IAAI,GACJ,KAAK,GACL,QAAQ,GACR,KAAK,GACL,KAAK,GACL,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,KAAK,GACL,IAAI,GACJ,cAAc,GACd,YAAY,GACZ,aAAa;AAEf,eAAe;GACb,IAAI,GACJ,SAAS;AAEX,YAAY;GACV,eAAe,GACf,UAAU,GACV,UAAU,GACV,OAAO;AAET,aAAa;GACX,UAAU;AAEZ,WAAW;GACT,OAAO,GACP,MAAM,GACN,OAAO,GACP,OAAO,GACP,OAAO,GACP,OAAO,GACP,KAAK,GACL,IAAI,GACJ,KAAK,GACL,OAAO,GACP,QAAQ,GACR,IAAI,GACJ,OAAO,GACP,OAAO;AAET,cAAc;GACZ,WAAW,GACX,OAAO,GACP,QAAQ,GACR,MAAM,GACN,OAAO,GACP,YAAY,GACZ,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG;AAEL,aAAa;GACX,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG;AAEL,WAAW;GACT,WAAW,GACX,QAAQ,GACR,SAAS,GACT,WAAW,GACX,MAAM,GACN,SAAS,GACT,OAAO,GACP,SAAS,GACT,OAAO,GACP,MAAM,GACN,QAAQ,GACR,WAAW,GACX,WAAW,GACX,UAAU,GACV,WAAW,GACX,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,WAAW,GACX,SAAS,GACT,UAAU,GACV,QAAQ,GACR,UAAU,GACV,QAAQ,GACR,WAAW,GACX,KAAK,GACL,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,MAAM,GACN,SAAS,GACT,WAAW,GACX,SAAS,GACT,UAAU,GACV,OAAO,GACP,SAAS,GACT,UAAU,GACV,WAAW,GACX,SAAS,GACT,WAAW,GACX,SAAS,GACT,WAAW,GACX,YAAY,GACZ,WAAW,GACX,SAAS,GACT,WAAW,GACX,QAAQ,GACR,SAAS,GACT,QAAQ,GACR,OAAO,GACP,WAAW,GACX,SAAS,GACT,MAAM,GACN,OAAO,GACP,QAAQ,GACR,QAAQ,GACR,UAAU,GACV,QAAQ,GACR,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,UAAU,GACV,UAAU,GACV,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,SAAS,GACT,QAAQ,GACR,SAAS,GACT,WAAW,GACX,UAAU,GACV,SAAS,GACT,SAAS,GACT,WAAW,GACX,SAAS,GACT,QAAQ,GACR,SAAS,GACT,SAAS,GACT,IAAI,GACJ,SAAS,GACT,UAAU,GACV,OAAO,GACP,SAAS,GACT,UAAU,GACV,QAAQ,GACR,OAAO,GACP,UAAU,GACV,QAAQ,GACR,UAAU,GACV,SAAS,GACT,cAAc,GACd,SAAS,GACT,WAAW,GACX,WAAW,GACX,WAAW,GACX,QAAQ,GACR,WAAW,GACX,aAAa,GACb,aAAa,GACb,SAAS,GACT,aAAa,GACb,UAAU,GACV,YAAY,GACZ,eAAe,GACf,SAAS,GACT,YAAY,GACZ,SAAS,GACT,SAAS,GACT,YAAY,GACZ,cAAc,GACd,aAAa,GACb,aAAa,GACb,UAAU,GACV,WAAW,GACX,WAAW,GACX,aAAa,GACb,YAAY,GACZ,WAAW;AAEb,eAAe;GACb,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,SAAS,GACT,SAAS,GACT,SAAS,GACT,SAAS,GACT,YAAY,GACZ,aAAa,GACb,WAAW,GACX,UAAU,GACV,WAAW,GACX,WAAW,GACX,UAAU,GACV,UAAU,GACV,WAAW,GACX,UAAU,GACV,YAAY,GACZ,WAAW,GACX,aAAa,GACb,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,eAAe,GACf,aAAa,GACb,UAAU,GACV,aAAa,GACb,QAAQ,GACR,SAAS,GACT,QAAQ,GACR,WAAW,GACX,UAAU,GACV,UAAU,GACV,WAAW,GACX,UAAU,GACV,YAAY,GACZ,UAAU,GACV,WAAW,GACX,WAAW,GACX,YAAY,GACZ,YAAY,GACZ,aAAa,GACb,WAAW,GACX,WAAW,GACX,WAAW,GACX,YAAY,GACZ,WAAW,GACX,eAAe,GACf,SAAS,GACT,UAAU,GACV,WAAW,GACX,UAAU,GACV,WAAW,GACX,WAAW,GACX,WAAW,GACX,WAAW,GACX,WAAW,GACX,YAAY,GACZ,QAAQ,GACR,WAAW,GACX,SAAS,GACT,WAAW,GACX,UAAU,GACV,WAAW,GACX,QAAQ,GACR,UAAU,GACV,SAAS,GACT,cAAc,GACd,OAAO,GACP,YAAY,GACZ,WAAW,GACX,QAAQ,GACR,YAAY,GACZ,QAAQ,GACR,aAAa,GACb,UAAU,GACV,QAAQ,GACR,YAAY,GACZ,WAAW,GACX,SAAS,GACT,WAAW,GACX,WAAW,GACX,SAAS,GACT,SAAS,GACT,UAAU,GACV,SAAS,GACT,WAAW,GACX,WAAW,GACX,WAAW,GACX,UAAU,GACV,QAAQ,GACR,QAAQ,GACR,WAAW,GACX,UAAU,GACV,UAAU,GACV,UAAU,GACV,WAAW,GACX,UAAU,GACV,SAAS,GACT,SAAS,GACT,WAAW,GACX,YAAY,GACZ,UAAU,GACV,aAAa,GACb,WAAW,GACX,QAAQ,GACR,WAAW,GACX,WAAW,CAAC"}
|