math-exercises 3.0.201 → 3.0.203
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/dataRepresentations/scatterPlot/index.d.ts +2 -0
- package/lib/exercises/math/dataRepresentations/scatterPlot/index.d.ts.map +1 -1
- package/lib/exercises/math/dataRepresentations/scatterPlot/index.js +2 -2
- package/lib/exercises/math/dataRepresentations/scatterPlot/scatterPlotFillDataTableFromScatterPlotData.js +2 -2
- package/lib/exercises/math/dataRepresentations/scatterPlot/scatterPlotFillDataTableWithDataClassesFromScatterPlotData.d.ts.map +1 -1
- package/lib/exercises/math/dataRepresentations/scatterPlot/scatterPlotFillDataTableWithDataClassesFromScatterPlotData.js +9 -2
- package/lib/exercises/math/derivation/derivative/exp/secondDerivativeOfExpoFunction.js +1 -1
- package/lib/exercises/math/derivation/derivative/trigo/index.d.ts +1 -0
- package/lib/exercises/math/derivation/derivative/trigo/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/derivative/trigo/index.js +1 -1
- package/lib/exercises/math/derivation/derivative/trigo/productOfSinAXPlusBCosCXPlusDDerivative.js +1 -1
- package/lib/exercises/math/derivation/derivative/trigo/sinAndCosMixedWithSquareDerivative.js +1 -1
- package/lib/exercises/math/derivation/derivative/trigo/sinCosDerivativeRewriteUsingCos2PlusSin2Equals1.js +1 -1
- package/lib/exercises/math/derivation/problems/index.d.ts +1 -0
- package/lib/exercises/math/derivation/problems/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/problems/index.js +1 -1
- package/lib/exercises/math/derivation/problems/problemMaximizeProfitFindProduction.d.ts.map +1 -1
- package/lib/exercises/math/derivation/problems/problemMaximizeProfitFindProduction.js +31 -21
- package/lib/exercises/math/derivation/tangent/derivativeEquationSolvingByManipulatingLineY.d.ts.map +1 -1
- package/lib/exercises/math/derivation/tangent/derivativeEquationSolvingByManipulatingLineY.js +8 -128
- package/lib/exercises/math/derivation/tangent/index.d.ts +1 -0
- package/lib/exercises/math/derivation/tangent/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/tangent/index.js +1 -1
- package/lib/exercises/math/derivation/variations/index.d.ts +1 -0
- package/lib/exercises/math/derivation/variations/index.d.ts.map +1 -1
- package/lib/exercises/math/derivation/variations/index.js +1 -1
- package/lib/exercises/math/derivation/variations/signVarTableQuotientFExp.d.ts.map +1 -1
- package/lib/exercises/math/derivation/variations/signVarTableQuotientFExp.js +47 -20
- package/lib/exercises/math/equaDiff/equaDiffAyPlusB.d.ts.map +1 -1
- package/lib/exercises/math/equaDiff/equaDiffAyPlusB.js +29 -6
- package/lib/exercises/math/equaDiff/equaDiffCheckSolutionFirstOrder.d.ts.map +1 -1
- package/lib/exercises/math/equaDiff/equaDiffCheckSolutionFirstOrder.js +33 -0
- package/lib/exercises/math/equaDiff/exponentialDifferentialEquation.d.ts +7 -0
- package/lib/exercises/math/equaDiff/exponentialDifferentialEquation.d.ts.map +1 -0
- package/lib/exercises/math/equaDiff/exponentialDifferentialEquation.js +86 -0
- package/lib/exercises/math/equaDiff/exponentialDifferentialEquationWithIC.d.ts.map +1 -1
- package/lib/exercises/math/equaDiff/exponentialDifferentialEquationWithIC.js +35 -7
- package/lib/exercises/math/equaDiff/index.d.ts +1 -1
- package/lib/exercises/math/equaDiff/index.d.ts.map +1 -1
- package/lib/exercises/math/equaDiff/index.js +1 -1
- package/lib/exercises/math/functions/integral/integralExpU.d.ts.map +1 -1
- package/lib/exercises/math/functions/integral/integralExpU.js +48 -0
- package/lib/exercises/math/functions/integral/integralFractions.d.ts.map +1 -1
- package/lib/exercises/math/functions/integral/integralFractions.js +52 -0
- package/lib/exercises/math/functions/integral/integralTrinomials.d.ts.map +1 -1
- package/lib/exercises/math/functions/integral/integralTrinomials.js +40 -0
- package/lib/exercises/math/functions/logarithm/log10Simplifying.js +2 -2
- package/lib/exercises/math/functions/logarithm/powerEquation.js +1 -1
- package/lib/exercises/math/geometry/angles/anglesUsingIsParallel.d.ts.map +1 -1
- package/lib/exercises/math/geometry/angles/anglesUsingIsParallel.js +172 -51
- package/lib/exercises/math/geometry/angles/index.d.ts +1 -0
- package/lib/exercises/math/geometry/angles/index.d.ts.map +1 -1
- package/lib/exercises/math/geometry/angles/index.js +1 -1
- package/lib/exercises/math/geometry/parametric/extractVectorFromParametricLine.d.ts.map +1 -1
- package/lib/exercises/math/geometry/parametric/extractVectorFromParametricLine.js +30 -25
- package/lib/exercises/math/geometry/parametric/pointFromParametricLine.d.ts.map +1 -1
- package/lib/exercises/math/geometry/parametric/pointFromParametricLine.js +52 -5
- package/lib/exercises/math/integration/fromExpr/areaBetweenCrossingCurvesFixedPosFromExpr.d.ts.map +1 -1
- package/lib/exercises/math/integration/fromExpr/areaBetweenCrossingCurvesFixedPosFromExpr.js +26 -35
- package/lib/exercises/math/integration/fromExpr/index.d.ts +1 -0
- package/lib/exercises/math/integration/fromExpr/index.d.ts.map +1 -1
- package/lib/exercises/math/integration/fromExpr/index.js +1 -1
- package/lib/exercises/math/limits/index.d.ts +1 -5
- package/lib/exercises/math/limits/index.d.ts.map +1 -1
- package/lib/exercises/math/limits/index.js +1 -5
- package/lib/exercises/math/limits/limitReading.d.ts.map +1 -1
- package/lib/exercises/math/limits/limitReading.js +70 -0
- package/lib/exercises/math/limits/polynomLimit.d.ts.map +1 -1
- package/lib/exercises/math/limits/polynomLimit.js +55 -4
- package/lib/exercises/math/limits/polynomLimitNoFI.d.ts.map +1 -1
- package/lib/exercises/math/limits/polynomLimitNoFI.js +35 -2
- package/lib/exercises/math/limits/sequenceGeometricLimit.d.ts.map +1 -1
- package/lib/exercises/math/limits/sequenceGeometricLimit.js +45 -9
- package/lib/exercises/math/limits/sequencePolynomLimit.d.ts.map +1 -1
- package/lib/exercises/math/limits/sequencePolynomLimit.js +56 -3
- package/lib/exercises/math/limits/sequencePolynomNoFILimit.d.ts.map +1 -1
- package/lib/exercises/math/limits/sequencePolynomNoFILimit.js +32 -0
- package/lib/exercises/math/limits/sequencePolynomProductLimit.d.ts.map +1 -1
- package/lib/exercises/math/limits/sequencePolynomProductLimit.js +33 -3
- package/lib/exercises/math/limits/sequenceRationalFracLimit.d.ts.map +1 -1
- package/lib/exercises/math/limits/sequenceRationalFracLimit.js +2 -2
- package/lib/exercises/math/limits/sequences/index.d.ts +6 -0
- package/lib/exercises/math/limits/sequences/index.d.ts.map +1 -0
- package/lib/exercises/math/limits/sequences/index.js +5 -0
- package/lib/exercises/math/limits/sequences/sequenceGeometricLimit.d.ts +9 -0
- package/lib/exercises/math/limits/sequences/sequenceGeometricLimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/sequences/sequenceGeometricLimit.js +110 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomLimit.d.ts +7 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomLimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomLimit.js +116 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomNoFILimit.d.ts +7 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomNoFILimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomNoFILimit.js +95 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomProductLimit.d.ts +8 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomProductLimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/sequences/sequencePolynomProductLimit.js +111 -0
- package/lib/exercises/math/limits/sequences/sequenceRationalFracLimit.d.ts +8 -0
- package/lib/exercises/math/limits/sequences/sequenceRationalFracLimit.d.ts.map +1 -0
- package/lib/exercises/math/limits/sequences/sequenceRationalFracLimit.js +114 -0
- package/lib/exercises/math/primitive/constantPrimitive.d.ts.map +1 -1
- package/lib/exercises/math/primitive/constantPrimitive.js +25 -1
- package/lib/exercises/math/primitive/exponentialPrimitive.d.ts.map +1 -1
- package/lib/exercises/math/primitive/exponentialPrimitive.js +17 -0
- package/lib/exercises/math/primitive/polynomialPrimitive.d.ts.map +1 -1
- package/lib/exercises/math/primitive/polynomialPrimitive.js +17 -1
- package/lib/exercises/math/primitive/sinCosPrimitive.d.ts.map +1 -1
- package/lib/exercises/math/primitive/sinCosPrimitive.js +20 -1
- package/lib/exercises/math/primitive/usualPrimitives.d.ts.map +1 -1
- package/lib/exercises/math/primitive/usualPrimitives.js +1 -0
- package/lib/exercises/math/sequences/index.d.ts +1 -0
- package/lib/exercises/math/sequences/index.d.ts.map +1 -1
- package/lib/exercises/math/sequences/index.js +1 -0
- package/lib/exercises/math/sequences/proofByInduction/index.d.ts +5 -0
- package/lib/exercises/math/sequences/proofByInduction/index.d.ts.map +1 -0
- package/lib/exercises/math/sequences/proofByInduction/index.js +4 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionCheckInitialization.d.ts +10 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionCheckInitialization.d.ts.map +1 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionCheckInitialization.js +236 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionReorderProof.d.ts +13 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionReorderProof.d.ts.map +1 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionReorderProof.js +244 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionSituations.d.ts +98 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionSituations.d.ts.map +1 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionSituations.js +175 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionWriteMissingStep.d.ts +13 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionWriteMissingStep.d.ts.map +1 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionWriteMissingStep.js +317 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionWritePropAtRankKPlus1.d.ts +13 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionWritePropAtRankKPlus1.d.ts.map +1 -0
- package/lib/exercises/math/sequences/proofByInduction/proofByInductionWritePropAtRankKPlus1.js +265 -0
- package/lib/exercises/math/sets/cartesianProduct/findCardinalOfCartesianProductOfFiniteSets.js +4 -4
- package/lib/exercises/math/sets/cartesianProduct/findCardinalOfCartesianProductOfFiniteSetsFromSituation.js +3 -3
- package/lib/exercises/math/sets/cartesianProduct/proposeElementInCartesianProductOfFiniteSets.js +4 -4
- package/lib/exercises/math/spaceGeometry/basis/spaceCoordinatesOfPointInCubeCoordSystemFromVecPath.js +1 -1
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/findOrthogonalProjectionOfPointOnPlane.js +12 -25
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.d.ts +1 -1
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/orthogonalProjection/index.js +1 -2
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/planes/findNormalVectorFromPlanePointsCoords.js +11 -26
- package/lib/exercises/math/spaceGeometry/planes/index.d.ts +1 -0
- package/lib/exercises/math/spaceGeometry/planes/index.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/planes/index.js +1 -1
- package/lib/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/planes/planePlaneRelativePositions.js +11 -25
- package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/scalarProduct/angleFromScalarProductFromSpacePointCoords.js +25 -5
- package/lib/exercises/math/spaceGeometry/scalarProduct/index.d.ts +1 -0
- package/lib/exercises/math/spaceGeometry/scalarProduct/index.d.ts.map +1 -1
- package/lib/exercises/math/spaceGeometry/scalarProduct/index.js +1 -1
- package/lib/exercises/math/spaceGeometry/vectors/findLinearDecompositionWrtCoplanarUVFromCoords.js +2 -2
- package/lib/exercises/math/trigonometry/functions/equationCosOnRandomInterval.d.ts.map +1 -1
- package/lib/exercises/math/trigonometry/functions/equationCosOnRandomInterval.js +87 -24
- package/lib/exercises/pc/mathExosInPC.d.ts +1 -1
- package/lib/exercises/pc/mathExosInPC.d.ts.map +1 -1
- package/lib/exercises/pc/mathExosInPC.js +1 -1
- package/lib/exercises/vea/polynomialVEA.d.ts.map +1 -1
- package/lib/exercises/vea/polynomialVEA.js +4 -0
- package/lib/index.d.ts +104 -13
- package/lib/index.d.ts.map +1 -1
- package/lib/math/geometry/point.d.ts.map +1 -1
- package/lib/math/geometry/point.js +1 -1
- package/lib/math/geometry/spaceVector.d.ts +2 -0
- package/lib/math/geometry/spaceVector.d.ts.map +1 -1
- package/lib/math/geometry/spaceVector.js +40 -0
- package/lib/math/utils/functions/functionDecomposition.d.ts +2 -2
- package/lib/math/utils/functions/functionDecomposition.d.ts.map +1 -1
- package/lib/math/utils/polynomial/polynomialUtils.d.ts +2 -2
- package/lib/math/utils/polynomial/polynomialUtils.d.ts.map +1 -1
- package/lib/math/utils/polynomial/polynomialUtils.js +5 -2
- package/lib/tests/exoTest.d.ts.map +1 -1
- package/lib/tests/exoTest.js +8 -12
- package/lib/tests/questionTest.d.ts.map +1 -1
- package/lib/tests/questionTest.js +14 -6
- package/lib/tests/singleExo.test.js +2 -2
- package/lib/tree/nodes/node.d.ts +2 -1
- package/lib/tree/nodes/node.d.ts.map +1 -1
- package/lib/tree/nodes/node.js +1 -0
- package/lib/tree/nodes/student/iDontKnowNode.d.ts +26 -0
- package/lib/tree/nodes/student/iDontKnowNode.d.ts.map +1 -0
- package/lib/tree/nodes/student/iDontKnowNode.js +63 -0
- package/lib/tree/parsers/latexParser.d.ts +3 -2
- package/lib/tree/parsers/latexParser.d.ts.map +1 -1
- package/lib/tree/parsers/latexParser.js +7 -0
- package/lib/tree/parsers/monomParser.d.ts +1 -1
- package/lib/tree/parsers/monomParser.d.ts.map +1 -1
- package/lib/tree/parsers/polynomialParser.d.ts +1 -1
- package/lib/tree/parsers/polynomialParser.d.ts.map +1 -1
- package/lib/tree/parsers/trinomParser.d.ts +1 -1
- package/lib/tree/parsers/trinomParser.d.ts.map +1 -1
- package/lib/tree/utilities/nodeComparator.d.ts +3 -1
- package/lib/tree/utilities/nodeComparator.d.ts.map +1 -1
- package/lib/tree/utilities/nodeComparator.js +68 -8
- package/lib/tree/utilities/nodeSimplifier.d.ts +1 -0
- package/lib/tree/utilities/nodeSimplifier.d.ts.map +1 -1
- package/lib/tree/utilities/nodeSimplifier.js +40 -0
- package/package.json +1 -1
package/lib/index.d.ts
CHANGED
|
@@ -1005,6 +1005,11 @@ declare const mathExercises: (Exercise<{
|
|
|
1005
1005
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
1006
1006
|
nodeIdsU: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1007
1007
|
nodeIdsV: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1008
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
1009
|
+
nodeIdsLambda: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1010
|
+
nodeIdsU: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1011
|
+
nodeIdsV: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1012
|
+
nodeIdsRewriteUsing: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1008
1013
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
1009
1014
|
affineA: number;
|
|
1010
1015
|
affineB: number;
|
|
@@ -1130,6 +1135,10 @@ declare const mathExercises: (Exercise<{
|
|
|
1130
1135
|
x: number;
|
|
1131
1136
|
k: number;
|
|
1132
1137
|
nodeIds: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers[];
|
|
1138
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
1139
|
+
nodeIdsSlope: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1140
|
+
nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1141
|
+
nodeIdsAbscissa: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers[];
|
|
1133
1142
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
1134
1143
|
pofIds: import("./math/utils/polynomial/polynomialInterpolationUtils.js").PointOfFunctionIdentifiers[];
|
|
1135
1144
|
cubicSplineIds: {
|
|
@@ -1197,6 +1206,11 @@ declare const mathExercises: (Exercise<{
|
|
|
1197
1206
|
coeffsF: number[];
|
|
1198
1207
|
}, {
|
|
1199
1208
|
typeF: string;
|
|
1209
|
+
}> | Exercise<{
|
|
1210
|
+
coeffsF: number[];
|
|
1211
|
+
isFOverExp: boolean;
|
|
1212
|
+
}, {
|
|
1213
|
+
typeF: string;
|
|
1200
1214
|
}> | Exercise<{
|
|
1201
1215
|
nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1202
1216
|
typeF: string;
|
|
@@ -1261,6 +1275,13 @@ declare const mathExercises: (Exercise<{
|
|
|
1261
1275
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
1262
1276
|
nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1263
1277
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
1278
|
+
nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1279
|
+
pofIds: import("./math/utils/polynomial/polynomialInterpolationUtils.js").PointOfFunctionIdentifiers[];
|
|
1280
|
+
boundPHigh: number;
|
|
1281
|
+
typeF: string;
|
|
1282
|
+
}, {
|
|
1283
|
+
typeF: string;
|
|
1284
|
+
}> | Exercise<{
|
|
1264
1285
|
nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1265
1286
|
nodeIdsValueFunction: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
1266
1287
|
typeF: string;
|
|
@@ -2836,6 +2857,20 @@ declare const mathExercises: (Exercise<{
|
|
|
2836
2857
|
doubleAngle: number;
|
|
2837
2858
|
singleAngle: number;
|
|
2838
2859
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
2860
|
+
isParallel: boolean;
|
|
2861
|
+
angleType: "alternes-internes" | "correspondants" | "alternes-externes" | "autres";
|
|
2862
|
+
arrIntersectionIds: {
|
|
2863
|
+
center: import("./math/geometry/point.js").PointIdentifiers;
|
|
2864
|
+
lineH: import("./math/geometry/line.js").LineIdentifiers;
|
|
2865
|
+
lineV: import("./math/geometry/line.js").LineIdentifiers;
|
|
2866
|
+
}[];
|
|
2867
|
+
arrAngleIndex: number[];
|
|
2868
|
+
arrAngleForLabel: number[] | undefined;
|
|
2869
|
+
}, {
|
|
2870
|
+
angleTypes: ("alternes-internes" | "correspondants" | "alternes-externes" | "autres")[];
|
|
2871
|
+
isFakeDisplay: boolean;
|
|
2872
|
+
nbDigits: "0" | "1" | "2";
|
|
2873
|
+
}> | Exercise<{
|
|
2839
2874
|
lines: {
|
|
2840
2875
|
pointA: number[];
|
|
2841
2876
|
pointB: number[];
|
|
@@ -2993,19 +3028,6 @@ declare const mathExercises: (Exercise<{
|
|
|
2993
3028
|
limitTo: "+\\infty" | "-\\infty";
|
|
2994
3029
|
numCoeffs: number[];
|
|
2995
3030
|
denumCoeffs: number[];
|
|
2996
|
-
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
2997
|
-
reason: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
2998
|
-
firstTerm: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
2999
|
-
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3000
|
-
coeffs: number[];
|
|
3001
|
-
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3002
|
-
coeffs: number[];
|
|
3003
|
-
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3004
|
-
polyNumCoeffs: number[];
|
|
3005
|
-
polyDenumCoeffs: number[];
|
|
3006
|
-
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3007
|
-
numCoeffs: number[];
|
|
3008
|
-
denumCoeffs: number[];
|
|
3009
3031
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3010
3032
|
type: number;
|
|
3011
3033
|
to: string;
|
|
@@ -3027,6 +3049,19 @@ declare const mathExercises: (Exercise<{
|
|
|
3027
3049
|
nodeIdsLimitAbscissa: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
3028
3050
|
nodeIdsP: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
3029
3051
|
isPossible: boolean;
|
|
3052
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3053
|
+
reason: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
3054
|
+
firstTerm: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
3055
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3056
|
+
coeffs: number[];
|
|
3057
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3058
|
+
coeffs: number[];
|
|
3059
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3060
|
+
polyNumCoeffs: number[];
|
|
3061
|
+
polyDenumCoeffs: number[];
|
|
3062
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3063
|
+
numCoeffs: number[];
|
|
3064
|
+
denumCoeffs: number[];
|
|
3030
3065
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
3031
3066
|
a: string;
|
|
3032
3067
|
b: string;
|
|
@@ -4079,6 +4114,28 @@ declare const mathExercises: (Exercise<{
|
|
|
4079
4114
|
type: number;
|
|
4080
4115
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4081
4116
|
coeffs: number[];
|
|
4117
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4118
|
+
situationParams: import("./exercises/math/sequences/proofByInduction/proofByInductionSituations.js").ProofByInductionSituationParams;
|
|
4119
|
+
isValid: boolean;
|
|
4120
|
+
indexForNodeProperty: number;
|
|
4121
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4122
|
+
situationParams: import("./exercises/math/sequences/proofByInduction/proofByInductionSituations.js").ProofByInductionSituationParams;
|
|
4123
|
+
isValid: boolean;
|
|
4124
|
+
indexForNodeProperty: number;
|
|
4125
|
+
nodeIdsVarStepDefinition: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
4126
|
+
nodeIdsVarStepInduction: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
4127
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4128
|
+
situationParams: import("./exercises/math/sequences/proofByInduction/proofByInductionSituations.js").ProofByInductionSituationParams;
|
|
4129
|
+
isValid: boolean;
|
|
4130
|
+
indexForNodeProperty: number;
|
|
4131
|
+
nodeIdsVarStepDefinition: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
4132
|
+
nodeIdsVarStepInduction: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
4133
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4134
|
+
situationParams: import("./exercises/math/sequences/proofByInduction/proofByInductionSituations.js").ProofByInductionSituationParams;
|
|
4135
|
+
isValid: boolean;
|
|
4136
|
+
indexForNodeProperty: number;
|
|
4137
|
+
nodeIdsVarStepDefinition: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
4138
|
+
nodeIdsVarStepInduction: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
4082
4139
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4083
4140
|
intervalIdentifiers: import("./tree/nodes/sets/intervalNode.js").IntervalNodeIdentifiers;
|
|
4084
4141
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
@@ -4297,6 +4354,9 @@ declare const mathExercises: (Exercise<{
|
|
|
4297
4354
|
}, {
|
|
4298
4355
|
typeDataForParallelLine: string;
|
|
4299
4356
|
}> | Exercise<{
|
|
4357
|
+
spacePointIdsPlanePoints: import("./math/geometry/spacePoint.js").SpacePointIdentifiers[];
|
|
4358
|
+
spaceVectorIdsProposed: import("./math/geometry/spaceVector.js").SpaceVectorIdentifiers[];
|
|
4359
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4300
4360
|
idsP1: {
|
|
4301
4361
|
spacePointIdsContained: import("./math/geometry/spacePoint.js").SpacePointIdentifiers;
|
|
4302
4362
|
spaceVectorIdsNormal: import("./math/geometry/spaceVector.js").SpaceVectorIdentifiers;
|
|
@@ -4406,6 +4466,8 @@ declare const mathExercises: (Exercise<{
|
|
|
4406
4466
|
isIncludeMidpoints: boolean;
|
|
4407
4467
|
}> | Exercise<{
|
|
4408
4468
|
spacePointIds: import("./math/geometry/spacePoint.js").SpacePointIdentifiers[];
|
|
4469
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4470
|
+
spacePointIds: import("./math/geometry/spacePoint.js").SpacePointIdentifiers[];
|
|
4409
4471
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4410
4472
|
spacePointIdsForVecs: import("./math/geometry/spacePoint.js").SpacePointIdentifiers[];
|
|
4411
4473
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
@@ -4415,6 +4477,18 @@ declare const mathExercises: (Exercise<{
|
|
|
4415
4477
|
spacePointIdsForAB: import("./math/geometry/spacePoint.js").SpacePointIdentifiers[];
|
|
4416
4478
|
spacePointIdsForUV: import("./math/geometry/spacePoint.js").SpacePointIdentifiers[];
|
|
4417
4479
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4480
|
+
idsP: {
|
|
4481
|
+
spacePointIdsContained: import("./math/geometry/spacePoint.js").SpacePointIdentifiers;
|
|
4482
|
+
spaceVectorIdsNormal: import("./math/geometry/spaceVector.js").SpaceVectorIdentifiers;
|
|
4483
|
+
nodeIdsPlaneEquation: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
4484
|
+
typeDefinitionData: string;
|
|
4485
|
+
texName: string;
|
|
4486
|
+
};
|
|
4487
|
+
spacePointIdsA: import("./math/geometry/spacePoint.js").SpacePointIdentifiers;
|
|
4488
|
+
spacePointIdsProposed: import("./math/geometry/spacePoint.js").SpacePointIdentifiers[];
|
|
4489
|
+
}, {
|
|
4490
|
+
typeDataForPlane: string;
|
|
4491
|
+
}> | Exercise<{
|
|
4418
4492
|
spacePointIds: import("./math/geometry/spacePoint.js").SpacePointIdentifiers;
|
|
4419
4493
|
spaceVectorIds: import("./math/geometry/spaceVector.js").SpaceVectorIdentifiers;
|
|
4420
4494
|
randInstr: number;
|
|
@@ -4976,6 +5050,15 @@ declare const mathExercises: (Exercise<{
|
|
|
4976
5050
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4977
5051
|
cloudPointsIdentifiers: import("./math/geometry/CloudPoints.js").CloudPointsIdentifiers;
|
|
4978
5052
|
evolutionType: string;
|
|
5053
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
5054
|
+
pointIds: import("./math/geometry/point.js").PointIdentifiers[];
|
|
5055
|
+
strGroupBy: string;
|
|
5056
|
+
isTransposed: boolean;
|
|
5057
|
+
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
5058
|
+
pointIds: import("./math/geometry/point.js").PointIdentifiers[];
|
|
5059
|
+
strGroupBy: string;
|
|
5060
|
+
isTransposed: boolean;
|
|
5061
|
+
nodeIdsDataClasses: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers[];
|
|
4979
5062
|
}, Record<string, string | boolean | string[]>> | Exercise<{
|
|
4980
5063
|
pointIds: import("./math/geometry/point.js").PointIdentifiers[];
|
|
4981
5064
|
strGroupBy: string;
|
|
@@ -5532,6 +5615,14 @@ declare const mathExercises: (Exercise<{
|
|
|
5532
5615
|
}, {
|
|
5533
5616
|
typeSignBoundLow: string;
|
|
5534
5617
|
typeSignBoundHigh: string;
|
|
5618
|
+
}> | Exercise<{
|
|
5619
|
+
nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
5620
|
+
nodeIdsG: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
5621
|
+
nodeIdsBounds: [import("./tree/nodes/nodeConstructor.js").NodeIdentifiers, import("./tree/nodes/nodeConstructor.js").NodeIdentifiers];
|
|
5622
|
+
}, {
|
|
5623
|
+
typeCrossingCurves: string;
|
|
5624
|
+
typeSignBoundLow: string;
|
|
5625
|
+
typeSignBoundHigh: string;
|
|
5535
5626
|
}> | Exercise<{
|
|
5536
5627
|
nodeIdsF: import("./tree/nodes/nodeConstructor.js").NodeIdentifiers;
|
|
5537
5628
|
nodeIdsBounds: [import("./tree/nodes/nodeConstructor.js").NodeIdentifiers, import("./tree/nodes/nodeConstructor.js").NodeIdentifiers];
|
package/lib/index.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAE3D,OAAO,4BAA4B,CAAC;AACpC,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,QAAA,MAAM,aAAa
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAE3D,OAAO,4BAA4B,CAAC;AACpC,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,QAAA,MAAM,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAA+B,CAAC;AACnD,QAAA,MAAM,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kDAA6B,CAAC;AAE/C,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"point.d.ts","sourceRoot":"","sources":["../../../src/math/geometry/point.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,aAAa,EACb,eAAe,EAChB,MAAM,mCAAmC,CAAC;AAG3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sDAAsD,CAAC;AAC1F,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAM7C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAQvC,MAAM,MAAM,gBAAgB,GAAG;IAC7B,EAAE,EAAE,OAAO,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,eAAe,CAAC;IACnB,CAAC,EAAE,eAAe,CAAC;CACpB,CAAC;AACF,8BAAsB,gBAAgB;IACpC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE;IAGrC,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM;IAKhC,MAAM,CAAC,MAAM,CAAC,IAAI,SAAM;IAGxB,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,SAAM,EAAE,GAAG,SAAK,GAAG,KAAK;IAMvD,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,gBAAgB;IAOpD,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,SAAM;IAO9C,MAAM,CAAC,SAAS,CACd,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,MAAM,EACZ,EACE,OAAa,EACb,WAAW,GACZ,GAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAO;IAQpD,MAAM,CAAC,eAAe,CACpB,KAAK,EAAE,MAAM,EACb,EACE,KAAK,EACL,WAAW,EACX,mBAAmB,GACpB,EAAE;QACD,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACjB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,mBAAmB,CAAC,EAAE,MAAM,CAAC;KAC9B;IA+BH,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM;IAejC,MAAM,CAAC,uBAAuB,CAC5B,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,KAAK,EAClB,MAAM,EAAE,aAAa,GAAG,MAAM,EAC9B,KAAK,EAAE,aAAa,GAAG,MAAM,EAC7B,OAAO,GAAE;QACP,gBAAgB,EAAE,OAAO,CAAC;QAC1B,gBAAgB,EAAE,OAAO,CAAC;QAC1B,UAAU,EAAE,OAAO,CAAC;QACpB,OAAO,CAAC,EAAE,MAAM,CAAC;KAMlB;CAwBJ;AAED,qBAAa,KAAK;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;gBAEf,IAAI,EAAE,MAAM,EACZ,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM;IAO3B,KAAK,IAAI,MAAM;IAGf,aAAa,IAAI,gBAAgB;IAQjC,eAAe,IAAI,MAAM;IAGzB,QAAQ,IAAI,MAAM;IAIlB,UAAU,IAAI,MAAM;IAIpB,UAAU,IAAI,MAAM;IAIpB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,SAAM,GAAG,KAAK;IAOzC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,SAAM,GAAG,KAAK;IAQrC,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM;IAK5B,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,aAAa;IAMvC,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO;IAGzB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK;IAK5B,YAAY;IAGZ,YAAY,CAAC,EACX,OAAc,EACd,gBAAwB,EACxB,SAAgB,EAChB,KAAK,EACL,IAAI,EACJ,KAAK,EACL,KAAK,EACL,SAAgB,GACjB,GAAE,kBAAuB;
|
|
1
|
+
{"version":3,"file":"point.d.ts","sourceRoot":"","sources":["../../../src/math/geometry/point.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,aAAa,EACb,eAAe,EAChB,MAAM,mCAAmC,CAAC;AAG3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sDAAsD,CAAC;AAC1F,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAM7C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAQvC,MAAM,MAAM,gBAAgB,GAAG;IAC7B,EAAE,EAAE,OAAO,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,eAAe,CAAC;IACnB,CAAC,EAAE,eAAe,CAAC;CACpB,CAAC;AACF,8BAAsB,gBAAgB;IACpC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE;IAGrC,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM;IAKhC,MAAM,CAAC,MAAM,CAAC,IAAI,SAAM;IAGxB,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,SAAM,EAAE,GAAG,SAAK,GAAG,KAAK;IAMvD,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,gBAAgB;IAOpD,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,SAAM;IAO9C,MAAM,CAAC,SAAS,CACd,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,MAAM,EACZ,EACE,OAAa,EACb,WAAW,GACZ,GAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAO;IAQpD,MAAM,CAAC,eAAe,CACpB,KAAK,EAAE,MAAM,EACb,EACE,KAAK,EACL,WAAW,EACX,mBAAmB,GACpB,EAAE;QACD,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QACjB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,mBAAmB,CAAC,EAAE,MAAM,CAAC;KAC9B;IA+BH,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM;IAejC,MAAM,CAAC,uBAAuB,CAC5B,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,KAAK,EAClB,MAAM,EAAE,aAAa,GAAG,MAAM,EAC9B,KAAK,EAAE,aAAa,GAAG,MAAM,EAC7B,OAAO,GAAE;QACP,gBAAgB,EAAE,OAAO,CAAC;QAC1B,gBAAgB,EAAE,OAAO,CAAC;QAC1B,UAAU,EAAE,OAAO,CAAC;QACpB,OAAO,CAAC,EAAE,MAAM,CAAC;KAMlB;CAwBJ;AAED,qBAAa,KAAK;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;gBAEf,IAAI,EAAE,MAAM,EACZ,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM;IAO3B,KAAK,IAAI,MAAM;IAGf,aAAa,IAAI,gBAAgB;IAQjC,eAAe,IAAI,MAAM;IAGzB,QAAQ,IAAI,MAAM;IAIlB,UAAU,IAAI,MAAM;IAIpB,UAAU,IAAI,MAAM;IAIpB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,SAAM,GAAG,KAAK;IAOzC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,SAAM,GAAG,KAAK;IAQrC,UAAU,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM;IAK5B,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,aAAa;IAMvC,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,OAAO;IAGzB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK;IAK5B,YAAY;IAGZ,YAAY,CAAC,EACX,OAAc,EACd,gBAAwB,EACxB,SAAgB,EAChB,KAAK,EACL,IAAI,EACJ,KAAK,EACL,KAAK,EACL,SAAgB,GACjB,GAAE,kBAAuB;IA2B1B,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;IAiBpC,aAAa,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,MAAM;IAkBhE,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,SAAkB;IAIrD,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,SAAkB;IAI1C,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,SAAkB;IAKhD,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAG/B,SAAS,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,EAAE,CAAC,EAAE,aAAa,GAAG,MAAM;CAO/D"}
|
|
@@ -160,7 +160,7 @@ export class Point {
|
|
|
160
160
|
}
|
|
161
161
|
toGGBCommand({ isFixed = true, isSelectionnable = false, showLabel = true, style, size, color, label, isVisible = true, } = {}) {
|
|
162
162
|
const commands = [
|
|
163
|
-
`${this.name} = (${this.x.toMathString()}, ${this.y.toMathString()})`,
|
|
163
|
+
`${this.name} = Point({${this.x.toMathString()}, ${this.y.toMathString()}})`,
|
|
164
164
|
`SetFixed(${this.name},${isFixed ? "true" : "false"},${isSelectionnable ? "true" : "false"})`,
|
|
165
165
|
`ShowLabel(${this.name},${showLabel ? "true" : "false"})`,
|
|
166
166
|
];
|
|
@@ -39,5 +39,7 @@ export declare class SpaceVector {
|
|
|
39
39
|
getNorm(): AlgebraicNode;
|
|
40
40
|
getEndPoint(startPoint: SpacePoint, name?: string): SpacePoint;
|
|
41
41
|
equals(v: SpaceVector): boolean;
|
|
42
|
+
static createRandomOrthogonalVector(vecSrc: SpaceVector): SpaceVector;
|
|
43
|
+
getRandomOrthogonalVectorNonZero(): SpaceVector;
|
|
42
44
|
}
|
|
43
45
|
//# sourceMappingURL=spaceVector.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"spaceVector.d.ts","sourceRoot":"","sources":["../../../src/math/geometry/spaceVector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;
|
|
1
|
+
{"version":3,"file":"spaceVector.d.ts","sourceRoot":"","sources":["../../../src/math/geometry/spaceVector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAGlE,OAAO,EAEL,eAAe,EAChB,MAAM,qCAAqC,CAAC;AAe7C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,MAAM,MAAM,sBAAsB,GAAG;IACnC,EAAE,EAAE,aAAa,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,eAAe,CAAC;IACnB,CAAC,EAAE,eAAe,CAAC;IACnB,CAAC,EAAE,eAAe,CAAC;CACpB,CAAC;AAEF,8BAAsB,sBAAsB;IAC1C,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,sBAAsB;IAS1D,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,WAAW;IAQnE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,UAAQ,GAAG,WAAW;IAe3D,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,SAAS,UAAQ,GAAG,WAAW,EAAE;IAc1E,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE,MAAM;CAWhD;AAED,qBAAa,WAAW;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;gBAEf,IAAI,EAAE,MAAM,EACZ,CAAC,EAAE,aAAa,EAChB,CAAC,EAAE,aAAa,EAChB,CAAC,EAAE,aAAa;IASlB,aAAa,IAAI,sBAAsB;IAUvC,SAAS;IAGT,kBAAkB;IAGlB,KAAK,IAAI,MAAM;IAIf,WAAW,IAAI,MAAM;IAGrB,iBAAiB,IAAI,MAAM;IAK3B,eAAe,IAAI,MAAM;IAMzB,eAAe,CAAC,CAAC,EAAE,WAAW,GAAG,WAAW;IAiB5C,UAAU,CAAC,CAAC,EAAE,WAAW,GAAG,OAAO;IAMnC,UAAU,IAAI,OAAO;IAGrB,WAAW,IAAI,aAAa;IAI5B,KAAK,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,MAAM;IAQrC,aAAa,CAAC,EAAE,EAAE,WAAW,GAAG,aAAa;IAQ7C,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,WAAW;IAShC,OAAO,IAAI,aAAa;IAYxB,WAAW,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,MAAM;IAQjD,MAAM,CAAC,CAAC,EAAE,WAAW;IAIrB,MAAM,CAAC,4BAA4B,CAAC,MAAM,EAAE,WAAW;IA+BvD,gCAAgC;CAoBjC"}
|
|
@@ -1,3 +1,4 @@
|
|
|
1
|
+
import { opposite } from "../../tree/nodes/functions/oppositeNode.js";
|
|
1
2
|
import { SqrtNode } from "../../tree/nodes/functions/sqrtNode.js";
|
|
2
3
|
import { NodeConstructor, } from "../../tree/nodes/nodeConstructor.js";
|
|
3
4
|
import { NumberNode } from "../../tree/nodes/numbers/numberNode.js";
|
|
@@ -5,6 +6,10 @@ import { add, AddNode } from "../../tree/nodes/operators/addNode.js";
|
|
|
5
6
|
import { multiply, MultiplyNode, } from "../../tree/nodes/operators/multiplyNode.js";
|
|
6
7
|
import { SquareNode } from "../../tree/nodes/operators/powerNode.js";
|
|
7
8
|
import { SubstractNode } from "../../tree/nodes/operators/substractNode.js";
|
|
9
|
+
import { NodeComparator } from "../../tree/utilities/nodeComparator.js";
|
|
10
|
+
import { coinFlip } from "../../utils/alea/coinFlip.js";
|
|
11
|
+
import { random } from "../../utils/alea/random.js";
|
|
12
|
+
import { shuffle } from "../../utils/alea/shuffle.js";
|
|
8
13
|
import { zip } from "../../utils/arrays/arrayZip.js";
|
|
9
14
|
import { randint } from "../utils/random/randint.js";
|
|
10
15
|
import { SpacePoint } from "./spacePoint.js";
|
|
@@ -125,4 +130,39 @@ export class SpaceVector {
|
|
|
125
130
|
equals(v) {
|
|
126
131
|
return this.x.equals(v.x) && this.y.equals(v.y) && this.z.equals(v.z);
|
|
127
132
|
}
|
|
133
|
+
static createRandomOrthogonalVector(vecSrc) {
|
|
134
|
+
const isVecSrcZero = [vecSrc.x, vecSrc.y, vecSrc.z].every((node) => NodeComparator.isEqualViaSub(node, (0).toTree()));
|
|
135
|
+
if (isVecSrcZero) {
|
|
136
|
+
throw new Error("vecSrc is zero");
|
|
137
|
+
}
|
|
138
|
+
const [nodeX, nodeY, nodeZ] = [vecSrc.x, vecSrc.y, vecSrc.z];
|
|
139
|
+
const nodeZero = (0).toTree();
|
|
140
|
+
const vec1 = new SpaceVector("v1", opposite(nodeY), nodeX, nodeZero);
|
|
141
|
+
const vec2 = new SpaceVector("v2", nodeZero, opposite(nodeZ), nodeY);
|
|
142
|
+
const vec3 = new SpaceVector("v3", opposite(nodeZ), nodeZero, nodeX);
|
|
143
|
+
const arrIsCanBeZero = shuffle(random([
|
|
144
|
+
[coinFlip(), false, false],
|
|
145
|
+
[coinFlip(), coinFlip(), false],
|
|
146
|
+
]));
|
|
147
|
+
const [factor1, factor2, factor3] = arrIsCanBeZero.map((isCanBeZero) => randint(-3, 4, isCanBeZero ? [] : [0]).toTree());
|
|
148
|
+
return vec1
|
|
149
|
+
.times(factor1)
|
|
150
|
+
.add(vec2.times(factor2))
|
|
151
|
+
.add(vec3.times(factor3));
|
|
152
|
+
}
|
|
153
|
+
getRandomOrthogonalVectorNonZero() {
|
|
154
|
+
function isVectorZero(vec) {
|
|
155
|
+
return [vec.x, vec.y, vec.z].every((node) => NodeComparator.isEqualViaSub(node, (0).toTree()));
|
|
156
|
+
}
|
|
157
|
+
let vecOrth;
|
|
158
|
+
let counter = -1;
|
|
159
|
+
do {
|
|
160
|
+
vecOrth = SpaceVector.createRandomOrthogonalVector(this);
|
|
161
|
+
counter++;
|
|
162
|
+
} while (isVectorZero(vecOrth) && counter < 100);
|
|
163
|
+
if (counter === 100) {
|
|
164
|
+
throw new Error("while looped too much");
|
|
165
|
+
}
|
|
166
|
+
return vecOrth;
|
|
167
|
+
}
|
|
128
168
|
}
|
|
@@ -4,7 +4,7 @@ export declare const functionDecompositions: (node: AlgebraicNode, variableNode?
|
|
|
4
4
|
nodeU: AlgebraicNode;
|
|
5
5
|
nodeV: AlgebraicNode;
|
|
6
6
|
}[];
|
|
7
|
-
export declare const nodeBySubstitutingX: (node: AlgebraicNode, strVar: string) => AlgebraicNode;
|
|
8
|
-
export declare function composeNodes(nodeU: AlgebraicNode, nodeV: AlgebraicNode): AlgebraicNode;
|
|
7
|
+
export declare const nodeBySubstitutingX: (node: AlgebraicNode, strVar: string) => AlgebraicNode | import("../../../tree/nodes/student/iDontKnowNode.js").IDontKnowNode;
|
|
8
|
+
export declare function composeNodes(nodeU: AlgebraicNode, nodeV: AlgebraicNode): AlgebraicNode | import("../../../tree/nodes/student/iDontKnowNode.js").IDontKnowNode;
|
|
9
9
|
export declare function isContainingFacetiousFrac(node: AlgebraicNode): boolean;
|
|
10
10
|
//# sourceMappingURL=functionDecomposition.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"functionDecomposition.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/functions/functionDecomposition.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAYlE,OAAO,EAEL,YAAY,EACb,MAAM,4CAA4C,CAAC;AAcpD,eAAO,MAAM,sBAAsB,GACjC,MAAM,aAAa,EACnB,eAAc,YAA2C;WAElC,aAAa;WAAS,aAAa;GAyO3D,CAAC;AAqEF,eAAO,MAAM,mBAAmB,GAAI,MAAM,aAAa,EAAE,QAAQ,MAAM,
|
|
1
|
+
{"version":3,"file":"functionDecomposition.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/functions/functionDecomposition.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAYlE,OAAO,EAEL,YAAY,EACb,MAAM,4CAA4C,CAAC;AAcpD,eAAO,MAAM,sBAAsB,GACjC,MAAM,aAAa,EACnB,eAAc,YAA2C;WAElC,aAAa;WAAS,aAAa;GAyO3D,CAAC;AAqEF,eAAO,MAAM,mBAAmB,GAAI,MAAM,aAAa,EAAE,QAAQ,MAAM,yFAItE,CAAC;AAEF,wBAAgB,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,wFAMtE;AAMD,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAmBtE"}
|
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
import { Point } from "../../../math/geometry/point.js";
|
|
2
|
-
import { AlgebraicNode } from "../../../tree/nodes/algebraicNode.js";
|
|
2
|
+
import { AlgebraicNode, SimplifyOptions } from "../../../tree/nodes/algebraicNode.js";
|
|
3
3
|
import { VariableNode } from "../../../tree/nodes/variables/variableNode.js";
|
|
4
4
|
/**
|
|
5
5
|
*
|
|
@@ -26,7 +26,7 @@ export declare function createNodeFPolynomialFromCoeffs(arrNodeCoeff: AlgebraicN
|
|
|
26
26
|
* @param arrPoint
|
|
27
27
|
* @returns coeffN x^N + ... + coeff2 x^2 + coeff1 x^1 + coeff0
|
|
28
28
|
*/
|
|
29
|
-
export declare function createNodeFTrinomFromPoints(nodeA: AlgebraicNode, arrPoint: Point[]): AlgebraicNode | import("../../../tree/nodes/operators/multiplyNode.js").MultiplyNode;
|
|
29
|
+
export declare function createNodeFTrinomFromPoints(nodeA: AlgebraicNode, arrPoint: Point[], isShouldSimplify?: boolean, simplifyOptionsPass1?: SimplifyOptions, simplifyOptionsPass2?: SimplifyOptions): AlgebraicNode | import("../../../tree/nodes/operators/multiplyNode.js").MultiplyNode;
|
|
30
30
|
/**
|
|
31
31
|
*
|
|
32
32
|
* @param arrNodeCoeff
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"polynomialUtils.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/polynomial/polynomialUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AACrD,OAAO,EACL,aAAa,
|
|
1
|
+
{"version":3,"file":"polynomialUtils.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/polynomial/polynomialUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AACrD,OAAO,EACL,aAAa,EACb,eAAe,EAChB,MAAM,mCAAmC,CAAC;AAQ3C,OAAO,EAAE,YAAY,EAAE,MAAM,4CAA4C,CAAC;AAO1E;;;;;GAKG;AACH,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,aAAa,EACpB,WAAW,EAAE,aAAa,EAAE,iBAO7B;AAED;;;;GAIG;AACH,wBAAgB,+BAA+B,CAAC,cAAc,EAAE,aAAa,mBA4B5E;AAED;;;;GAIG;AACH,wBAAgB,+BAA+B,CAC7C,YAAY,EAAE,aAAa,EAAE,EAC7B,wBAAwB,GAAE,OAAc,qFA8CzC;AAED;;;;;GAKG;AACH,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,aAAa,EACpB,QAAQ,EAAE,KAAK,EAAE,EACjB,gBAAgB,GAAE,OAAe,EACjC,oBAAoB,GAAE,eAAoB,EAC1C,oBAAoB,GAAE,eAAoB,qFAmC3C;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,YAAY,EAAE,aAAa,EAAE,uEAGpE;AAaD,eAAO,MAAM,+BAA+B,GAC1C,gBAAgB,aAAa,EAC7B,OAAM;IAAE,OAAO,EAAE,YAAY,CAAC;IAAC,cAAc,EAAE,OAAO,CAAA;CAGrD,WAoGF,CAAC;AAEF,eAAO,MAAM,yCAAyC,GACpD,gBAAgB,aAAa;;;CA+C9B,CAAC;AAEF,wBAAgB,8BAA8B,CAC5C,cAAc,EAAE,aAAa,EAC7B,KAAK,EAAE,aAAa,iBAQrB"}
|
|
@@ -106,7 +106,7 @@ export function createNodeFPolynomialFromCoeffs(arrNodeCoeff, isFilterOutTopZero
|
|
|
106
106
|
* @param arrPoint
|
|
107
107
|
* @returns coeffN x^N + ... + coeff2 x^2 + coeff1 x^1 + coeff0
|
|
108
108
|
*/
|
|
109
|
-
export function createNodeFTrinomFromPoints(nodeA, arrPoint) {
|
|
109
|
+
export function createNodeFTrinomFromPoints(nodeA, arrPoint, isShouldSimplify = false, simplifyOptionsPass1 = {}, simplifyOptionsPass2 = {}) {
|
|
110
110
|
const [[nodeX1, nodeY1], [nodeX2, nodeY2]] = arrPoint.map((point) => [
|
|
111
111
|
point.x,
|
|
112
112
|
point.y,
|
|
@@ -118,7 +118,10 @@ export function createNodeFTrinomFromPoints(nodeA, arrPoint) {
|
|
|
118
118
|
//{c=y1-(ax1^2+bx1)
|
|
119
119
|
const nodeB = frac(substract(substract(nodeY1, nodeY2), multiply(nodeA, substract(square(nodeX1), square(nodeX2)))), substract(nodeX1, nodeX2));
|
|
120
120
|
const nodeC = substract(nodeY1, add(multiply(nodeA, square(nodeX1)), multiply(nodeB, nodeX1)));
|
|
121
|
-
const
|
|
121
|
+
const [nodeARefined, nodeBRefined, nodeCRefined] = isShouldSimplify
|
|
122
|
+
? [nodeA, nodeB, nodeC].map((node) => node.simplify(simplifyOptionsPass1).simplify(simplifyOptionsPass2))
|
|
123
|
+
: [nodeA, nodeB, nodeC];
|
|
124
|
+
const nodePolynomial = createNodeFPolynomialFromCoeffs([nodeCRefined, nodeBRefined, nodeARefined], true);
|
|
122
125
|
return nodePolynomial;
|
|
123
126
|
}
|
|
124
127
|
/**
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"exoTest.d.ts","sourceRoot":"","sources":["../../src/tests/exoTest.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAuB,MAAM,6BAA6B,CAAC;AAI5E,eAAO,MAAM,OAAO,GAAI,KAAK,QAAQ,CAAC,MAAM,CAAC;;;;
|
|
1
|
+
{"version":3,"file":"exoTest.d.ts","sourceRoot":"","sources":["../../src/tests/exoTest.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAuB,MAAM,6BAA6B,CAAC;AAI5E,eAAO,MAAM,OAAO,GAAI,KAAK,QAAQ,CAAC,MAAM,CAAC;;;;CA4H5C,CAAC"}
|
package/lib/tests/exoTest.js
CHANGED
|
@@ -7,7 +7,7 @@ export const exoTest = (exo) => {
|
|
|
7
7
|
//hint
|
|
8
8
|
//answer
|
|
9
9
|
//propositions
|
|
10
|
-
console.log(exo.id);
|
|
10
|
+
console.log(`begin test ${exo.id}`);
|
|
11
11
|
let qcmTime = -1;
|
|
12
12
|
let veaTime = -1;
|
|
13
13
|
let generatorTime = -1;
|
|
@@ -32,16 +32,11 @@ export const exoTest = (exo) => {
|
|
|
32
32
|
const questions = exo.generator(30);
|
|
33
33
|
const after = Date.now();
|
|
34
34
|
generatorTime = after - before;
|
|
35
|
-
if (exo.answerType
|
|
36
|
-
exo.
|
|
37
|
-
exo.
|
|
38
|
-
|
|
39
|
-
exo.
|
|
40
|
-
exo.answerType !== "treeDiagram" &&
|
|
41
|
-
exo.answerType !== "signVarTable") {
|
|
42
|
-
if (!exo.getPropositions)
|
|
43
|
-
throw new Error(`exo ${exo.id} has no getPropositions`);
|
|
44
|
-
}
|
|
35
|
+
if ((exo.answerType === "QCU" || exo.answerType === "QCM") &&
|
|
36
|
+
!exo.getPropositions)
|
|
37
|
+
throw new Error(`exo ${exo.id} has no getPropositions`);
|
|
38
|
+
if (exo.answerType === "reorder" && !exo.getOrderedItems)
|
|
39
|
+
throw new Error(`exo ${exo.id} has no getOrderedItems`);
|
|
45
40
|
if (exo.answerType !== "QCM" &&
|
|
46
41
|
exo.answerType !== "QCU" &&
|
|
47
42
|
exo.answerType !== "GGB" &&
|
|
@@ -49,7 +44,8 @@ export const exoTest = (exo) => {
|
|
|
49
44
|
exo.answerType !== "varTable" &&
|
|
50
45
|
exo.answerType !== "signTable" &&
|
|
51
46
|
exo.answerType !== "treeDiagram" &&
|
|
52
|
-
exo.answerType !== "signVarTable"
|
|
47
|
+
exo.answerType !== "signVarTable" &&
|
|
48
|
+
exo.answerType !== "reorder") {
|
|
53
49
|
if (!exo.isAnswerValid)
|
|
54
50
|
throw new Error(`exo ${exo.id} has no isAnswerValid`);
|
|
55
51
|
}
|
|
@@ -1 +1 @@
|
|
|
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;AA0BjE,eAAO,MAAM,YAAY,GACvB,KAAK,QAAQ,CAAC,MAAM,CAAC,EACrB,UAAU,QAAQ,CAAC,MAAM,CAAC;;;
|
|
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;AA0BjE,eAAO,MAAM,YAAY,GACvB,KAAK,QAAQ,CAAC,MAAM,CAAC,EACrB,UAAU,QAAQ,CAAC,MAAM,CAAC;;;CA6V3B,CAAC"}
|
|
@@ -106,7 +106,9 @@ export const questionTest = (exo, question) => {
|
|
|
106
106
|
if (!question.initTreeTable.some((stage) => stage.some((block) => block.some((branch) => branch.some((cell) => cell === "")))))
|
|
107
107
|
throw new Error(`exo ${exo.id} is answertype treeDiagram but no input in treeTable`);
|
|
108
108
|
}
|
|
109
|
-
else if (exo.answerType !== "QCU" &&
|
|
109
|
+
else if (exo.answerType !== "QCU" &&
|
|
110
|
+
exo.answerType !== "QCM" &&
|
|
111
|
+
exo.answerType !== "reorder") {
|
|
110
112
|
if (!question.answer)
|
|
111
113
|
throw new Error(`exo ${exo.id} has no answer`);
|
|
112
114
|
}
|
|
@@ -198,13 +200,17 @@ export const questionTest = (exo, question) => {
|
|
|
198
200
|
exo.answerType !== "signTable" &&
|
|
199
201
|
exo.answerType !== "varTable" &&
|
|
200
202
|
exo.answerType !== "signVarTable" &&
|
|
201
|
-
exo.answerType !== "treeDiagram"
|
|
203
|
+
exo.answerType !== "treeDiagram" &&
|
|
204
|
+
exo.answerType !== "reorder") {
|
|
202
205
|
if (!question.keys)
|
|
203
206
|
throw new Error(`exo ${exo.id} has no keys`);
|
|
204
207
|
const answer = question.answer;
|
|
205
208
|
const before = Date.now();
|
|
209
|
+
if (!exo.isAnswerValid)
|
|
210
|
+
throw new Error(`exo ${exo.id} has no isAnswerValid`);
|
|
206
211
|
console.log("will test vea : ", exo.id);
|
|
207
|
-
if (!exo.isAnswerValid(answer, { answer, ...question.identifiers }, question.options)
|
|
212
|
+
if (!exo.isAnswerValid(answer, { answer, ...question.identifiers }, question.options) ||
|
|
213
|
+
exo.isAnswerValid("N.S.P", { answer, ...question.identifiers }, question.options)) {
|
|
208
214
|
throw new Error(`exo ${exo.id} has invalid VEA, ids ${jsonIds}, answer ${question.answer}`);
|
|
209
215
|
}
|
|
210
216
|
const after = Date.now();
|
|
@@ -216,7 +222,8 @@ export const questionTest = (exo, question) => {
|
|
|
216
222
|
exo.answerType !== "varTable" &&
|
|
217
223
|
exo.answerType !== "signTable" &&
|
|
218
224
|
exo.answerType !== "signVarTable" &&
|
|
219
|
-
exo.answerType !== "treeDiagram"
|
|
225
|
+
exo.answerType !== "treeDiagram" &&
|
|
226
|
+
exo.answerType !== "reorder") {
|
|
220
227
|
if (exo.answerType === "QCM" && !exo.isQCM)
|
|
221
228
|
throw new Error("exo " + exo.id + " has answerType QCM but not isQCM");
|
|
222
229
|
const before = Date.now();
|
|
@@ -235,8 +242,9 @@ export const questionTest = (exo, question) => {
|
|
|
235
242
|
throw new Error(`exo ${exo.id} has invalid props, ${props.map((p) => p.statement)}`);
|
|
236
243
|
}
|
|
237
244
|
else {
|
|
238
|
-
if (rightAnswers !== 1)
|
|
239
|
-
throw new Error(`exo ${exo.id} has invalid props`);
|
|
245
|
+
if (rightAnswers !== 1) {
|
|
246
|
+
throw new Error(`exo ${exo.id} has invalid props, rightAnswers: ${rightAnswers}`);
|
|
247
|
+
}
|
|
240
248
|
}
|
|
241
249
|
props.forEach((prop) => {
|
|
242
250
|
if (prop.statement.includes("undefined"))
|
|
@@ -1,9 +1,9 @@
|
|
|
1
1
|
import "../prototypesEnhancement.js";
|
|
2
2
|
import { exoTest } from "./exoTest.js";
|
|
3
|
-
import {
|
|
3
|
+
import { proofByInductionCheckInitialization, } from "../exercises/math/index.js";
|
|
4
4
|
try {
|
|
5
5
|
for (let i = 0; i < 1000; i++)
|
|
6
|
-
exoTest(
|
|
6
|
+
exoTest(proofByInductionCheckInitialization);
|
|
7
7
|
}
|
|
8
8
|
catch (err) {
|
|
9
9
|
throw err;
|
package/lib/tree/nodes/node.d.ts
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/node.ts"],"names":[],"mappings":"AAGA,oBAAY,QAAQ;IAClB,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,UAAU,IAAA;IACV,KAAK,IAAA;IACL,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,OAAO,IAAA;IACP,MAAM,KAAA;IACN,GAAG,KAAA;IACH,MAAM,KAAA;IACN,KAAK,KAAA;IACL,OAAO,KAAA;IACP,WAAW,KAAA;
|
|
1
|
+
{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/node.ts"],"names":[],"mappings":"AAGA,oBAAY,QAAQ;IAClB,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,UAAU,IAAA;IACV,KAAK,IAAA;IACL,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,OAAO,IAAA;IACP,MAAM,KAAA;IACN,GAAG,KAAA;IACH,MAAM,KAAA;IACN,KAAK,KAAA;IACL,OAAO,KAAA;IACP,WAAW,KAAA;IACX,SAAS,KAAA;CACV;AACD,MAAM,MAAM,WAAW,GAAG;IACxB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,iBAAiB,CAAC,EAAE,OAAO,CAAC;CAC7B,CAAC;AAEF,MAAM,MAAM,YAAY,GAAG;IACzB,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,4BAA4B,CAAC,EAAE,OAAO,CAAC;CACxC,CAAC;AAGF,oBAAY,OAAO;IACjB,GAAG,IAAA,CAAE,GAAG;IACR,SAAS,IAAA;IACT,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,MAAM,IAAA;IACN,KAAK,IAAA,CAAE,GAAG;IACV,KAAK,IAAA;IACL,MAAM,IAAA;IACN,OAAO,IAAA;IACP,QAAQ,IAAA;IACR,QAAQ,KAAA,CAAE,IAAI;IACd,OAAO,KAAA;IACP,WAAW,KAAA;IACX,QAAQ,KAAA;IACR,KAAK,KAAA;IACL,OAAO,KAAA,CAAE,IAAI;IACb,KAAK,KAAA;IACL,UAAU,KAAA;IACV,gBAAgB,KAAA;IAChB,GAAG,KAAA;IACH,MAAM,KAAA,CAAE,IAAI;IACZ,MAAM,KAAA;IACN,MAAM,KAAA;IACN,GAAG,KAAA;IACH,GAAG,KAAA;IACH,GAAG,KAAA,CAAE,IAAI;IACT,GAAG,KAAA;IACH,KAAK,KAAA;IACL,GAAG,KAAA;IACH,IAAI,KAAA;IACJ,QAAQ,KAAA,CAAE,IAAI;IACd,QAAQ,KAAA;IACR,MAAM,KAAA;IACN,MAAM,KAAA;IACN,KAAK,KAAA;IACL,MAAM,KAAA,CAAE,IAAI;IACZ,UAAU,KAAA;IACV,kBAAkB,KAAA;IAClB,mBAAmB,KAAA;IACnB,MAAM,KAAA;IACN,KAAK,KAAA,CAAE,IAAI;IACX,QAAQ,KAAA;IACR,SAAS,KAAA;CACV;AAED,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,YAAY,EAAE,MAAM,MAAM,CAAC;IAC3B,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,IAAI,EAAE,CAAC;IAClD,cAAc,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,MAAM,EAAE,CAAC;IACjD,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,YAAY,KAAK,MAAM,CAAC;IAEvC,QAAQ,EAAE,MAAM,IAAI,CAAC;IACrB,aAAa,EAAE,MAAM;QAAE,EAAE,EAAE,OAAO,CAAA;KAAE,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC5D"}
|
package/lib/tree/nodes/node.js
CHANGED
|
@@ -18,6 +18,7 @@ export var NodeType;
|
|
|
18
18
|
NodeType[NodeType["monom"] = 13] = "monom";
|
|
19
19
|
NodeType[NodeType["complex"] = 14] = "complex";
|
|
20
20
|
NodeType[NodeType["notequality"] = 15] = "notequality";
|
|
21
|
+
NodeType[NodeType["iDontKnow"] = 16] = "iDontKnow";
|
|
21
22
|
})(NodeType || (NodeType = {}));
|
|
22
23
|
//toujours ajouter les ids en fin de liste (youpi c'est vmt hyper bien codé)
|
|
23
24
|
export var NodeIds;
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
import { Node, NodeIds, NodeType } from "../node.js";
|
|
2
|
+
import { AlgebraicNode, SimplifyOptions } from "../algebraicNode.js";
|
|
3
|
+
export declare function isIDontKnowNode(a: Node): a is IDontKnowNode;
|
|
4
|
+
export declare class IDontKnowNode implements AlgebraicNode {
|
|
5
|
+
tex: string;
|
|
6
|
+
type: NodeType;
|
|
7
|
+
isNumeric: boolean;
|
|
8
|
+
constructor(tex: string);
|
|
9
|
+
static keyword(): string;
|
|
10
|
+
toMathString(): string;
|
|
11
|
+
toTex(): string;
|
|
12
|
+
toAllValidTexs(): string[];
|
|
13
|
+
toIdentifiers(): {
|
|
14
|
+
id: NodeIds;
|
|
15
|
+
tex: string;
|
|
16
|
+
};
|
|
17
|
+
toEquivalentNodes(): this[];
|
|
18
|
+
evaluate(): number;
|
|
19
|
+
simplify(_opts?: SimplifyOptions): this;
|
|
20
|
+
toSimplificationTex(opts?: SimplifyOptions): string;
|
|
21
|
+
equals(node: AlgebraicNode): boolean;
|
|
22
|
+
toDetailedEvaluation(vars: Record<string, AlgebraicNode>): AlgebraicNode;
|
|
23
|
+
derivative(): this;
|
|
24
|
+
toSignInequationTex(): string;
|
|
25
|
+
}
|
|
26
|
+
//# sourceMappingURL=iDontKnowNode.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"iDontKnowNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/student/iDontKnowNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAErE,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,aAAa,CAE3D;AACD,qBAAa,aAAc,YAAW,aAAa;IACjD,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBACP,GAAG,EAAE,MAAM;IAMvB,MAAM,CAAC,OAAO;IAId,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAMf,cAAc;IAGd,aAAa;;;;IAMb,iBAAiB;IAGjB,QAAQ;IAGR,QAAQ,CAAC,KAAK,CAAC,EAAE,eAAe;IAGhC,mBAAmB,CAAC,IAAI,CAAC,EAAE,eAAe;IAK1C,MAAM,CAAC,IAAI,EAAE,aAAa;IAG1B,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAIxD,UAAU;IAGV,mBAAmB;CAGpB"}
|