math-exercises 2.0.6 → 2.0.7

package/lib/tree/nodes/functions/logNode.js

@@ -11,7 +11,7 @@ function isLogNode(a) {
 exports.isLogNode = isLogNode;
 class LogNode {
     constructor(child, opts) {
-        this.id = functionNode_1.FunctionsIds.opposite;
+        this.id = functionNode_1.FunctionsIds.log;
         this.child = child;
         this.type = node_1.NodeType.function;
         this.opts = opts;

package/lib/tree/nodes/inequations/inequationSolutionNode.d.ts

@@ -1,5 +1,6 @@
 import { Node, NodeOptions, NodeType } from "../node";
 import { IntervalNode } from "../sets/intervalNode";
+import { UnionIntervalNode } from "../sets/unionIntervalNode";
 type InequationSolutionNodeOptions = {
     variable?: string;
     opts?: NodeOptions;
@@ -7,9 +8,9 @@ type InequationSolutionNodeOptions = {
 export declare class InequationSolutionNode implements Node {
     type: NodeType;
     variable: string;
-    intervalSolution: IntervalNode;
+    intervalSolution: IntervalNode | UnionIntervalNode;
     opts?: NodeOptions;
-    constructor(intervalSolution: IntervalNode, params?: InequationSolutionNodeOptions);
+    constructor(intervalSolution: IntervalNode | UnionIntervalNode, params?: InequationSolutionNodeOptions);
     toAllTexs(): string[];
     toAllValidTexs(): string[];
     toEquivalentNodes(opts?: NodeOptions): (import("./inequationNode").InequationNode | InequationSolutionNode)[];

package/lib/tree/nodes/inequations/inequationSolutionNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"inequationSolutionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/inequations/inequationSolutionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAEpD,KAAK,6BAA6B,GAAG;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,WAAW,CAAA;CAAE,CAAC;AAC/E,qBAAa,sBAAuB,YAAW,IAAI;IACjD,IAAI,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,EAAE,YAAY,CAAC;IAC/B,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,gBAAgB,EAAE,YAAY,EAC9B,MAAM,CAAC,EAAE,6BAA6B;IAcxC,SAAS;IAUT,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAQpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAGN"}
+{"version":3,"file":"inequationSolutionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/inequations/inequationSolutionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,YAAY,EAAkB,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D,KAAK,6BAA6B,GAAG;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,WAAW,CAAA;CAAE,CAAC;AAC/E,qBAAa,sBAAuB,YAAW,IAAI;IACjD,IAAI,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,EAAE,YAAY,GAAG,iBAAiB,CAAC;IACnD,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,gBAAgB,EAAE,YAAY,GAAG,iBAAiB,EAClD,MAAM,CAAC,EAAE,6BAA6B;IAcxC,SAAS;IAUT,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAepC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAGN"}

package/lib/tree/nodes/inequations/inequationSolutionNode.js

@@ -2,6 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.InequationSolutionNode = void 0;
 const node_1 = require("../node");
+const intervalNode_1 = require("../sets/intervalNode");
 class InequationSolutionNode {
     constructor(intervalSolution, params) {
         this.type = node_1.NodeType.set;
@@ -18,7 +19,7 @@ class InequationSolutionNode {
         const intervalTex = this.intervalSolution.toTex();
         const res = [
             this.toTex(),
-            this.intervalSolution.toTex(),
+            intervalTex,
             `${this.variable}\\in${intervalTex}`,
         ];
         return res;
@@ -27,11 +28,19 @@ class InequationSolutionNode {
         return this.toEquivalentNodes(this.opts).flatMap((el) => el.toAllTexs());
     }
     toEquivalentNodes(opts) {
-        const equivs = this.intervalSolution.toEquivalentNodes(opts ?? this.opts);
-        return equivs.flatMap((equiv) => [
-            new InequationSolutionNode(equiv, { variable: this.variable, opts }),
-            ...equiv.toInequality().toEquivalentNodes(),
-        ]);
+        if ((0, intervalNode_1.isIntervalNode)(this.intervalSolution)) {
+            const equivs = this.intervalSolution.toEquivalentNodes(opts ?? this.opts);
+            return equivs.flatMap((equiv) => [
+                new InequationSolutionNode(equiv, { variable: this.variable, opts }),
+                ...equiv.toInequality().toEquivalentNodes(),
+            ]);
+        }
+        else {
+            const equivs = this.intervalSolution.toEquivalentNodes(opts ?? this.opts);
+            return equivs.flatMap((equiv) => [
+                new InequationSolutionNode(equiv, { variable: this.variable, opts }),
+            ]);
+        }
     }
     toMathString() {
         return "";

package/lib/tree/nodes/operators/addNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"addNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/addNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EACL,uBAAuB,EACvB,WAAW,EAGZ,MAAM,gBAAgB,CAAC;AAKxB,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AAKD,qBAAa,OAAQ,YAAW,uBAAuB;IACrD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAQpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,aAAa,EAAE;IAoCtD,SAAS,IAAI,MAAM,EAAE;IAIrB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAK5C,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;CAMtC"}
+{"version":3,"file":"addNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/addNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EACL,uBAAuB,EACvB,WAAW,EAGZ,MAAM,gBAAgB,CAAC;AAKxB,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AAMD,qBAAa,OAAQ,YAAW,uBAAuB;IACrD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAQpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,aAAa,EAAE;IAoCtD,SAAS,IAAI,MAAM,EAAE;IAIrB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAK5C,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;CAMtC"}

package/lib/tree/nodes/operators/addNode.js

@@ -13,6 +13,8 @@ function isAddNode(a) {
 }
 exports.isAddNode = isAddNode;
 const addNodeToTex = (leftTex, rightTex) => {
+    if (rightTex === "0")
+        return leftTex;
     return `${leftTex}${rightTex[0] === "-" ? "" : "+"}${rightTex}`;
 };
 class AddNode {

package/lib/tree/nodes/operators/powerNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;gBAEb,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,YAAY,IAAI,MAAM;IAItB,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAuBf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;CA0BtC;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAGrD"}
+{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKjD,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;gBAEb,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,YAAY,IAAI,MAAM;IAItB,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAuBf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;CA4CtC;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAGrD"}

package/lib/tree/nodes/sets/discreteSetNode.d.ts

@@ -1,7 +1,9 @@
 import { Node, NodeOptions, NodeType } from "../node";
-import { SetNode } from "./setNode";
+import { SetIds, SetNode } from "./setNode";
+export declare function isUnionIntervalNode(a: Node): a is DiscreteSetNode;
 export declare class DiscreteSetNode implements SetNode {
     type: NodeType;
+    id: SetIds;
     opts?: NodeOptions | undefined;
     elements: Node[];
     constructor(elements: Node[], opts?: NodeOptions);

package/lib/tree/nodes/sets/discreteSetNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"discreteSetNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/discreteSetNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,qBAAa,eAAgB,YAAW,OAAO;IAC7C,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,QAAQ,EAAE,IAAI,EAAE,CAAC;gBACL,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAKhD,cAAc;IAGd,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAyBpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAMN;AAED,eAAO,MAAM,QAAQ,iBAA0B,CAAC"}
+{"version":3,"file":"discreteSetNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/discreteSetNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AACvD,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,eAAe,CAEjE;AACD,qBAAa,eAAgB,YAAW,OAAO;IAC7C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,QAAQ,EAAE,IAAI,EAAE,CAAC;gBACL,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAMhD,cAAc;IAGd,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAyBpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAMN;AAED,eAAO,MAAM,QAAQ,iBAA0B,CAAC"}

package/lib/tree/nodes/sets/discreteSetNode.js

@@ -1,12 +1,18 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.EmptySet = exports.DiscreteSetNode = void 0;
+exports.EmptySet = exports.DiscreteSetNode = exports.isUnionIntervalNode = void 0;
 const cartesianProducts_1 = require("../../../utils/cartesianProducts");
 const permutations_1 = require("../../../utils/permutations");
 const node_1 = require("../node");
+const setNode_1 = require("./setNode");
+function isUnionIntervalNode(a) {
+    return (0, setNode_1.isSetNode)(a) && a.id === setNode_1.SetIds.discrete;
+}
+exports.isUnionIntervalNode = isUnionIntervalNode;
 class DiscreteSetNode {
     constructor(elements, opts) {
         this.type = node_1.NodeType.set;
+        this.id = setNode_1.SetIds.discrete;
         this.elements = elements;
         this.opts = opts;
     }

package/lib/tree/nodes/sets/intervalNode.d.ts

@@ -1,14 +1,16 @@
 import { InequationNode } from "../inequations/inequationNode";
 import { Node, NodeOptions, NodeType } from "../node";
-import { SetNode } from "./setNode";
+import { SetIds, SetNode } from "./setNode";
 export declare enum ClosureType {
     FF = 0,
     FO = 1,
     OF = 2,
     OO = 3
 }
+export declare function isIntervalNode(a: Node): a is IntervalNode;
 export declare class IntervalNode implements SetNode {
     type: NodeType;
+    id: SetIds;
     opts?: NodeOptions | undefined;
     closure: ClosureType;
     a: Node;

package/lib/tree/nodes/sets/intervalNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGtD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,oBAAY,WAAW;IACrB,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;CACH;AAED,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,IAAI,CAAC;IACR,CAAC,EAAE,IAAI,CAAC;gBACI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,WAAW;IAQtE,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,IAAI;IA4B/B,YAAY;IAIZ,QAAQ;IAIR,KAAK;CAWN"}
+{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGtD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AAEvD,oBAAY,WAAW;IACrB,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;CACH;AACD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,IAAI,CAAC;IACR,CAAC,EAAE,IAAI,CAAC;gBACI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,WAAW;IAStE,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,IAAI;IA4B/B,YAAY;IAIZ,QAAQ;IAIR,KAAK;CAWN"}

package/lib/tree/nodes/sets/intervalNode.js

@@ -1,11 +1,12 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.IntervalNode = exports.ClosureType = void 0;
+exports.IntervalNode = exports.isIntervalNode = exports.ClosureType = void 0;
 const cartesianProducts_1 = require("../../../utils/cartesianProducts");
 const inequationNode_1 = require("../inequations/inequationNode");
 const node_1 = require("../node");
 const constantNode_1 = require("../numbers/constantNode");
 const variableNode_1 = require("../variables/variableNode");
+const setNode_1 = require("./setNode");
 var ClosureType;
 (function (ClosureType) {
     ClosureType[ClosureType["FF"] = 0] = "FF";
@@ -13,9 +14,14 @@ var ClosureType;
     ClosureType[ClosureType["OF"] = 2] = "OF";
     ClosureType[ClosureType["OO"] = 3] = "OO";
 })(ClosureType || (exports.ClosureType = ClosureType = {}));
+function isIntervalNode(a) {
+    return (0, setNode_1.isSetNode)(a) && a.id === setNode_1.SetIds.interval;
+}
+exports.isIntervalNode = isIntervalNode;
 class IntervalNode {
     constructor(a, b, closure, opts) {
         this.type = node_1.NodeType.set;
+        this.id = setNode_1.SetIds.interval;
         this.closure = closure;
         this.a = a;
         this.b = b;

package/lib/tree/nodes/sets/setNode.d.ts

@@ -1,4 +1,12 @@
-import { Node } from "../node";
+import { Node, NodeOptions } from "../node";
+export declare enum SetIds {
+    interval = 0,
+    discrete = 1,
+    union = 2
+}
 export interface SetNode extends Node {
+    id: SetIds;
+    toEquivalentNodes: (opts?: NodeOptions) => SetNode[];
 }
+export declare function isSetNode(a: Node): a is SetNode;
 //# sourceMappingURL=setNode.d.ts.map

package/lib/tree/nodes/sets/setNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"setNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/setNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAE/B,MAAM,WAAW,OAAQ,SAAQ,IAAI;CAAG"}
+{"version":3,"file":"setNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/setNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAY,MAAM,SAAS,CAAC;AAEtD,oBAAY,MAAM;IAChB,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,KAAK,IAAA;CACN;AACD,MAAM,WAAW,OAAQ,SAAQ,IAAI;IACnC,EAAE,EAAE,MAAM,CAAC;IACX,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,OAAO,EAAE,CAAC;CACtD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C"}

package/lib/tree/nodes/sets/setNode.js

@@ -1,2 +1,14 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.isSetNode = exports.SetIds = void 0;
+const node_1 = require("../node");
+var SetIds;
+(function (SetIds) {
+    SetIds[SetIds["interval"] = 0] = "interval";
+    SetIds[SetIds["discrete"] = 1] = "discrete";
+    SetIds[SetIds["union"] = 2] = "union";
+})(SetIds || (exports.SetIds = SetIds = {}));
+function isSetNode(a) {
+    return a.type === node_1.NodeType.set;
+}
+exports.isSetNode = isSetNode;

package/lib/tree/nodes/sets/unionIntervalNode.d.ts

@@ -1,13 +1,15 @@
 import { Node, NodeOptions, NodeType } from "../node";
-import { SetNode } from "./setNode";
+import { SetIds, SetNode } from "./setNode";
 export declare enum ClosureType {
     FF = 0,
     FO = 1,
     OF = 2,
     OO = 3
 }
+export declare function isUnionIntervalNode(a: Node): a is UnionIntervalNode;
 export declare class UnionIntervalNode implements Node {
     type: NodeType;
+    id: SetIds;
     opts?: NodeOptions | undefined;
     sets: SetNode[];
     constructor(sets: SetNode[], opts?: NodeOptions);

package/lib/tree/nodes/sets/unionIntervalNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"unionIntervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/unionIntervalNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,oBAAY,WAAW;IACrB,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;CACH;AAED,qBAAa,iBAAkB,YAAW,IAAI;IAC5C,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,IAAI,EAAE,OAAO,EAAE,CAAC;gBACJ,IAAI,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAM/C,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAcpC,YAAY;IAIZ,QAAQ;IAIR,KAAK;CAGN"}
+{"version":3,"file":"unionIntervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/unionIntervalNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AAEvD,oBAAY,WAAW;IACrB,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;CACH;AACD,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,iBAAiB,CAEnE;AACD,qBAAa,iBAAkB,YAAW,IAAI;IAC5C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,IAAI,EAAE,OAAO,EAAE,CAAC;gBACJ,IAAI,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAO/C,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAcpC,YAAY;IAIZ,QAAQ;IAIR,KAAK;CAGN"}

package/lib/tree/nodes/sets/unionIntervalNode.js

@@ -1,9 +1,10 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.UnionIntervalNode = exports.ClosureType = void 0;
+exports.UnionIntervalNode = exports.isUnionIntervalNode = exports.ClosureType = void 0;
 const cartesianProducts_1 = require("../../../utils/cartesianProducts");
 const permutations_1 = require("../../../utils/permutations");
 const node_1 = require("../node");
+const setNode_1 = require("./setNode");
 var ClosureType;
 (function (ClosureType) {
     ClosureType[ClosureType["FF"] = 0] = "FF";
@@ -11,9 +12,14 @@ var ClosureType;
     ClosureType[ClosureType["OF"] = 2] = "OF";
     ClosureType[ClosureType["OO"] = 3] = "OO";
 })(ClosureType || (exports.ClosureType = ClosureType = {}));
+function isUnionIntervalNode(a) {
+    return (0, setNode_1.isSetNode)(a) && a.id === setNode_1.SetIds.union;
+}
+exports.isUnionIntervalNode = isUnionIntervalNode;
 class UnionIntervalNode {
     constructor(sets, opts) {
         this.type = node_1.NodeType.set;
+        this.id = setNode_1.SetIds.union;
         this.sets = sets;
         this.opts = opts;
     }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "2.0.6",
+  "version": "2.0.7",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [