math-exercises 2.2.82 → 2.2.83

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 +4 -2
  3. package/lib/exercises/math/sets/intervals/intervalToInequality.d.ts.map +1 -1
  4. package/lib/exercises/math/sets/intervals/intervalToInequality.js +4 -2
  5. package/lib/exercises/math/sets/intervals/intervalsIntersection.d.ts.map +1 -1
  6. package/lib/exercises/math/sets/intervals/intervalsIntersection.js +14 -4
  7. package/lib/exercises/math/sets/intervals/intervalsUnion.d.ts.map +1 -1
  8. package/lib/exercises/math/sets/intervals/intervalsUnion.js +14 -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;AAqFF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAetD,CAAC"}
package/lib/exercises/math/sets/intervals/inequalityToInterval.js CHANGED
@@ -8,10 +8,12 @@ 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" || oldIds.intervalMin === -Infinity
12
14
  ? infiniteNode_1.MinusInfinityNode
13
15
  : oldIds.intervalMin.toTree();
14
- const b = oldIds.intervalMax === "infty"
16
+ const b = oldIds.intervalMax === "infty" || oldIds.intervalMax === Infinity
15
17
  ? infiniteNode_1.PlusInfinityNode
16
18
  : oldIds.intervalMax.toTree();
17
19
  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;AAgFF,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAetD,CAAC"}
package/lib/exercises/math/sets/intervals/intervalToInequality.js CHANGED
@@ -7,10 +7,12 @@ 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" || oldIds.intervalMin === -Infinity
11
13
  ? infiniteNode_1.MinusInfinityNode
12
14
  : oldIds.intervalMin.toTree();
13
- const b = oldIds.intervalMax === "infty"
15
+ const b = oldIds.intervalMax === "infty" || oldIds.intervalMax === Infinity
14
16
  ? infiniteNode_1.PlusInfinityNode
15
17
  : oldIds.intervalMax.toTree();
16
18
  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;AAqJF,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,WAAW,CAgBvD,CAAC"}
package/lib/exercises/math/sets/intervals/intervalsIntersection.js CHANGED
@@ -10,12 +10,22 @@ 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" || oldIds.int2Min === -Infinity
16
+ ? infiniteNode_1.MinusInfinityNode
17
+ : oldIds.int1Min.toTree();
18
+ const b1 = oldIds.int1Max === "infty" || oldIds.int1Max === Infinity
19
+ ? infiniteNode_1.PlusInfinityNode
20
+ : oldIds.int1Max.toTree();
15
21
  const closure1 = oldIds.int1Closure;
16
22
  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();
23
+ const a2 = oldIds.int2Min === "-infty" || oldIds.int2Min === -Infinity
24
+ ? infiniteNode_1.MinusInfinityNode
25
+ : oldIds.int2Min.toTree();
26
+ const b2 = oldIds.int2Max === "infty" || oldIds.int2Max === Infinity
27
+ ? infiniteNode_1.PlusInfinityNode
28
+ : oldIds.int2Max.toTree();
19
29
  const closure2 = oldIds.int2Closure;
20
30
  const interval2 = new intervalNode_1.IntervalNode(a2, b2, closure2);
21
31
  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;AAkGF,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,WAAW,CAehD,CAAC"}
package/lib/exercises/math/sets/intervals/intervalsUnion.js CHANGED
@@ -8,12 +8,22 @@ 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" || oldIds.int2Min === -Infinity
14
+ ? infiniteNode_1.MinusInfinityNode
15
+ : oldIds.int1Min.toTree();
16
+ const b1 = oldIds.int1Max === "infty" || oldIds.int1Max === Infinity
17
+ ? infiniteNode_1.PlusInfinityNode
18
+ : oldIds.int1Max.toTree();
13
19
  const closure1 = oldIds.int1Closure;
14
20
  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();
21
+ const a2 = oldIds.int2Min === "-infty" || oldIds.int2Min === -Infinity
22
+ ? infiniteNode_1.MinusInfinityNode
23
+ : oldIds.int2Min.toTree();
24
+ const b2 = oldIds.int2Max === "infty" || oldIds.int2Max === Infinity
25
+ ? infiniteNode_1.PlusInfinityNode
26
+ : oldIds.int2Max.toTree();
17
27
  const closure2 = oldIds.int2Closure;
18
28
  const interval2 = new intervalNode_1.IntervalNode(a2, b2, closure2);
19
29
  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.83",
4
4
  "description": "Math exercises generator for middle school and high school",
5
5
  "main": "lib/index.js",
6
6
  "files": [