math-exercises 2.2.82 → 2.2.84

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.
Files changed (9) hide show
  1. package/lib/exercises/math/sets/intervals/inequalityToInterval.d.ts.map +1 -1
  2. package/lib/exercises/math/sets/intervals/inequalityToInterval.js +10 -2
  3. package/lib/exercises/math/sets/intervals/intervalToInequality.d.ts.map +1 -1
  4. package/lib/exercises/math/sets/intervals/intervalToInequality.js +10 -2
  5. package/lib/exercises/math/sets/intervals/intervalsIntersection.d.ts.map +1 -1
  6. package/lib/exercises/math/sets/intervals/intervalsIntersection.js +26 -4
  7. package/lib/exercises/math/sets/intervals/intervalsUnion.d.ts.map +1 -1
  8. package/lib/exercises/math/sets/intervals/intervalsUnion.js +26 -4
  9. package/package.json +1 -1
package/lib/exercises/math/sets/intervals/inequalityToInterval.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"inequalityToInterval.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/inequalityToInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,0BAA0B,CAAC;AAQlC,OAAO,EAGL,uBAAuB,EACxB,MAAM,oCAAoC,CAAC;AAI5C,KAAK,WAAW,GAAG;IAIjB,mBAAmB,EAAE,uBAAuB,CAAC;CAC9C,CAAC;AAoFF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAetD,CAAC"}
1
+ {"version":3,"file":"inequalityToInterval.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/inequalityToInterval.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAUT,MAAM,0BAA0B,CAAC;AAQlC,OAAO,EAGL,uBAAuB,EACxB,MAAM,oCAAoC,CAAC;AAI5C,KAAK,WAAW,GAAG;IAIjB,mBAAmB,EAAE,uBAAuB,CAAC;CAC9C,CAAC;AA2FF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAetD,CAAC"}
package/lib/exercises/math/sets/intervals/inequalityToInterval.js CHANGED
@@ -8,10 +8,18 @@ const intervalNode_1 = require("../../../../tree/nodes/sets/intervalNode");
8
8
  const intervalParser_1 = require("../../../../tree/parsers/intervalParser");
9
9
  const shuffle_1 = require("../../../../utils/alea/shuffle");
10
10
  const rebuildIdentifiers = (oldIds) => {
11
- const a = oldIds.intervalMin === "-infty"
11
+ if (!!oldIds.intervalIdentifiers)
12
+ return oldIds;
13
+ const a = oldIds.intervalMin === "-infty" ||
14
+ oldIds.intervalMin === -Infinity ||
15
+ oldIds.intervalMin === null ||
16
+ oldIds.intervalMin === undefined
12
17
  ? infiniteNode_1.MinusInfinityNode
13
18
  : oldIds.intervalMin.toTree();
14
- const b = oldIds.intervalMax === "infty"
19
+ const b = oldIds.intervalMax === "infty" ||
20
+ oldIds.intervalMax === Infinity ||
21
+ oldIds.intervalMax === null ||
22
+ oldIds.intervalMax === undefined
15
23
  ? infiniteNode_1.PlusInfinityNode
16
24
  : oldIds.intervalMax.toTree();
17
25
  const closure = oldIds.intervalClosure;
package/lib/exercises/math/sets/intervals/intervalToInequality.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"intervalToInequality.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalToInequality.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,0BAA0B,CAAC;AAWlC,OAAO,EAGL,uBAAuB,EACxB,MAAM,oCAAoC,CAAC;AAK5C,KAAK,WAAW,GAAG;IAIjB,mBAAmB,EAAE,uBAAuB,CAAC;CAC9C,CAAC;AA+EF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAetD,CAAC"}
1
+ {"version":3,"file":"intervalToInequality.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalToInequality.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,0BAA0B,CAAC;AAWlC,OAAO,EAGL,uBAAuB,EACxB,MAAM,oCAAoC,CAAC;AAK5C,KAAK,WAAW,GAAG;IAIjB,mBAAmB,EAAE,uBAAuB,CAAC;CAC9C,CAAC;AAsFF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAetD,CAAC"}
package/lib/exercises/math/sets/intervals/intervalToInequality.js CHANGED
@@ -7,10 +7,18 @@ const infiniteNode_1 = require("../../../../tree/nodes/numbers/infiniteNode");
7
7
  const intervalNode_1 = require("../../../../tree/nodes/sets/intervalNode");
8
8
  const shuffle_1 = require("../../../../utils/alea/shuffle");
9
9
  const rebuildIdentifiers = (oldIds) => {
10
- const a = oldIds.intervalMin === "-infty"
10
+ if (!!oldIds.intervalIdentifiers)
11
+ return oldIds;
12
+ const a = oldIds.intervalMin === "-infty" ||
13
+ oldIds.intervalMin === -Infinity ||
14
+ oldIds.intervalMin === null ||
15
+ oldIds.intervalMin === undefined
11
16
  ? infiniteNode_1.MinusInfinityNode
12
17
  : oldIds.intervalMin.toTree();
13
- const b = oldIds.intervalMax === "infty"
18
+ const b = oldIds.intervalMax === "infty" ||
19
+ oldIds.intervalMax === Infinity ||
20
+ oldIds.intervalMax === null ||
21
+ oldIds.intervalMax === undefined
14
22
  ? infiniteNode_1.PlusInfinityNode
15
23
  : oldIds.intervalMax.toTree();
16
24
  const closure = oldIds.intervalClosure;
package/lib/exercises/math/sets/intervals/intervalsIntersection.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"intervalsIntersection.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalsIntersection.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,0BAA0B,CAAC;AAYlC,OAAO,EAGL,uBAAuB,EAExB,MAAM,oCAAoC,CAAC;AAK5C,KAAK,WAAW,GAAG;IAOjB,eAAe,EAAE,uBAAuB,CAAC;IACzC,eAAe,EAAE,uBAAuB,CAAC;CAC1C,CAAC;AA4IF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAgBvD,CAAC"}
1
+ {"version":3,"file":"intervalsIntersection.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalsIntersection.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAYT,MAAM,0BAA0B,CAAC;AAYlC,OAAO,EAGL,uBAAuB,EAExB,MAAM,oCAAoC,CAAC;AAK5C,KAAK,WAAW,GAAG;IAOjB,eAAe,EAAE,uBAAuB,CAAC;IACzC,eAAe,EAAE,uBAAuB,CAAC;CAC1C,CAAC;AAgKF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAgBvD,CAAC"}
package/lib/exercises/math/sets/intervals/intervalsIntersection.js CHANGED
@@ -10,12 +10,34 @@ const discreteSetParser_1 = require("../../../../tree/parsers/discreteSetParser"
10
10
  const intervalParser_1 = require("../../../../tree/parsers/intervalParser");
11
11
  const shuffle_1 = require("../../../../utils/alea/shuffle");
12
12
  const rebuildIdentifiers = (oldIds) => {
13
- const a1 = oldIds.int1Min === "-infty" ? infiniteNode_1.MinusInfinityNode : oldIds.int1Min.toTree();
14
- const b1 = oldIds.int1Max === "infty" ? infiniteNode_1.PlusInfinityNode : oldIds.int1Max.toTree();
13
+ if (!!oldIds.int1Identifiers)
14
+ return oldIds;
15
+ const a1 = oldIds.int1Min === "-infty" ||
16
+ oldIds.int2Min === -Infinity ||
17
+ oldIds.int1Min === null ||
18
+ oldIds.int1Min === undefined
19
+ ? infiniteNode_1.MinusInfinityNode
20
+ : oldIds.int1Min.toTree();
21
+ const b1 = oldIds.int1Max === "infty" ||
22
+ oldIds.int1Max === Infinity ||
23
+ oldIds.int1Max === null ||
24
+ oldIds.int1Max === undefined
25
+ ? infiniteNode_1.PlusInfinityNode
26
+ : oldIds.int1Max.toTree();
15
27
  const closure1 = oldIds.int1Closure;
16
28
  const interval1 = new intervalNode_1.IntervalNode(a1, b1, closure1);
17
- const a2 = oldIds.int2Min === "-infty" ? infiniteNode_1.MinusInfinityNode : oldIds.int2Min.toTree();
18
- const b2 = oldIds.int2Max === "infty" ? infiniteNode_1.PlusInfinityNode : oldIds.int2Max.toTree();
29
+ const a2 = oldIds.int2Min === "-infty" ||
30
+ oldIds.int2Min === -Infinity ||
31
+ oldIds.int2Min === null ||
32
+ oldIds.int2Min === undefined
33
+ ? infiniteNode_1.MinusInfinityNode
34
+ : oldIds.int2Min.toTree();
35
+ const b2 = oldIds.int2Max === "infty" ||
36
+ oldIds.int2Max === Infinity ||
37
+ oldIds.int2Max === null ||
38
+ oldIds.int2Max === undefined
39
+ ? infiniteNode_1.PlusInfinityNode
40
+ : oldIds.int2Max.toTree();
19
41
  const closure2 = oldIds.int2Closure;
20
42
  const interval2 = new intervalNode_1.IntervalNode(a2, b2, closure2);
21
43
  return {
package/lib/exercises/math/sets/intervals/intervalsUnion.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"intervalsUnion.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalsUnion.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,0BAA0B,CAAC;AAOlC,OAAO,EAGL,uBAAuB,EACxB,MAAM,oCAAoC,CAAC;AAI5C,KAAK,WAAW,GAAG;IAOjB,eAAe,EAAE,uBAAuB,CAAC;IACzC,eAAe,EAAE,uBAAuB,CAAC;CAC1C,CAAC;AAyFF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAehD,CAAC"}
1
+ {"version":3,"file":"intervalsUnion.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/sets/intervals/intervalsUnion.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAWT,MAAM,0BAA0B,CAAC;AAOlC,OAAO,EAGL,uBAAuB,EACxB,MAAM,oCAAoC,CAAC;AAI5C,KAAK,WAAW,GAAG;IAOjB,eAAe,EAAE,uBAAuB,CAAC;IACzC,eAAe,EAAE,uBAAuB,CAAC;CAC1C,CAAC;AA8GF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAehD,CAAC"}
package/lib/exercises/math/sets/intervals/intervalsUnion.js CHANGED
@@ -8,12 +8,34 @@ const intervalNode_1 = require("../../../../tree/nodes/sets/intervalNode");
8
8
  const unionIntervalParser_1 = require("../../../../tree/parsers/unionIntervalParser");
9
9
  const shuffle_1 = require("../../../../utils/alea/shuffle");
10
10
  const rebuildIdentifiers = (oldIds) => {
11
- const a1 = oldIds.int1Min === "-infty" ? infiniteNode_1.MinusInfinityNode : oldIds.int1Min.toTree();
12
- const b1 = oldIds.int1Max === "infty" ? infiniteNode_1.PlusInfinityNode : oldIds.int1Max.toTree();
11
+ if (!!oldIds.int1Identifiers)
12
+ return oldIds;
13
+ const a1 = oldIds.int1Min === "-infty" ||
14
+ oldIds.int2Min === -Infinity ||
15
+ oldIds.int1Min === null ||
16
+ oldIds.int1Min === undefined
17
+ ? infiniteNode_1.MinusInfinityNode
18
+ : oldIds.int1Min.toTree();
19
+ const b1 = oldIds.int1Max === "infty" ||
20
+ oldIds.int1Max === Infinity ||
21
+ oldIds.int1Max === null ||
22
+ oldIds.int1Max === undefined
23
+ ? infiniteNode_1.PlusInfinityNode
24
+ : oldIds.int1Max.toTree();
13
25
  const closure1 = oldIds.int1Closure;
14
26
  const interval1 = new intervalNode_1.IntervalNode(a1, b1, closure1);
15
- const a2 = oldIds.int2Min === "-infty" ? infiniteNode_1.MinusInfinityNode : oldIds.int2Min.toTree();
16
- const b2 = oldIds.int2Max === "infty" ? infiniteNode_1.PlusInfinityNode : oldIds.int2Max.toTree();
27
+ const a2 = oldIds.int2Min === "-infty" ||
28
+ oldIds.int2Min === -Infinity ||
29
+ oldIds.int2Min === null ||
30
+ oldIds.int2Min === undefined
31
+ ? infiniteNode_1.MinusInfinityNode
32
+ : oldIds.int2Min.toTree();
33
+ const b2 = oldIds.int2Max === "infty" ||
34
+ oldIds.int2Max === Infinity ||
35
+ oldIds.int2Max === null ||
36
+ oldIds.int2Max === undefined
37
+ ? infiniteNode_1.PlusInfinityNode
38
+ : oldIds.int2Max.toTree();
17
39
  const closure2 = oldIds.int2Closure;
18
40
  const interval2 = new intervalNode_1.IntervalNode(a2, b2, closure2);
19
41
  return {
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "math-exercises",
3
- "version": "2.2.82",
3
+ "version": "2.2.84",
4
4
  "description": "Math exercises generator for middle school and high school",
5
5
  "main": "lib/index.js",
6
6
  "files": [