math-exercises 2.2.83 → 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 +8 -2
  3. package/lib/exercises/math/sets/intervals/intervalToInequality.d.ts.map +1 -1
  4. package/lib/exercises/math/sets/intervals/intervalToInequality.js +8 -2
  5. package/lib/exercises/math/sets/intervals/intervalsIntersection.d.ts.map +1 -1
  6. package/lib/exercises/math/sets/intervals/intervalsIntersection.js +16 -4
  7. package/lib/exercises/math/sets/intervals/intervalsUnion.d.ts.map +1 -1
  8. package/lib/exercises/math/sets/intervals/intervalsUnion.js +16 -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;AAqFF,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
@@ -10,10 +10,16 @@ const shuffle_1 = require("../../../../utils/alea/shuffle");
10
10
  const rebuildIdentifiers = (oldIds) => {
11
11
  if (!!oldIds.intervalIdentifiers)
12
12
  return oldIds;
13
- const a = oldIds.intervalMin === "-infty" || oldIds.intervalMin === -Infinity
13
+ const a = oldIds.intervalMin === "-infty" ||
14
+ oldIds.intervalMin === -Infinity ||
15
+ oldIds.intervalMin === null ||
16
+ oldIds.intervalMin === undefined
14
17
  ? infiniteNode_1.MinusInfinityNode
15
18
  : oldIds.intervalMin.toTree();
16
- const b = oldIds.intervalMax === "infty" || oldIds.intervalMax === Infinity
19
+ const b = oldIds.intervalMax === "infty" ||
20
+ oldIds.intervalMax === Infinity ||
21
+ oldIds.intervalMax === null ||
22
+ oldIds.intervalMax === undefined
17
23
  ? infiniteNode_1.PlusInfinityNode
18
24
  : oldIds.intervalMax.toTree();
19
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;AAgFF,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
@@ -9,10 +9,16 @@ const shuffle_1 = require("../../../../utils/alea/shuffle");
9
9
  const rebuildIdentifiers = (oldIds) => {
10
10
  if (!!oldIds.intervalIdentifiers)
11
11
  return oldIds;
12
- const a = oldIds.intervalMin === "-infty" || oldIds.intervalMin === -Infinity
12
+ const a = oldIds.intervalMin === "-infty" ||
13
+ oldIds.intervalMin === -Infinity ||
14
+ oldIds.intervalMin === null ||
15
+ oldIds.intervalMin === undefined
13
16
  ? infiniteNode_1.MinusInfinityNode
14
17
  : oldIds.intervalMin.toTree();
15
- const b = oldIds.intervalMax === "infty" || oldIds.intervalMax === Infinity
18
+ const b = oldIds.intervalMax === "infty" ||
19
+ oldIds.intervalMax === Infinity ||
20
+ oldIds.intervalMax === null ||
21
+ oldIds.intervalMax === undefined
16
22
  ? infiniteNode_1.PlusInfinityNode
17
23
  : oldIds.intervalMax.toTree();
18
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;AAqJF,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
@@ -12,18 +12,30 @@ const shuffle_1 = require("../../../../utils/alea/shuffle");
12
12
  const rebuildIdentifiers = (oldIds) => {
13
13
  if (!!oldIds.int1Identifiers)
14
14
  return oldIds;
15
- const a1 = oldIds.int1Min === "-infty" || oldIds.int2Min === -Infinity
15
+ const a1 = oldIds.int1Min === "-infty" ||
16
+ oldIds.int2Min === -Infinity ||
17
+ oldIds.int1Min === null ||
18
+ oldIds.int1Min === undefined
16
19
  ? infiniteNode_1.MinusInfinityNode
17
20
  : oldIds.int1Min.toTree();
18
- const b1 = oldIds.int1Max === "infty" || oldIds.int1Max === Infinity
21
+ const b1 = oldIds.int1Max === "infty" ||
22
+ oldIds.int1Max === Infinity ||
23
+ oldIds.int1Max === null ||
24
+ oldIds.int1Max === undefined
19
25
  ? infiniteNode_1.PlusInfinityNode
20
26
  : oldIds.int1Max.toTree();
21
27
  const closure1 = oldIds.int1Closure;
22
28
  const interval1 = new intervalNode_1.IntervalNode(a1, b1, closure1);
23
- const a2 = oldIds.int2Min === "-infty" || oldIds.int2Min === -Infinity
29
+ const a2 = oldIds.int2Min === "-infty" ||
30
+ oldIds.int2Min === -Infinity ||
31
+ oldIds.int2Min === null ||
32
+ oldIds.int2Min === undefined
24
33
  ? infiniteNode_1.MinusInfinityNode
25
34
  : oldIds.int2Min.toTree();
26
- const b2 = oldIds.int2Max === "infty" || oldIds.int2Max === Infinity
35
+ const b2 = oldIds.int2Max === "infty" ||
36
+ oldIds.int2Max === Infinity ||
37
+ oldIds.int2Max === null ||
38
+ oldIds.int2Max === undefined
27
39
  ? infiniteNode_1.PlusInfinityNode
28
40
  : oldIds.int2Max.toTree();
29
41
  const closure2 = oldIds.int2Closure;
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;AAkGF,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
@@ -10,18 +10,30 @@ const shuffle_1 = require("../../../../utils/alea/shuffle");
10
10
  const rebuildIdentifiers = (oldIds) => {
11
11
  if (!!oldIds.int1Identifiers)
12
12
  return oldIds;
13
- const a1 = oldIds.int1Min === "-infty" || oldIds.int2Min === -Infinity
13
+ const a1 = oldIds.int1Min === "-infty" ||
14
+ oldIds.int2Min === -Infinity ||
15
+ oldIds.int1Min === null ||
16
+ oldIds.int1Min === undefined
14
17
  ? infiniteNode_1.MinusInfinityNode
15
18
  : oldIds.int1Min.toTree();
16
- const b1 = oldIds.int1Max === "infty" || oldIds.int1Max === Infinity
19
+ const b1 = oldIds.int1Max === "infty" ||
20
+ oldIds.int1Max === Infinity ||
21
+ oldIds.int1Max === null ||
22
+ oldIds.int1Max === undefined
17
23
  ? infiniteNode_1.PlusInfinityNode
18
24
  : oldIds.int1Max.toTree();
19
25
  const closure1 = oldIds.int1Closure;
20
26
  const interval1 = new intervalNode_1.IntervalNode(a1, b1, closure1);
21
- const a2 = oldIds.int2Min === "-infty" || oldIds.int2Min === -Infinity
27
+ const a2 = oldIds.int2Min === "-infty" ||
28
+ oldIds.int2Min === -Infinity ||
29
+ oldIds.int2Min === null ||
30
+ oldIds.int2Min === undefined
22
31
  ? infiniteNode_1.MinusInfinityNode
23
32
  : oldIds.int2Min.toTree();
24
- const b2 = oldIds.int2Max === "infty" || oldIds.int2Max === Infinity
33
+ const b2 = oldIds.int2Max === "infty" ||
34
+ oldIds.int2Max === Infinity ||
35
+ oldIds.int2Max === null ||
36
+ oldIds.int2Max === undefined
25
37
  ? infiniteNode_1.PlusInfinityNode
26
38
  : oldIds.int2Max.toTree();
27
39
  const closure2 = oldIds.int2Closure;
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "math-exercises",
3
- "version": "2.2.83",
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": [