math-exercises 2.0.2 → 2.0.4

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

@@ -1,24 +1,24 @@
-import { InequationNode } from "../inequations/inequationNode";
-import { Node, NodeOptions, NodeType } from "../node";
-import { SetNode } from "./setNode";
-export declare enum ClosureType {
-    FF = 0,
-    FO = 1,
-    OF = 2,
-    OO = 3
-}
-export declare class IntervalNode implements SetNode {
-    type: NodeType;
-    opts?: NodeOptions | undefined;
-    closure: ClosureType;
-    a: Node;
-    b: Node;
-    constructor(a: Node, b: Node, closure: ClosureType, opts?: NodeOptions);
-    toAllValidTexs(): string[];
-    toEquivalentNodes(opts?: NodeOptions): IntervalNode[];
-    toInequality(middleChild?: Node): InequationNode;
-    toMathString(): string;
-    toMathjs(): string;
-    toTex(): string;
-}
+import { InequationNode } from "../inequations/inequationNode";
+import { Node, NodeOptions, NodeType } from "../node";
+import { SetNode } from "./setNode";
+export declare enum ClosureType {
+    FF = 0,
+    FO = 1,
+    OF = 2,
+    OO = 3
+}
+export declare class IntervalNode implements SetNode {
+    type: NodeType;
+    opts?: NodeOptions | undefined;
+    closure: ClosureType;
+    a: Node;
+    b: Node;
+    constructor(a: Node, b: Node, closure: ClosureType, opts?: NodeOptions);
+    toAllValidTexs(): string[];
+    toEquivalentNodes(opts?: NodeOptions): IntervalNode[];
+    toInequality(middleChild?: Node): InequationNode;
+    toMathString(): string;
+    toMathjs(): string;
+    toTex(): string;
+}
 //# sourceMappingURL=intervalNode.d.ts.map

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

@@ -1,71 +1,71 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IntervalNode = 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");
-var ClosureType;
-(function (ClosureType) {
-    ClosureType[ClosureType["FF"] = 0] = "FF";
-    ClosureType[ClosureType["FO"] = 1] = "FO";
-    ClosureType[ClosureType["OF"] = 2] = "OF";
-    ClosureType[ClosureType["OO"] = 3] = "OO";
-})(ClosureType = exports.ClosureType || (exports.ClosureType = {}));
-class IntervalNode {
-    constructor(a, b, closure, opts) {
-        this.type = node_1.NodeType.set;
-        this.closure = closure;
-        this.a = a;
-        this.b = b;
-        this.opts = opts;
-    }
-    toAllValidTexs() {
-        return this.toEquivalentNodes(this.opts).map((node) => node.toTex());
-    }
-    toEquivalentNodes(opts) {
-        const res = [];
-        const equivs = [
-            this.a.toEquivalentNodes(opts ?? this.opts),
-            this.b.toEquivalentNodes(opts ?? this.opts),
-        ];
-        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
-        cartesians.forEach((product) => {
-            res.push(new IntervalNode(product[0], product[1], this.closure, opts ?? this.opts));
-        });
-        return res;
-    }
-    toInequality(middleChild) {
-        let middle = middleChild ?? new variableNode_1.VariableNode("x");
-        if ((0, constantNode_1.isConstantNode)(this.a) && this.a.tex.includes("infty")) {
-            return new inequationNode_1.InequationNode([middle, this.b], this.closure === ClosureType.OF ? "\\le" : "<");
-        }
-        if ((0, constantNode_1.isConstantNode)(this.b) && this.b.tex.includes("infty")) {
-            return new inequationNode_1.InequationNode([middle, this.a], this.closure === ClosureType.FO ? "\\ge" : ">");
-        }
-        const leftSymbol = this.closure === ClosureType.FO || this.closure === ClosureType.FF
-            ? "\\le"
-            : "<";
-        const rightSymbol = this.closure === ClosureType.FF || this.closure === ClosureType.OF
-            ? "\\le"
-            : "<";
-        return new inequationNode_1.InequationNode([this.a, middle, this.b], [leftSymbol, rightSymbol]);
-    }
-    toMathString() {
-        return this.toTex();
-    }
-    toMathjs() {
-        return this.toTex();
-    }
-    toTex() {
-        const left = this.closure === ClosureType.FF || this.closure === ClosureType.FO
-            ? "["
-            : "]";
-        const right = this.closure === ClosureType.FF || this.closure === ClosureType.OF
-            ? "]"
-            : "[";
-        return `${left}${this.a.toTex()};${this.b.toTex()}${right}`;
-    }
-}
-exports.IntervalNode = IntervalNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IntervalNode = 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");
+var ClosureType;
+(function (ClosureType) {
+    ClosureType[ClosureType["FF"] = 0] = "FF";
+    ClosureType[ClosureType["FO"] = 1] = "FO";
+    ClosureType[ClosureType["OF"] = 2] = "OF";
+    ClosureType[ClosureType["OO"] = 3] = "OO";
+})(ClosureType || (exports.ClosureType = ClosureType = {}));
+class IntervalNode {
+    constructor(a, b, closure, opts) {
+        this.type = node_1.NodeType.set;
+        this.closure = closure;
+        this.a = a;
+        this.b = b;
+        this.opts = opts;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes(this.opts).map((node) => node.toTex());
+    }
+    toEquivalentNodes(opts) {
+        const res = [];
+        const equivs = [
+            this.a.toEquivalentNodes(opts ?? this.opts),
+            this.b.toEquivalentNodes(opts ?? this.opts),
+        ];
+        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
+        cartesians.forEach((product) => {
+            res.push(new IntervalNode(product[0], product[1], this.closure, opts ?? this.opts));
+        });
+        return res;
+    }
+    toInequality(middleChild) {
+        let middle = middleChild ?? new variableNode_1.VariableNode("x");
+        if ((0, constantNode_1.isConstantNode)(this.a) && this.a.tex.includes("infty")) {
+            return new inequationNode_1.InequationNode([middle, this.b], this.closure === ClosureType.OF ? "\\le" : "<");
+        }
+        if ((0, constantNode_1.isConstantNode)(this.b) && this.b.tex.includes("infty")) {
+            return new inequationNode_1.InequationNode([middle, this.a], this.closure === ClosureType.FO ? "\\ge" : ">");
+        }
+        const leftSymbol = this.closure === ClosureType.FO || this.closure === ClosureType.FF
+            ? "\\le"
+            : "<";
+        const rightSymbol = this.closure === ClosureType.FF || this.closure === ClosureType.OF
+            ? "\\le"
+            : "<";
+        return new inequationNode_1.InequationNode([this.a, middle, this.b], [leftSymbol, rightSymbol]);
+    }
+    toMathString() {
+        return this.toTex();
+    }
+    toMathjs() {
+        return this.toTex();
+    }
+    toTex() {
+        const left = this.closure === ClosureType.FF || this.closure === ClosureType.FO
+            ? "["
+            : "]";
+        const right = this.closure === ClosureType.FF || this.closure === ClosureType.OF
+            ? "]"
+            : "[";
+        return `${left}${this.a.toTex()};${this.b.toTex()}${right}`;
+    }
+}
+exports.IntervalNode = IntervalNode;

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

@@ -1,4 +1,4 @@
-import { Node } from "../node";
-export interface SetNode extends Node {
-}
+import { Node } from "../node";
+export interface SetNode extends Node {
+}
 //# sourceMappingURL=setNode.d.ts.map

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

@@ -1,2 +1,2 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

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

@@ -1,20 +1,20 @@
-import { Node, NodeOptions, NodeType } from "../node";
-import { SetNode } from "./setNode";
-export declare enum ClosureType {
-    FF = 0,
-    FO = 1,
-    OF = 2,
-    OO = 3
-}
-export declare class UnionIntervalNode implements Node {
-    type: NodeType;
-    opts?: NodeOptions | undefined;
-    sets: SetNode[];
-    constructor(sets: SetNode[], opts?: NodeOptions);
-    toAllValidTexs(): string[];
-    toEquivalentNodes(opts?: NodeOptions): UnionIntervalNode[];
-    toMathString(): string;
-    toMathjs(): string;
-    toTex(): string;
-}
+import { Node, NodeOptions, NodeType } from "../node";
+import { SetNode } from "./setNode";
+export declare enum ClosureType {
+    FF = 0,
+    FO = 1,
+    OF = 2,
+    OO = 3
+}
+export declare class UnionIntervalNode implements Node {
+    type: NodeType;
+    opts?: NodeOptions | undefined;
+    sets: SetNode[];
+    constructor(sets: SetNode[], opts?: NodeOptions);
+    toAllValidTexs(): string[];
+    toEquivalentNodes(opts?: NodeOptions): UnionIntervalNode[];
+    toMathString(): string;
+    toMathjs(): string;
+    toTex(): string;
+}
 //# sourceMappingURL=unionIntervalNode.d.ts.map

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

@@ -1,44 +1,44 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UnionIntervalNode = exports.ClosureType = void 0;
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
-const permutations_1 = require("../../../utils/permutations");
-const node_1 = require("../node");
-var ClosureType;
-(function (ClosureType) {
-    ClosureType[ClosureType["FF"] = 0] = "FF";
-    ClosureType[ClosureType["FO"] = 1] = "FO";
-    ClosureType[ClosureType["OF"] = 2] = "OF";
-    ClosureType[ClosureType["OO"] = 3] = "OO";
-})(ClosureType = exports.ClosureType || (exports.ClosureType = {}));
-class UnionIntervalNode {
-    constructor(sets, opts) {
-        this.type = node_1.NodeType.set;
-        this.sets = sets;
-        this.opts = opts;
-    }
-    toAllValidTexs() {
-        return this.toEquivalentNodes(this.opts).map((node) => node.toTex());
-    }
-    toEquivalentNodes(opts) {
-        const options = opts ?? this.opts;
-        const res = [];
-        const equivs = this.sets.map((s) => s.toEquivalentNodes(options));
-        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
-        cartesians.forEach((product) => {
-            const permutations = (0, permutations_1.permute)(product);
-            permutations.forEach((permutation) => res.push(new UnionIntervalNode(permutation, options)));
-        });
-        return res;
-    }
-    toMathString() {
-        return this.toTex();
-    }
-    toMathjs() {
-        return this.toTex();
-    }
-    toTex() {
-        return this.sets.map((set) => set.toTex()).join("\\cup");
-    }
-}
-exports.UnionIntervalNode = UnionIntervalNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UnionIntervalNode = exports.ClosureType = void 0;
+const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const permutations_1 = require("../../../utils/permutations");
+const node_1 = require("../node");
+var ClosureType;
+(function (ClosureType) {
+    ClosureType[ClosureType["FF"] = 0] = "FF";
+    ClosureType[ClosureType["FO"] = 1] = "FO";
+    ClosureType[ClosureType["OF"] = 2] = "OF";
+    ClosureType[ClosureType["OO"] = 3] = "OO";
+})(ClosureType || (exports.ClosureType = ClosureType = {}));
+class UnionIntervalNode {
+    constructor(sets, opts) {
+        this.type = node_1.NodeType.set;
+        this.sets = sets;
+        this.opts = opts;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes(this.opts).map((node) => node.toTex());
+    }
+    toEquivalentNodes(opts) {
+        const options = opts ?? this.opts;
+        const res = [];
+        const equivs = this.sets.map((s) => s.toEquivalentNodes(options));
+        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
+        cartesians.forEach((product) => {
+            const permutations = (0, permutations_1.permute)(product);
+            permutations.forEach((permutation) => res.push(new UnionIntervalNode(permutation, options)));
+        });
+        return res;
+    }
+    toMathString() {
+        return this.toTex();
+    }
+    toMathjs() {
+        return this.toTex();
+    }
+    toTex() {
+        return this.sets.map((set) => set.toTex()).join("\\cup");
+    }
+}
+exports.UnionIntervalNode = UnionIntervalNode;

package/lib/tree/nodes/variables/variableNode.d.ts

@@ -1,13 +1,13 @@
-import { Node, NodeType } from "../node";
-export declare function isVariableNode(a: Node): a is VariableNode;
-export declare class VariableNode implements Node {
-    name: string;
-    type: NodeType;
-    constructor(name: string);
-    toTex(): string;
-    toMathString(): string;
-    toMathjs(): string;
-    toAllValidTexs(): string[];
-    toEquivalentNodes(): this[];
-}
+import { Node, NodeType } from "../node";
+export declare function isVariableNode(a: Node): a is VariableNode;
+export declare class VariableNode implements Node {
+    name: string;
+    type: NodeType;
+    constructor(name: string);
+    toTex(): string;
+    toMathString(): string;
+    toMathjs(): string;
+    toAllValidTexs(): string[];
+    toEquivalentNodes(): this[];
+}
 //# sourceMappingURL=variableNode.d.ts.map

package/lib/tree/nodes/variables/variableNode.js

@@ -1,30 +1,30 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.VariableNode = exports.isVariableNode = void 0;
-const node_1 = require("../node");
-function isVariableNode(a) {
-    return a.type === node_1.NodeType.variable;
-}
-exports.isVariableNode = isVariableNode;
-class VariableNode {
-    constructor(name) {
-        this.type = node_1.NodeType.variable;
-        this.name = name;
-    }
-    toTex() {
-        return `${this.name}`;
-    }
-    toMathString() {
-        return `${this.name}`;
-    }
-    toMathjs() {
-        return this.name;
-    }
-    toAllValidTexs() {
-        return this.toEquivalentNodes().map((node) => node.toTex());
-    }
-    toEquivalentNodes() {
-        return [this];
-    }
-}
-exports.VariableNode = VariableNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.VariableNode = exports.isVariableNode = void 0;
+const node_1 = require("../node");
+function isVariableNode(a) {
+    return a.type === node_1.NodeType.variable;
+}
+exports.isVariableNode = isVariableNode;
+class VariableNode {
+    constructor(name) {
+        this.type = node_1.NodeType.variable;
+        this.name = name;
+    }
+    toTex() {
+        return `${this.name}`;
+    }
+    toMathString() {
+        return `${this.name}`;
+    }
+    toMathjs() {
+        return this.name;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().map((node) => node.toTex());
+    }
+    toEquivalentNodes() {
+        return [this];
+    }
+}
+exports.VariableNode = VariableNode;

package/lib/tree/parsers/derivateParser.js

@@ -1,62 +1,62 @@
-"use strict";
-// import { Node, NodeType } from "../nodes/node";
-// import { NumberNode } from "../nodes/numbers/numberNode";
-// import { PowerNode } from "../nodes/operators/powerNode";
-// import { AddNode } from "../nodes/operators/addNode";
-// import { FractionNode } from "../nodes/operators/fractionNode";
-// import { MultiplyNode } from "../nodes/operators/multiplyNode";
-// import { OperatorIds, OperatorNode } from "../nodes/operators/operatorNode";
-// import { SubstractNode } from "../nodes/operators/substractNode";
-// import { FunctionNode, FunctionsIds } from "../nodes/functions/functionNode";
-// import { SqrtNode } from "../nodes/functions/sqrtNode";
-// import { OppositeNode } from "../nodes/functions/oppositeNode";
-// export function derivateParser(node: Node): Node {
-//   if (!node) throw Error("encountered a null node ??");
-//   switch (node.type) {
-//     case NodeType.variable:
-//       return new NumberNode(1);
-//     case NodeType.number:
-//       return new NumberNode(0);
-//     case NodeType.operator:
-//       const operatorNode = node as OperatorNode;
-//       const u = operatorNode.leftChild;
-//       const v = operatorNode.rightChild;
-//       switch (operatorNode.id) {
-//         case OperatorIds.add:
-//           return new AddNode(derivateParser(u), derivateParser(v));
-//         case OperatorIds.substract: {
-//           return new SubstractNode(derivateParser(u), derivateParser(v));
-//         }
-//         case OperatorIds.multiply: {
-//           return new AddNode(new MultiplyNode(derivateParser(u), v), new MultiplyNode(u, derivateParser(v)));
-//         }
-//         case OperatorIds.divide:
-//         case OperatorIds.fraction:
-//           return new FractionNode(
-//             new SubstractNode(new MultiplyNode(derivateParser(u), v), new MultiplyNode(u, derivateParser(v))),
-//             new PowerNode(v, new NumberNode(2))
-//           );
-//         case OperatorIds.power: {
-//           const operatorNode = node as OperatorNode;
-//           const n = operatorNode.rightChild as NumberNode;
-//           const u = operatorNode.leftChild;
-//           return new MultiplyNode(
-//             n,
-//             new MultiplyNode(derivateParser(u), new PowerNode(u, new NumberNode(n.value - 1)))
-//           );
-//         }
-//       }
-//     case NodeType.function: {
-//       const functionNode = node as FunctionNode;
-//       const child = functionNode.child;
-//       switch (functionNode.id) {
-//         case FunctionsIds.sqrt: {
-//           return new FractionNode(derivateParser(child), new MultiplyNode(new NumberNode(2), new SqrtNode(child)));
-//         }
-//         case FunctionsIds.opposite: {
-//           return new OppositeNode(derivateParser(child));
-//         }
-//       }
-//     }
-//   }
-// }
+"use strict";
+// import { Node, NodeType } from "../nodes/node";
+// import { NumberNode } from "../nodes/numbers/numberNode";
+// import { PowerNode } from "../nodes/operators/powerNode";
+// import { AddNode } from "../nodes/operators/addNode";
+// import { FractionNode } from "../nodes/operators/fractionNode";
+// import { MultiplyNode } from "../nodes/operators/multiplyNode";
+// import { OperatorIds, OperatorNode } from "../nodes/operators/operatorNode";
+// import { SubstractNode } from "../nodes/operators/substractNode";
+// import { FunctionNode, FunctionsIds } from "../nodes/functions/functionNode";
+// import { SqrtNode } from "../nodes/functions/sqrtNode";
+// import { OppositeNode } from "../nodes/functions/oppositeNode";
+// export function derivateParser(node: Node): Node {
+//   if (!node) throw Error("encountered a null node ??");
+//   switch (node.type) {
+//     case NodeType.variable:
+//       return new NumberNode(1);
+//     case NodeType.number:
+//       return new NumberNode(0);
+//     case NodeType.operator:
+//       const operatorNode = node as OperatorNode;
+//       const u = operatorNode.leftChild;
+//       const v = operatorNode.rightChild;
+//       switch (operatorNode.id) {
+//         case OperatorIds.add:
+//           return new AddNode(derivateParser(u), derivateParser(v));
+//         case OperatorIds.substract: {
+//           return new SubstractNode(derivateParser(u), derivateParser(v));
+//         }
+//         case OperatorIds.multiply: {
+//           return new AddNode(new MultiplyNode(derivateParser(u), v), new MultiplyNode(u, derivateParser(v)));
+//         }
+//         case OperatorIds.divide:
+//         case OperatorIds.fraction:
+//           return new FractionNode(
+//             new SubstractNode(new MultiplyNode(derivateParser(u), v), new MultiplyNode(u, derivateParser(v))),
+//             new PowerNode(v, new NumberNode(2))
+//           );
+//         case OperatorIds.power: {
+//           const operatorNode = node as OperatorNode;
+//           const n = operatorNode.rightChild as NumberNode;
+//           const u = operatorNode.leftChild;
+//           return new MultiplyNode(
+//             n,
+//             new MultiplyNode(derivateParser(u), new PowerNode(u, new NumberNode(n.value - 1)))
+//           );
+//         }
+//       }
+//     case NodeType.function: {
+//       const functionNode = node as FunctionNode;
+//       const child = functionNode.child;
+//       switch (functionNode.id) {
+//         case FunctionsIds.sqrt: {
+//           return new FractionNode(derivateParser(child), new MultiplyNode(new NumberNode(2), new SqrtNode(child)));
+//         }
+//         case FunctionsIds.opposite: {
+//           return new OppositeNode(derivateParser(child));
+//         }
+//       }
+//     }
+//   }
+// }

package/lib/tree/parsers/simplify.d.ts

@@ -1,4 +1 @@
-import { Node } from "../nodes/node";
-export declare const simplifyComplex: (node: Node) => Node;
-export declare const simplifyNode: (node: Node) => Node;
 //# sourceMappingURL=simplify.d.ts.map

package/lib/tree/parsers/simplify.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simplify.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/simplify.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AA0BrC,eAAO,MAAM,eAAe,SAAU,IAAI,KAAG,IAE5C,CAAC;AASF,eAAO,MAAM,YAAY,SAAU,IAAI,KAAG,IAIzC,CAAC"}
+{"version":3,"file":"simplify.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/simplify.ts"],"names":[],"mappings":""}