math-exercises 2.0.2 → 2.0.3

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

@@ -1,116 +1,116 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.InequationNode = exports.getInversedInequationSymbol = void 0;
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
-const isLetter_1 = require("../../../utils/isLetter");
-const node_1 = require("../node");
-const infiniteNode_1 = require("../numbers/infiniteNode");
-const intervalNode_1 = require("../sets/intervalNode");
-const getInversedInequationSymbol = (s) => {
-    switch (s) {
-        case "<":
-            return ">";
-        case ">":
-            return "<";
-        case "\\ge":
-            return "\\le";
-        case "\\le":
-            return "\\ge";
-    }
-};
-exports.getInversedInequationSymbol = getInversedInequationSymbol;
-class InequationNode {
-    constructor(children, symbols) {
-        if (children.length < 2)
-            throw Error("can't build inequality with unique child");
-        if (Array.isArray(symbols) && symbols.length !== children.length - 1)
-            throw Error("symbols not in adequation with children");
-        this.children = children;
-        this.symbols = Array.isArray(symbols)
-            ? symbols
-            : this.children.slice(1).map((el) => symbols);
-        this.tex = "";
-        for (let i = 0; i < children.length; i++) {
-            this.tex += children[i].toTex();
-            if (i < children.length - 1) {
-                const shouldAddSpace = (this.symbols[i] === "\\le" || this.symbols[i] === "\\ge") &&
-                    (0, isLetter_1.isLetter)(children[i + 1].toTex());
-                this.tex += `${this.symbols[i]}${shouldAddSpace ? " " : ""}`;
-            }
-        }
-        this.type = node_1.NodeType.inequation;
-    }
-    toInterval() {
-        if (this.children.length > 3)
-            throw Error("can't build interval with this inequality");
-        if (this.children.length === 3) {
-            const closure = this.symbols[0] === "<"
-                ? this.symbols[1] === "<"
-                    ? intervalNode_1.ClosureType.OO
-                    : intervalNode_1.ClosureType.OF
-                : this.symbols[1] === "<"
-                    ? intervalNode_1.ClosureType.FO
-                    : intervalNode_1.ClosureType.FF;
-            return new intervalNode_1.IntervalNode(this.children[0], this.children[2], closure);
-        }
-        else {
-            let leftIsInf = false;
-            let rightIsInf = false;
-            let closure;
-            switch (this.symbols[0]) {
-                case "<":
-                    closure = intervalNode_1.ClosureType.OO;
-                    leftIsInf = true;
-                    break;
-                case ">":
-                    closure = intervalNode_1.ClosureType.OO;
-                    rightIsInf = true;
-                    break;
-                case "\\le":
-                    closure = intervalNode_1.ClosureType.OF;
-                    leftIsInf = true;
-                    break;
-                case "\\ge":
-                    closure = intervalNode_1.ClosureType.FO;
-                    rightIsInf = true;
-                    break;
-                default:
-                    throw Error("unrecognized inequation type");
-            }
-            return new intervalNode_1.IntervalNode(leftIsInf ? infiniteNode_1.MinusInfinityNode : this.children[1], rightIsInf ? infiniteNode_1.PlusInfinityNode : this.children[1], closure);
-        }
-    }
-    toReversed() {
-        const newChildren = [...this.children].reverse();
-        const newSymbols = this.symbols.map(exports.getInversedInequationSymbol);
-        return new InequationNode(newChildren, newSymbols);
-    }
-    toAllValidTexs() {
-        return this.toEquivalentNodes().map((node) => node.toTex());
-    }
-    toEquivalentNodes(opts) {
-        const equivs = this.children.map((node) => node.toEquivalentNodes());
-        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
-        const nodes = [];
-        cartesians.forEach((product) => {
-            const newNode = new InequationNode(product, this.symbols);
-            const reversed = newNode.toReversed();
-            nodes.push(newNode);
-            nodes.push(reversed);
-        });
-        return nodes;
-    }
-    toMathString() {
-        return this.tex;
-    }
-    toMathjs() {
-        return this.tex;
-    }
-    toAllTexs() {
-        return [this.toTex()];
-    }
-    toTex() {
-        return this.tex;
-    }
-}
-exports.InequationNode = InequationNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InequationNode = exports.getInversedInequationSymbol = void 0;
+const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const isLetter_1 = require("../../../utils/isLetter");
+const node_1 = require("../node");
+const infiniteNode_1 = require("../numbers/infiniteNode");
+const intervalNode_1 = require("../sets/intervalNode");
+const getInversedInequationSymbol = (s) => {
+    switch (s) {
+        case "<":
+            return ">";
+        case ">":
+            return "<";
+        case "\\ge":
+            return "\\le";
+        case "\\le":
+            return "\\ge";
+    }
+};
+exports.getInversedInequationSymbol = getInversedInequationSymbol;
+class InequationNode {
+    constructor(children, symbols) {
+        if (children.length < 2)
+            throw Error("can't build inequality with unique child");
+        if (Array.isArray(symbols) && symbols.length !== children.length - 1)
+            throw Error("symbols not in adequation with children");
+        this.children = children;
+        this.symbols = Array.isArray(symbols)
+            ? symbols
+            : this.children.slice(1).map((el) => symbols);
+        this.tex = "";
+        for (let i = 0; i < children.length; i++) {
+            this.tex += children[i].toTex();
+            if (i < children.length - 1) {
+                const shouldAddSpace = (this.symbols[i] === "\\le" || this.symbols[i] === "\\ge") &&
+                    (0, isLetter_1.isLetter)(children[i + 1].toTex());
+                this.tex += `${this.symbols[i]}${shouldAddSpace ? " " : ""}`;
+            }
+        }
+        this.type = node_1.NodeType.inequation;
+    }
+    toInterval() {
+        if (this.children.length > 3)
+            throw Error("can't build interval with this inequality");
+        if (this.children.length === 3) {
+            const closure = this.symbols[0] === "<"
+                ? this.symbols[1] === "<"
+                    ? intervalNode_1.ClosureType.OO
+                    : intervalNode_1.ClosureType.OF
+                : this.symbols[1] === "<"
+                    ? intervalNode_1.ClosureType.FO
+                    : intervalNode_1.ClosureType.FF;
+            return new intervalNode_1.IntervalNode(this.children[0], this.children[2], closure);
+        }
+        else {
+            let leftIsInf = false;
+            let rightIsInf = false;
+            let closure;
+            switch (this.symbols[0]) {
+                case "<":
+                    closure = intervalNode_1.ClosureType.OO;
+                    leftIsInf = true;
+                    break;
+                case ">":
+                    closure = intervalNode_1.ClosureType.OO;
+                    rightIsInf = true;
+                    break;
+                case "\\le":
+                    closure = intervalNode_1.ClosureType.OF;
+                    leftIsInf = true;
+                    break;
+                case "\\ge":
+                    closure = intervalNode_1.ClosureType.FO;
+                    rightIsInf = true;
+                    break;
+                default:
+                    throw Error("unrecognized inequation type");
+            }
+            return new intervalNode_1.IntervalNode(leftIsInf ? infiniteNode_1.MinusInfinityNode : this.children[1], rightIsInf ? infiniteNode_1.PlusInfinityNode : this.children[1], closure);
+        }
+    }
+    toReversed() {
+        const newChildren = [...this.children].reverse();
+        const newSymbols = this.symbols.map(exports.getInversedInequationSymbol);
+        return new InequationNode(newChildren, newSymbols);
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().map((node) => node.toTex());
+    }
+    toEquivalentNodes(opts) {
+        const equivs = this.children.map((node) => node.toEquivalentNodes());
+        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
+        const nodes = [];
+        cartesians.forEach((product) => {
+            const newNode = new InequationNode(product, this.symbols);
+            const reversed = newNode.toReversed();
+            nodes.push(newNode);
+            nodes.push(reversed);
+        });
+        return nodes;
+    }
+    toMathString() {
+        return this.tex;
+    }
+    toMathjs() {
+        return this.tex;
+    }
+    toAllTexs() {
+        return [this.toTex()];
+    }
+    toTex() {
+        return this.tex;
+    }
+}
+exports.InequationNode = InequationNode;

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

@@ -1,21 +1,21 @@
-import { Node, NodeOptions, NodeType } from "../node";
-import { IntervalNode } from "../sets/intervalNode";
-type InequationSolutionNodeOptions = {
-    variable?: string;
-    opts?: NodeOptions;
-};
-export declare class InequationSolutionNode implements Node {
-    type: NodeType;
-    variable: string;
-    intervalSolution: IntervalNode;
-    opts?: NodeOptions;
-    constructor(intervalSolution: IntervalNode, params?: InequationSolutionNodeOptions);
-    toAllTexs(): string[];
-    toAllValidTexs(): string[];
-    toEquivalentNodes(opts?: NodeOptions): (import("./inequationNode").InequationNode | InequationSolutionNode)[];
-    toMathString(): string;
-    toMathjs(): string;
-    toTex(): string;
-}
-export {};
+import { Node, NodeOptions, NodeType } from "../node";
+import { IntervalNode } from "../sets/intervalNode";
+type InequationSolutionNodeOptions = {
+    variable?: string;
+    opts?: NodeOptions;
+};
+export declare class InequationSolutionNode implements Node {
+    type: NodeType;
+    variable: string;
+    intervalSolution: IntervalNode;
+    opts?: NodeOptions;
+    constructor(intervalSolution: IntervalNode, params?: InequationSolutionNodeOptions);
+    toAllTexs(): string[];
+    toAllValidTexs(): string[];
+    toEquivalentNodes(opts?: NodeOptions): (import("./inequationNode").InequationNode | InequationSolutionNode)[];
+    toMathString(): string;
+    toMathjs(): string;
+    toTex(): string;
+}
+export {};
 //# sourceMappingURL=inequationSolutionNode.d.ts.map

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

@@ -1,46 +1,46 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.InequationSolutionNode = void 0;
-const node_1 = require("../node");
-class InequationSolutionNode {
-    constructor(intervalSolution, params) {
-        this.type = node_1.NodeType.set;
-        this.intervalSolution = intervalSolution;
-        this.variable = params?.variable ?? "x";
-        this.opts = params?.opts
-            ? {
-                ...params.opts,
-                allowRawRightChildAsSolution: params.opts.allowRawRightChildAsSolution ?? true,
-            }
-            : { allowRawRightChildAsSolution: true };
-    }
-    toAllTexs() {
-        const intervalTex = this.intervalSolution.toTex();
-        const res = [
-            this.toTex(),
-            this.intervalSolution.toTex(),
-            `${this.variable}\\in${intervalTex}`,
-        ];
-        return res;
-    }
-    toAllValidTexs() {
-        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(),
-        ]);
-    }
-    toMathString() {
-        return "";
-    }
-    toMathjs() {
-        return `S={${this.intervalSolution.toMathjs()}}`;
-    }
-    toTex() {
-        return `S=${this.intervalSolution.toTex()}`;
-    }
-}
-exports.InequationSolutionNode = InequationSolutionNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InequationSolutionNode = void 0;
+const node_1 = require("../node");
+class InequationSolutionNode {
+    constructor(intervalSolution, params) {
+        this.type = node_1.NodeType.set;
+        this.intervalSolution = intervalSolution;
+        this.variable = params?.variable ?? "x";
+        this.opts = params?.opts
+            ? {
+                ...params.opts,
+                allowRawRightChildAsSolution: params.opts.allowRawRightChildAsSolution ?? true,
+            }
+            : { allowRawRightChildAsSolution: true };
+    }
+    toAllTexs() {
+        const intervalTex = this.intervalSolution.toTex();
+        const res = [
+            this.toTex(),
+            this.intervalSolution.toTex(),
+            `${this.variable}\\in${intervalTex}`,
+        ];
+        return res;
+    }
+    toAllValidTexs() {
+        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(),
+        ]);
+    }
+    toMathString() {
+        return "";
+    }
+    toMathjs() {
+        return `S={${this.intervalSolution.toMathjs()}}`;
+    }
+    toTex() {
+        return `S=${this.intervalSolution.toTex()}`;
+    }
+}
+exports.InequationSolutionNode = InequationSolutionNode;

package/lib/tree/nodes/node.d.ts

@@ -1,35 +1,34 @@
-export declare enum NodeType {
-    number = 0,
-    constant = 1,
-    variable = 2,
-    operator = 3,
-    function = 4,
-    set = 5,
-    inequation = 6,
-    point = 7,
-    mesure = 8,
-    equality = 9,
-    belongs = 10,
-    vector = 11
-}
-export type NodeOptions = {
-    forceTimesSign?: boolean;
-    forbidPowerToProduct?: boolean;
-    allowRawRightChildAsSolution?: boolean;
-    allowFractionToDecimal?: boolean;
-    allowMinusAnywhereInFraction?: boolean;
-    useExpNotation?: boolean;
-    allowLnOfOne?: boolean;
-    allowPowerOne?: boolean;
-    allowSimplifySqrt?: boolean;
-};
-export interface Node {
-    type: NodeType;
-    opts?: NodeOptions;
-    toMathString: () => string;
-    toEquivalentNodes: (opts?: NodeOptions) => Node[];
-    toAllValidTexs: (opts?: NodeOptions) => string[];
-    toTex: () => string;
-    toMathjs: () => any;
-}
+export declare enum NodeType {
+    number = 0,
+    constant = 1,
+    variable = 2,
+    operator = 3,
+    function = 4,
+    set = 5,
+    inequation = 6,
+    point = 7,
+    mesure = 8,
+    equality = 9,
+    belongs = 10,
+    vector = 11
+}
+export type NodeOptions = {
+    forceTimesSign?: boolean;
+    forbidPowerToProduct?: boolean;
+    allowRawRightChildAsSolution?: boolean;
+    allowFractionToDecimal?: boolean;
+    allowMinusAnywhereInFraction?: boolean;
+    useExpNotation?: boolean;
+    allowLnOfOne?: boolean;
+    allowPowerOne?: boolean;
+    allowSimplifySqrt?: boolean;
+};
+export interface Node {
+    type: NodeType;
+    opts?: NodeOptions;
+    toMathString: () => string;
+    toEquivalentNodes: (opts?: NodeOptions) => Node[];
+    toAllValidTexs: (opts?: NodeOptions) => string[];
+    toTex: () => string;
+}
 //# sourceMappingURL=node.d.ts.map

package/lib/tree/nodes/node.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/node.ts"],"names":[],"mappings":"AAAA,oBAAY,QAAQ;IAClB,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,GAAG,IAAA;IACH,UAAU,IAAA;IACV,KAAK,IAAA;IACL,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,OAAO,KAAA;IACP,MAAM,KAAA;CACP;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;CAC7B,CAAC;AACF,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,MAAM,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,GAAG,CAAC;CAErB"}
+{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/node.ts"],"names":[],"mappings":"AAAA,oBAAY,QAAQ;IAClB,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,GAAG,IAAA;IACH,UAAU,IAAA;IACV,KAAK,IAAA;IACL,MAAM,IAAA;IACN,QAAQ,IAAA;IACR,OAAO,KAAA;IACP,MAAM,KAAA;CACP;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;CAC7B,CAAC;AACF,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,MAAM,MAAM,CAAC;CAGrB"}

package/lib/tree/nodes/node.js

@@ -1,18 +1,18 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.NodeType = void 0;
-var NodeType;
-(function (NodeType) {
-    NodeType[NodeType["number"] = 0] = "number";
-    NodeType[NodeType["constant"] = 1] = "constant";
-    NodeType[NodeType["variable"] = 2] = "variable";
-    NodeType[NodeType["operator"] = 3] = "operator";
-    NodeType[NodeType["function"] = 4] = "function";
-    NodeType[NodeType["set"] = 5] = "set";
-    NodeType[NodeType["inequation"] = 6] = "inequation";
-    NodeType[NodeType["point"] = 7] = "point";
-    NodeType[NodeType["mesure"] = 8] = "mesure";
-    NodeType[NodeType["equality"] = 9] = "equality";
-    NodeType[NodeType["belongs"] = 10] = "belongs";
-    NodeType[NodeType["vector"] = 11] = "vector";
-})(NodeType = exports.NodeType || (exports.NodeType = {}));
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NodeType = void 0;
+var NodeType;
+(function (NodeType) {
+    NodeType[NodeType["number"] = 0] = "number";
+    NodeType[NodeType["constant"] = 1] = "constant";
+    NodeType[NodeType["variable"] = 2] = "variable";
+    NodeType[NodeType["operator"] = 3] = "operator";
+    NodeType[NodeType["function"] = 4] = "function";
+    NodeType[NodeType["set"] = 5] = "set";
+    NodeType[NodeType["inequation"] = 6] = "inequation";
+    NodeType[NodeType["point"] = 7] = "point";
+    NodeType[NodeType["mesure"] = 8] = "mesure";
+    NodeType[NodeType["equality"] = 9] = "equality";
+    NodeType[NodeType["belongs"] = 10] = "belongs";
+    NodeType[NodeType["vector"] = 11] = "vector";
+})(NodeType || (exports.NodeType = NodeType = {}));

package/lib/tree/nodes/numbers/constantNode.d.ts

@@ -1,15 +1,14 @@
-import { Node, NodeType } from "../node";
-import { AlgebraicNode } from "../algebraicNode";
-export declare function isConstantNode(a: Node): a is ConstantNode;
-export declare class ConstantNode implements AlgebraicNode {
-    tex: string;
-    mathString: string;
-    type: NodeType;
-    constructor(tex: string, mathString: string);
-    toMathString(): string;
-    toTex(): string;
-    toMathjs(): import("mathjs").MathNode;
-    toAllValidTexs(): string[];
-    toEquivalentNodes(): this[];
-}
+import { Node, NodeType } from "../node";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isConstantNode(a: Node): a is ConstantNode;
+export declare class ConstantNode implements AlgebraicNode {
+    tex: string;
+    mathString: string;
+    type: NodeType;
+    constructor(tex: string, mathString: string);
+    toMathString(): string;
+    toTex(): string;
+    toAllValidTexs(): string[];
+    toEquivalentNodes(): this[];
+}
 //# sourceMappingURL=constantNode.d.ts.map

package/lib/tree/nodes/numbers/constantNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"constantNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/constantNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,aAAa;IAChD,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAK3C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAGd,iBAAiB;CAGlB"}
+{"version":3,"file":"constantNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/constantNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,aAAa;IAChD,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAK3C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAMf,cAAc;IAGd,iBAAiB;CAGlB"}

package/lib/tree/nodes/numbers/constantNode.js

@@ -1,32 +1,32 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ConstantNode = exports.isConstantNode = void 0;
-const mathjs_1 = require("mathjs");
-const node_1 = require("../node");
-function isConstantNode(a) {
-    return a.type === node_1.NodeType.constant;
-}
-exports.isConstantNode = isConstantNode;
-class ConstantNode {
-    constructor(tex, mathString) {
-        this.type = node_1.NodeType.constant;
-        this.tex = tex;
-        this.mathString = mathString;
-    }
-    toMathString() {
-        return `${this.mathString}`;
-    }
-    toTex() {
-        return `${this.tex}`;
-    }
-    toMathjs() {
-        return (0, mathjs_1.parse)(this.mathString);
-    }
-    toAllValidTexs() {
-        return this.toEquivalentNodes().map((node) => node.toTex());
-    }
-    toEquivalentNodes() {
-        return [this];
-    }
-}
-exports.ConstantNode = ConstantNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ConstantNode = exports.isConstantNode = void 0;
+// import { parse } from "mathjs";
+const node_1 = require("../node");
+function isConstantNode(a) {
+    return a.type === node_1.NodeType.constant;
+}
+exports.isConstantNode = isConstantNode;
+class ConstantNode {
+    constructor(tex, mathString) {
+        this.type = node_1.NodeType.constant;
+        this.tex = tex;
+        this.mathString = mathString;
+    }
+    toMathString() {
+        return `${this.mathString}`;
+    }
+    toTex() {
+        return `${this.tex}`;
+    }
+    // toMathjs() {
+    //   return parse(this.mathString);
+    // }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().map((node) => node.toTex());
+    }
+    toEquivalentNodes() {
+        return [this];
+    }
+}
+exports.ConstantNode = ConstantNode;

package/lib/tree/nodes/numbers/infiniteNode.d.ts

@@ -1,5 +1,5 @@
-import { ConstantNode } from "./constantNode";
-export declare const InfinityNode: ConstantNode;
-export declare const PlusInfinityNode: ConstantNode;
-export declare const MinusInfinityNode: ConstantNode;
+import { ConstantNode } from "./constantNode";
+export declare const InfinityNode: ConstantNode;
+export declare const PlusInfinityNode: ConstantNode;
+export declare const MinusInfinityNode: ConstantNode;
 //# sourceMappingURL=infiniteNode.d.ts.map

package/lib/tree/nodes/numbers/infiniteNode.js

@@ -1,7 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MinusInfinityNode = exports.PlusInfinityNode = exports.InfinityNode = void 0;
-const constantNode_1 = require("./constantNode");
-exports.InfinityNode = new constantNode_1.ConstantNode("\\infty", "infinity");
-exports.PlusInfinityNode = new constantNode_1.ConstantNode("+\\infty", "infinity");
-exports.MinusInfinityNode = new constantNode_1.ConstantNode("-\\infty", "-infinity");
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MinusInfinityNode = exports.PlusInfinityNode = exports.InfinityNode = void 0;
+const constantNode_1 = require("./constantNode");
+exports.InfinityNode = new constantNode_1.ConstantNode("\\infty", "infinity");
+exports.PlusInfinityNode = new constantNode_1.ConstantNode("+\\infty", "infinity");
+exports.MinusInfinityNode = new constantNode_1.ConstantNode("-\\infty", "-infinity");

package/lib/tree/nodes/numbers/numberNode.d.ts

@@ -1,16 +1,16 @@
-import { Node, NodeType } from "../node";
-import { AlgebraicNode } from "../algebraicNode";
-export declare function isNumberNode(a: Node): a is NumberNode;
-export declare class NumberNode implements AlgebraicNode {
-    tex: string;
-    mathString: string;
-    value: number;
-    type: NodeType;
-    constructor(value: number, tex?: string, mathString?: string);
-    toMathString(): string;
-    toTex(): string;
-    toMathjs(): string;
-    toAllValidTexs(): string[];
-    toEquivalentNodes(): this[];
-}
+import { Node, NodeType } from "../node";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isNumberNode(a: Node): a is NumberNode;
+export declare class NumberNode implements AlgebraicNode {
+    tex: string;
+    mathString: string;
+    value: number;
+    type: NodeType;
+    constructor(value: number, tex?: string, mathString?: string);
+    toMathString(): string;
+    toTex(): string;
+    toMathjs(): string;
+    toAllValidTexs(): string[];
+    toEquivalentNodes(): this[];
+}
 //# sourceMappingURL=numberNode.d.ts.map

package/lib/tree/nodes/numbers/numberNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"numberNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/numberNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AAED,qBAAa,UAAW,YAAW,aAAa;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,CAAmB;gBAErB,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;IAM5D,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAOd,iBAAiB;CAGlB"}
+{"version":3,"file":"numberNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/numberNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AAED,qBAAa,UAAW,YAAW,aAAa;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,CAAmB;gBAErB,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;IAM5D,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAOd,iBAAiB;CAGlB"}