@pie-framework/math-validation 1.4.2 → 2.0.0-next.20261110063142

package/lib/log.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.logger = void 0;
-const logger = (name) => {
-    if (typeof process !== "undefined" && process.env.NODE_ENV === "test") {
-        const debug = require("debug");
-        return debug(name);
-    }
-    else {
-        return () => { };
-    }
-};
-exports.logger = logger;
-//# sourceMappingURL=log.js.map

package/lib/log.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"log.js","sourceRoot":"","sources":["../src/log.ts"],"names":[],"mappings":";;;AAAO,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,EAAE;IACrC,IAAI,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,KAAK,MAAM,EAAE;QACrE,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAC/B,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;KACpB;SAAM;QACL,OAAO,GAAG,EAAE,GAAE,CAAC,CAAC;KACjB;AACH,CAAC,CAAC;AAPW,QAAA,MAAM,UAOjB"}

package/lib/mathjs.d.ts

@@ -1,3 +0,0 @@
-export declare const mathjs: Partial<import("mathjs").MathJsStatic>;
-export declare const parse: import("mathjs").ParseFunction;
-export declare const replacer: any;

package/lib/mathjs.js

@@ -1,9 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.replacer = exports.parse = exports.mathjs = void 0;
-const mathjs_1 = require("mathjs");
-exports.mathjs = mathjs_1.create(mathjs_1.all, { number: "Fraction" });
-exports.parse = exports.mathjs.parse;
-// @ts-ignore
-exports.replacer = exports.mathjs.replacer;
-//# sourceMappingURL=mathjs.js.map

package/lib/mathjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mathjs.js","sourceRoot":"","sources":["../src/mathjs.ts"],"names":[],"mappings":";;;AAAA,mCAAqC;AACxB,QAAA,MAAM,GAAG,eAAM,CAAC,YAAG,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;AAC3C,aAAK,GAAK,cAAM,OAAC;AAEhC,aAAa;AACA,QAAA,QAAQ,GAAG,cAAM,CAAC,QAAQ,CAAC"}

package/lib/node-sort.js

@@ -1,236 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.sort = exports.sortRelationalNode = exports.flattenNode = void 0;
-const log_1 = require("./log");
-const mathjs_1 = require("./mathjs");
-const m = mathjs_1.mathjs;
-const log = log_1.logger("mv:node-sort");
-//import { string } from "mathjs";
-/**
- * The plan with node sort was to sort all the nodes in an expression where possible
- * This means any commutative operators aka + and *.
- *
- * With symbols sorted - we shoud be able to call `node.equals(other)` and avoid having to call evaluate.
- */
-const newCompare = (a, b) => {
-    // log(a.type);
-    log("[compareNodes]: a:", a.toString(), a.type);
-    log("[compareNodes]: b:", b.toString(), b.type);
-    if (a.isSymbolNode && b.isSymbolNode) {
-        // log(a.name, "> ", b.name);
-        return a.name.localeCompare(b.name);
-    }
-    // both constants - sort by value
-    if (a.isConstantNode && b.isConstantNode) {
-        log("a.value", a.value);
-        log("b.value", b.value);
-        return a.value - b.value; //(b.name);
-    }
-    // constants before any other node
-    if (a.isConstantNode && !b.isConstantNode) {
-        return -1;
-    }
-    if (b.isConstantNode && !a.isConstantNode) {
-        return 1;
-    }
-    // symbolNode before operatorNode
-    if (a.isSymbolNode && (b.isOperatorNode || b.isFunctionNode)) {
-        return -1;
-    }
-    if (b.isSymbolNode && (a.isOperatorNode || b.isFunctionNode)) {
-        return 1;
-    }
-    if (a.isOperatorNode && b.isOperatorNode) {
-        const localeCompareResult = a.args
-            .toString()
-            .localeCompare(b.args.toString());
-        return -localeCompareResult;
-    }
-    if (!a.isFunctionNode && b.isFunctionNode) {
-        return -1;
-    }
-};
-const applySort = (node) => {
-    // log("node: ", node.toString());
-    // log("path: ", path);
-    // log("parent: ", parent);
-    if (node.fn === "add" || node.fn === "multiply") {
-        node.args = node.args.sort(newCompare);
-        node.args = node.args.map(applySort);
-    }
-    return node;
-};
-const firstChildOperator = (args, operator) => {
-    let result = false;
-    args.forEach((arg) => {
-        if (arg.fn === operator) {
-            result = true;
-        }
-        return result;
-    });
-    return result;
-};
-const flattenNode = (node) => {
-    while (node.isParenthesisNode && node.content) {
-        node = node.content;
-    }
-    node = node.transform((currentNode, path, parent) => {
-        if (currentNode.isParenthesisNode &&
-            ((parent === null || parent === void 0 ? void 0 : parent.op) != "*" ||
-                ((parent === null || parent === void 0 ? void 0 : parent.op) == "*" && currentNode.content.op != "+"))) {
-            while (currentNode.isParenthesisNode)
-                currentNode = currentNode.content;
-        }
-        return currentNode;
-    });
-    if (node.fn === "multiply" && node["implicit"]) {
-        node["implicit"] = false;
-    }
-    let resultNode = node;
-    resultNode = resultNode.transform((currentNode, path, parent) => {
-        while (firstChildOperator(currentNode, currentNode.fn) &&
-            !currentNode.isArrayNode) {
-            const flatten = currentNode;
-            flatten.traverse((node, path, parent) => {
-                if ((parent === null || parent === void 0 ? void 0 : parent.fn) === node.fn) {
-                    const indexToRemove = path.replace(/[^0-9]/g, "");
-                    parent.args.splice(+indexToRemove, 1) || [];
-                    let argstoAdd = parent.args;
-                    node.args.forEach((arg) => {
-                        argstoAdd.push(arg);
-                    });
-                    node = new m.OperatorNode(node.op, node.fn, argstoAdd);
-                    if (node.fn === "multiply" && node["implicit"]) {
-                        node["implicit"] = false;
-                    }
-                }
-                return node;
-            });
-        }
-        return currentNode;
-    });
-    resultNode = resultNode.transform((currentNode, path, parent) => {
-        if (currentNode.fn === "multiply" &&
-            firstChildOperator(currentNode.args, "divide")) {
-            let divisionNode = currentNode;
-            if (divisionNode.fn === "multiply" &&
-                firstChildOperator(divisionNode, "divide")) {
-                let newNode;
-                divisionNode = divisionNode.traverse((node, path, parent) => {
-                    if (parent && parent.fn === "multiply" && node.fn === "divide") {
-                        if (node.args[0].isOperatorNode) {
-                            parent.args.forEach((arg) => {
-                                if (!arg.isOperatorNode) {
-                                    node.args[0].args.push(arg);
-                                }
-                            });
-                        }
-                        else {
-                            const newArgs = [];
-                            newArgs.push(node.args[0]);
-                            parent.args.forEach((arg) => {
-                                if (!arg.isOperatorNode) {
-                                    newArgs.push(arg);
-                                }
-                            });
-                            node.args[0] = new m.OperatorNode("*", "multiply", newArgs);
-                        }
-                        newNode = node;
-                    }
-                });
-                return newNode;
-            }
-        }
-        else {
-            currentNode = currentNode;
-        }
-        return currentNode;
-    });
-    return resultNode;
-};
-exports.flattenNode = flattenNode;
-const sortRelationalNode = (node) => {
-    log("THIS IS THE START ++++", JSON.stringify(node));
-    const smaller = ["smaller", "smallerEq"];
-    const bigger = ["larger", "largerEq"];
-    const resultNode = node.transform((node, path, parent) => {
-        let reverse = false;
-        if (node.conditionals) {
-            const smallerAndBigger = smaller.some((small) => node.conditionals.includes(small)) &&
-                bigger.some((big) => node.conditionals.includes(big));
-            if (node.conditionals.includes("equal")) {
-                node.params.sort(newCompare);
-            }
-            else if (smallerAndBigger && node.params) {
-                if (newCompare(node.params[0], node.params[node.params.length - 1]) > -1) {
-                    node.params.reverse();
-                }
-            }
-            else {
-                node.conditionals = node.conditionals.map((cond) => {
-                    if (cond === "smaller") {
-                        reverse = true;
-                        cond = "larger";
-                    }
-                    else if (cond === "smallerEq") {
-                        reverse = true;
-                        cond = "largerEq";
-                    }
-                    return cond;
-                });
-            }
-        }
-        if (node.params && reverse) {
-            node.conditionals.reverse();
-            node.params.reverse();
-        }
-        if (parent && parent.type === "RelationalNode" && node.args) {
-            node = exports.sort(node);
-        }
-        return node;
-    });
-    return resultNode;
-};
-exports.sortRelationalNode = sortRelationalNode;
-const sort = (node) => {
-    let resultNode = node;
-    if (node.type === "RelationalNode") {
-        return exports.sortRelationalNode(node);
-    }
-    if (node.isOperatorNode && node.fn === "smaller") {
-        node.op = ">";
-        node.fn = "larger";
-        node.args = node.args.reverse();
-    }
-    if (node.isOperatorNode && node.fn === "smallerEq") {
-        node.op = ">=";
-        node.fn = "largerEq";
-        node.args = node.args.reverse();
-    }
-    const relationOperators = "=|NE|≃|≈|≈|≉|~|≃|≁|≅|≆";
-    if (node.isFunctionNode &&
-        // @ts-ignore
-        node.fn.name.match(relationOperators)) {
-        node.args = node.args.sort(newCompare);
-    }
-    if (node.isOperatorNode &&
-        (node.fn == "larger" ||
-            node.fn == "largerEq" ||
-            node.fn == "equal" ||
-            node.fn == "unequal")) {
-        node.args = node.args.map(exports.sort);
-        if (node.fn === "equal" || node.fn === "unequal") {
-            node.args = node.args.sort(newCompare);
-        }
-    }
-    if (node.isArrayNode) {
-        // @ts-ignore
-        node.items = node.items.sort(newCompare);
-        return node;
-    }
-    const flattened = exports.flattenNode(node);
-    resultNode = flattened.transform(applySort);
-    return resultNode;
-};
-exports.sort = sort;
-//# sourceMappingURL=node-sort.js.map

package/lib/node-sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"node-sort.js","sourceRoot":"","sources":["../src/node-sort.ts"],"names":[],"mappings":";;;AAAA,+BAA+B;AAE/B,qCAAyC;AAIzC,MAAM,CAAC,GAAQ,eAAG,CAAC;AAEnB,MAAM,GAAG,GAAG,YAAM,CAAC,cAAc,CAAC,CAAC;AAEnC,kCAAkC;AAClC;;;;;GAKG;AAEH,MAAM,UAAU,GAAG,CAAC,CAAW,EAAE,CAAW,EAAU,EAAE;IACtD,eAAe;IACf,GAAG,CAAC,oBAAoB,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAChD,GAAG,CAAC,oBAAoB,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAEhD,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,YAAY,EAAE;QACpC,6BAA6B;QAC7B,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;KACrC;IAED,iCAAiC;IACjC,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,EAAE;QACxC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACxB,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW;KACtC;IAED,kCAAkC;IAClC,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,CAAC,cAAc,EAAE;QACzC,OAAO,CAAC,CAAC,CAAC;KACX;IAED,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,CAAC,cAAc,EAAE;QACzC,OAAO,CAAC,CAAC;KACV;IAED,iCAAiC;IACjC,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,CAAC,EAAE;QAC5D,OAAO,CAAC,CAAC,CAAC;KACX;IAED,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,CAAC,EAAE;QAC5D,OAAO,CAAC,CAAC;KACV;IAED,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,EAAE;QACxC,MAAM,mBAAmB,GAAG,CAAC,CAAC,IAAI;aAC/B,QAAQ,EAAE;aACV,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QAEpC,OAAO,CAAC,mBAAmB,CAAC;KAC7B;IAED,IAAI,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,EAAE;QACzC,OAAO,CAAC,CAAC,CAAC;KACX;AACH,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,IAAc,EAAE,EAAE;IACnC,kCAAkC;IAClC,uBAAuB;IACvB,2BAA2B;IAC3B,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC,EAAE,KAAK,UAAU,EAAE;QAC/C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;KACtC;IAED,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,IAAS,EAAE,QAAgB,EAAE,EAAE;IACzD,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;QACnB,IAAI,GAAG,CAAC,EAAE,KAAK,QAAQ,EAAE;YACvB,MAAM,GAAG,IAAI,CAAC;SACf;QAED,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEK,MAAM,WAAW,GAAG,CAAC,IAAc,EAAE,EAAE;IAC5C,OAAO,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,OAAO,EAAE;QAC7C,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;KACrB;IAED,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;QAClD,IACE,WAAW,CAAC,iBAAiB;YAC7B,CAAC,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,KAAI,GAAG;gBAChB,CAAC,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,KAAI,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,EACvD;YACA,OAAO,WAAW,CAAC,iBAAiB;gBAAE,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC;SACzE;QAED,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,IAAI,IAAI,CAAC,EAAE,KAAK,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE;QAC9C,IAAI,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC;KAC1B;IAED,IAAI,UAAU,GAAG,IAAI,CAAC;IAEtB,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;QAC9D,OACE,kBAAkB,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC;YAC/C,CAAC,WAAW,CAAC,WAAW,EACxB;YACA,MAAM,OAAO,GAAG,WAAW,CAAC;YAE5B,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;gBACtC,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,EAAE,MAAK,IAAI,CAAC,EAAE,EAAE;oBAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;oBAElD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;oBAE5C,IAAI,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC;oBAE5B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;wBACxB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACtB,CAAC,CAAC,CAAC;oBAEH,IAAI,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;oBAEvD,IAAI,IAAI,CAAC,EAAE,KAAK,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE;wBAC9C,IAAI,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC;qBAC1B;iBACF;gBACD,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;SACJ;QAED,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;QAC9D,IACE,WAAW,CAAC,EAAE,KAAK,UAAU;YAC7B,kBAAkB,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,EAC9C;YACA,IAAI,YAAY,GAAG,WAAW,CAAC;YAE/B,IACE,YAAY,CAAC,EAAE,KAAK,UAAU;gBAC9B,kBAAkB,CAAC,YAAY,EAAE,QAAQ,CAAC,EAC1C;gBACA,IAAI,OAAiB,CAAC;gBACtB,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;oBAC1D,IAAI,MAAM,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ,EAAE;wBAC9D,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE;4BAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;gCAC1B,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE;oCACvB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;iCAC7B;4BACH,CAAC,CAAC,CAAC;yBACJ;6BAAM;4BACL,MAAM,OAAO,GAAG,EAAE,CAAC;4BAEnB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;4BAE3B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;gCAC1B,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE;oCACvB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;iCACnB;4BACH,CAAC,CAAC,CAAC;4BAEH,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;yBAC7D;wBACD,OAAO,GAAG,IAAI,CAAC;qBAChB;gBACH,CAAC,CAAC,CAAC;gBACH,OAAO,OAAO,CAAC;aAChB;SACF;aAAM;YACL,WAAW,GAAG,WAAW,CAAC;SAC3B;QAED,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AArGW,QAAA,WAAW,eAqGtB;AAEK,MAAM,kBAAkB,GAAG,CAAC,IAAS,EAAE,EAAE;IAC9C,GAAG,CAAC,wBAAwB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAEpD,MAAM,OAAO,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAEtC,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;QACvD,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,IAAI,IAAI,CAAC,YAAY,EAAE;YACrB,MAAM,gBAAgB,GACpB,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC1D,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAExD,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE;gBACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;aAC9B;iBAAM,IAAI,gBAAgB,IAAI,IAAI,CAAC,MAAM,EAAE;gBAC1C,IACE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE;oBACA,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;iBACvB;aACF;iBAAM;gBACL,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAS,EAAE,EAAE;oBACtD,IAAI,IAAI,KAAK,SAAS,EAAE;wBACtB,OAAO,GAAG,IAAI,CAAC;wBACf,IAAI,GAAG,QAAQ,CAAC;qBACjB;yBAAM,IAAI,IAAI,KAAK,WAAW,EAAE;wBAC/B,OAAO,GAAG,IAAI,CAAC;wBACf,IAAI,GAAG,UAAU,CAAC;qBACnB;oBAED,OAAO,IAAI,CAAC;gBACd,CAAC,CAAC,CAAC;aACJ;SACF;QAED,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,EAAE;YAC1B,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SACvB;QAED,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,EAAE;YAC3D,IAAI,GAAG,YAAI,CAAC,IAAI,CAAC,CAAC;SACnB;QAED,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAlDW,QAAA,kBAAkB,sBAkD7B;AAEK,MAAM,IAAI,GAAG,CAAC,IAAc,EAAE,EAAE;IACrC,IAAI,UAAU,GAAG,IAAI,CAAC;IAEtB,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE;QAClC,OAAO,0BAAkB,CAAC,IAAI,CAAC,CAAC;KACjC;IAED,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE;QAChD,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;QACd,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;KACjC;IAED,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,EAAE,KAAK,WAAW,EAAE;QAClD,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;QACf,IAAI,CAAC,EAAE,GAAG,UAAU,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;KACjC;IAED,MAAM,iBAAiB,GAAG,wBAAwB,CAAC;IAEnD,IACE,IAAI,CAAC,cAAc;QACnB,aAAa;QACb,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,EACrC;QACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;KACxC;IAED,IACE,IAAI,CAAC,cAAc;QACnB,CAAC,IAAI,CAAC,EAAE,IAAI,QAAQ;YAClB,IAAI,CAAC,EAAE,IAAI,UAAU;YACrB,IAAI,CAAC,EAAE,IAAI,OAAO;YAClB,IAAI,CAAC,EAAE,IAAI,SAAS,CAAC,EACvB;QACA,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,YAAI,CAAC,CAAC;QAEhC,IAAI,IAAI,CAAC,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE;YAChD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SACxC;KACF;IAED,IAAI,IAAI,CAAC,WAAW,EAAE;QACpB,aAAa;QACb,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;KACb;IAED,MAAM,SAAS,GAAG,mBAAW,CAAC,IAAI,CAAC,CAAC;IAEpC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IAE5C,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAtDW,QAAA,IAAI,QAsDf"}

package/lib/symbolic/compare-compound-inequations.js

@@ -1,68 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.compareCompoundInequations = exports.getLimit = exports.splitInequality = void 0;
-const mathjs_1 = require("../mathjs");
-const utils_1 = require("./utils");
-const m = mathjs_1.mathjs;
-const operation = (signName) => {
-    switch (signName) {
-        case "smaller":
-            return "<";
-        case "smallerEq":
-            return "<=";
-        case "larger":
-            return ">";
-        case "largerEq":
-            return ">=";
-        case "equal":
-            return "==";
-        case "unequal":
-            return "!=";
-    }
-};
-// splitInequality takes in a RelationalNode with 2 conditionals and 3 params and returns 2 operatorNodes each containing a 2-way inequality
-const splitInequality = (compoundInequality) => ({
-    left: new m.OperatorNode(operation(compoundInequality.conditionals[0]), compoundInequality.conditionals[0], [compoundInequality.params[0], compoundInequality.params[1]]),
-    right: new m.OperatorNode(operation(compoundInequality.conditionals[1]), compoundInequality.conditionals[1], [compoundInequality.params[1], compoundInequality.params[2]]),
-});
-exports.splitInequality = splitInequality;
-// get interval inferior/superior limits
-const getLimit = (expressionsPair, limitType) => {
-    const expressionR = utils_1.transformEqualityInExpression(expressionsPair.right);
-    const expressionL = utils_1.transformEqualityInExpression(expressionsPair.left);
-    const xFirstInequality = utils_1.solveLinearEquation(utils_1.getCoefficients(expressionR, true));
-    const xSecondInequality = utils_1.solveLinearEquation(utils_1.getCoefficients(expressionL, true));
-    if (limitType === "inferior") {
-        return Math.min(xFirstInequality, xSecondInequality);
-    }
-    return Math.max(xFirstInequality, xSecondInequality);
-};
-exports.getLimit = getLimit;
-const compareCompoundInequations = (firstInequation, secondInequation) => {
-    if (!utils_1.expressionsCanBeCompared(firstInequation, secondInequation)) {
-        return false;
-    }
-    const firstInequalityVariablesName = utils_1.getVariables(firstInequation);
-    const secondInequalityVariablesName = utils_1.getVariables(secondInequation);
-    if (!utils_1.equationsHaveTheSameVariables(firstInequalityVariablesName, secondInequalityVariablesName) &&
-        (firstInequalityVariablesName === null || firstInequalityVariablesName === void 0 ? void 0 : firstInequalityVariablesName.length) === 1) {
-        return false;
-    }
-    const firstInequalities = exports.splitInequality(firstInequation);
-    const secondInequalities = exports.splitInequality(secondInequation);
-    // find out interval for inequality solution;
-    // it does not matter whether we have an open, or half-open/half-close interval, the signs are already compared and at this point they match
-    let firstInequalitiesSolution = {
-        min: exports.getLimit(firstInequalities, "inferior"),
-        max: exports.getLimit(firstInequalities, "superior"),
-    };
-    let secondInequalitiesSolution = {
-        min: exports.getLimit(secondInequalities, "inferior"),
-        max: exports.getLimit(secondInequalities, "superior"),
-    };
-    // if interval limits are the same for both inequalities then we can say that inequalities are equivalent
-    return (firstInequalitiesSolution.min === secondInequalitiesSolution.min &&
-        firstInequalitiesSolution.max === secondInequalitiesSolution.max);
-};
-exports.compareCompoundInequations = compareCompoundInequations;
-//# sourceMappingURL=compare-compound-inequations.js.map

package/lib/symbolic/compare-compound-inequations.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"compare-compound-inequations.js","sourceRoot":"","sources":["../../src/symbolic/compare-compound-inequations.ts"],"names":[],"mappings":";;;AAAA,sCAAmC;AAEnC,mCAOiB;AAEjB,MAAM,CAAC,GAAQ,eAAM,CAAC;AAYtB,MAAM,SAAS,GAAG,CAAC,QAAgB,EAAE,EAAE;IACrC,QAAQ,QAAQ,EAAE;QAChB,KAAK,SAAS;YACZ,OAAO,GAAG,CAAC;QACb,KAAK,WAAW;YACd,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,UAAU;YACb,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,IAAI,CAAC;QACd,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;KACf;AACH,CAAC,CAAC;AAEF,4IAA4I;AACrI,MAAM,eAAe,GAAG,CAAC,kBAAuB,EAAY,EAAE,CAAC,CAAC;IACrE,IAAI,EAAE,IAAI,CAAC,CAAC,YAAY,CACtB,SAAS,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAC7C,kBAAkB,CAAC,YAAY,CAAC,CAAC,CAAC,EAClC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAC7D;IACD,KAAK,EAAE,IAAI,CAAC,CAAC,YAAY,CACvB,SAAS,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAC7C,kBAAkB,CAAC,YAAY,CAAC,CAAC,CAAC,EAClC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAC7D;CACF,CAAC,CAAC;AAXU,QAAA,eAAe,mBAWzB;AAEH,wCAAwC;AACjC,MAAM,QAAQ,GAAG,CACtB,eAAyB,EACzB,SAAiB,EACT,EAAE;IACV,MAAM,WAAW,GAAG,qCAA6B,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;IACzE,MAAM,WAAW,GAAG,qCAA6B,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAExE,MAAM,gBAAgB,GAAG,2BAAmB,CAAC,uBAAe,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;IACjF,MAAM,iBAAiB,GAAG,2BAAmB,CAAC,uBAAe,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;IAElF,IAAI,SAAS,KAAK,UAAU,EAAE;QAC5B,OAAO,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;KACtD;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;AACvD,CAAC,CAAC;AAfW,QAAA,QAAQ,YAenB;AAEK,MAAM,0BAA0B,GAAG,CACxC,eAAoB,EACpB,gBAAqB,EACrB,EAAE;IAEF,IAAI,CAAC,gCAAwB,CAAC,eAAe,EAAE,gBAAgB,CAAC,EAAE;QAChE,OAAO,KAAK,CAAC;KACd;IAED,MAAM,4BAA4B,GAAG,oBAAY,CAAC,eAAe,CAAC,CAAC;IACnE,MAAM,6BAA6B,GAAG,oBAAY,CAAC,gBAAgB,CAAC,CAAC;IAErE,IACE,CAAC,qCAA6B,CAC5B,4BAA4B,EAC5B,6BAA6B,CAC9B;QACD,CAAA,4BAA4B,aAA5B,4BAA4B,uBAA5B,4BAA4B,CAAE,MAAM,MAAK,CAAC,EAC1C;QACA,OAAO,KAAK,CAAC;KACd;IAED,MAAM,iBAAiB,GAAG,uBAAe,CAAC,eAAe,CAAC,CAAC;IAC3D,MAAM,kBAAkB,GAAG,uBAAe,CAAC,gBAAgB,CAAC,CAAC;IAE7D,6CAA6C;IAC7C,4IAA4I;IAC5I,IAAI,yBAAyB,GAAU;QACrC,GAAG,EAAE,gBAAQ,CAAC,iBAAiB,EAAE,UAAU,CAAC;QAC5C,GAAG,EAAE,gBAAQ,CAAC,iBAAiB,EAAE,UAAU,CAAC;KAC7C,CAAC;IAEF,IAAI,0BAA0B,GAAU;QACtC,GAAG,EAAE,gBAAQ,CAAC,kBAAkB,EAAE,UAAU,CAAC;QAC7C,GAAG,EAAE,gBAAQ,CAAC,kBAAkB,EAAE,UAAU,CAAC;KAC9C,CAAC;IAEF,yGAAyG;IACzG,OAAO,CACL,yBAAyB,CAAC,GAAG,KAAK,0BAA0B,CAAC,GAAG;QAChE,yBAAyB,CAAC,GAAG,KAAK,0BAA0B,CAAC,GAAG,CACjE,CAAC;AACJ,CAAC,CAAC;AA1CW,QAAA,0BAA0B,8BA0CrC"}

package/lib/symbolic/compare-equations.js

@@ -1,108 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.compareEquations = void 0;
-const mathjs_1 = require("../mathjs");
-const utils_1 = require("./utils");
-const m = mathjs_1.mathjs;
-const compareCoefficients = (firstEqCoeff, secondEqCoeff) => Array.isArray(firstEqCoeff) &&
-    Array.isArray(secondEqCoeff) &&
-    firstEqCoeff.length === secondEqCoeff.length &&
-    firstEqCoeff.every((val, index) => val === secondEqCoeff[index]);
-const compareEquations = (firstEquation, secondEquation, isInequality) => {
-    let equivalence = false;
-    if (utils_1.expressionsCanBeCompared(firstEquation, secondEquation)) {
-        let firstExpression = utils_1.transformEqualityInExpression(firstEquation);
-        let secondExpression = utils_1.transformEqualityInExpression(secondEquation);
-        if (firstExpression.equals(secondExpression)) {
-            return true;
-        }
-        let firstEquationVariablesName = utils_1.getVariables(firstExpression);
-        let secondEquationVariablesName = utils_1.getVariables(secondExpression);
-        if (!utils_1.equationsHaveTheSameVariables(firstEquationVariablesName, secondEquationVariablesName)) {
-            return false;
-        }
-        let firstEquationCoefficients;
-        let secondEquationCoefficients;
-        if (utils_1.hasSymbolicExponent(firstExpression) ||
-            utils_1.hasSymbolicExponent(secondExpression)) {
-            const isEquivalent = utils_1.areNumericallyEquivalent(firstExpression, secondExpression, firstEquationVariablesName);
-            return isEquivalent;
-        }
-        if (firstEquationVariablesName.length === 1) {
-            firstEquationCoefficients = utils_1.getCoefficients(firstExpression, isInequality);
-            secondEquationCoefficients = utils_1.getCoefficients(secondExpression, isInequality);
-            // if coefficients are equal, there is no need for further calculations => equations are equivalent
-            if (compareCoefficients(firstEquationCoefficients, secondEquationCoefficients)) {
-                return true;
-            }
-            // check for second-order polynomial equation such as ax^2 + bx + c = 0 where a is not zero
-            if ((firstEquationCoefficients.length === 3 &&
-                secondEquationCoefficients.length === 3 &&
-                !isInequality &&
-                firstEquationCoefficients[0] !== 0) ||
-                (firstEquationCoefficients.length === 4 &&
-                    firstEquationCoefficients[0] === 0 &&
-                    secondEquationCoefficients[0] === 0)) {
-                if (firstEquationCoefficients[0] === 0) {
-                    firstEquationCoefficients = firstEquationCoefficients.splice(1, 3);
-                    secondEquationCoefficients = secondEquationCoefficients.splice(1, 3);
-                }
-                let rootsFirstEquation = utils_1.solveQuadraticEquation(firstEquationCoefficients);
-                let rootsSecondEquation = utils_1.solveQuadraticEquation(secondEquationCoefficients);
-                let firstRoot = m.complex(rootsFirstEquation);
-                let secondRoot = m.complex(rootsSecondEquation);
-                if (rootsFirstEquation[0].im === 0 && rootsFirstEquation[1].im === 0) {
-                    return ((firstRoot[0].equals(secondRoot[0]) &&
-                        firstRoot[1].equals(secondRoot[1])) ||
-                        (firstRoot[0].equals(secondRoot[1]) &&
-                            firstRoot[1].equals(secondRoot[0])));
-                }
-                //@ts-ignore
-                return (rootsFirstEquation[0].re === rootsSecondEquation[0].re &&
-                    rootsFirstEquation[1].re === rootsSecondEquation[1].re &&
-                    rootsFirstEquation[0].im.toFixed(13) ===
-                        rootsSecondEquation[0].im.toFixed(13) &&
-                    rootsFirstEquation[1].im.toFixed(13) ===
-                        rootsSecondEquation[1].im.toFixed(13));
-            }
-            // if both equations are linear in one variable then we solve "x" for both. If x has the same value then equations are equivalent
-            // solve linear equations
-            const solutionForFirstEquation = utils_1.solveLinearEquation(firstEquationCoefficients);
-            const solutionForSecondEquation = utils_1.solveLinearEquation(secondEquationCoefficients);
-            equivalence =
-                solutionForFirstEquation === solutionForSecondEquation &&
-                    solutionForFirstEquation !== undefined;
-        }
-        // if both equations are linear in two variabled then we give value "1" for both "x". Doing this we get a linear equation in one variable "y". Then we solve "y" for both. If y has the same value then equations are equivalent
-        if (firstEquationVariablesName.length === 2) {
-            let x = firstEquationVariablesName[0];
-            // solve expression for x=1
-            let expraNoX = utils_1.setXToOne(firstExpression, x);
-            firstEquationCoefficients = utils_1.getCoefficients(expraNoX, isInequality);
-            let exprbNoX = utils_1.setXToOne(secondExpression, x);
-            secondEquationCoefficients = utils_1.getCoefficients(exprbNoX, isInequality);
-            // find y for both equations, where x equals 1
-            let yFromFirstExpression = utils_1.solveLinearEquation(firstEquationCoefficients);
-            let yFromSecondExpression = utils_1.solveLinearEquation(secondEquationCoefficients);
-            // if y has the same value, for the same x then the expressions should be equivalent
-            equivalence = yFromFirstExpression === yFromSecondExpression;
-        }
-        // determine equivalence between 2-way inequalities with 1 or 2 variables:
-        // we treat 2-way inequalities the same way as linear equations in 1 or 2 variables; we find out the solutions that solve the inequality then compare them
-        // we have one distinct case, when multiplying both parts of an inequality with a negative number, the sign must change direction
-        if (equivalence && isInequality) {
-            // check if direction should be changed
-            return !((m.isPositive(firstEquationCoefficients[0]) &&
-                m.isNegative(firstEquationCoefficients[1]) &&
-                m.isNegative(secondEquationCoefficients[0]) &&
-                m.isPositive(secondEquationCoefficients[1])) ||
-                (m.isNegative(firstEquationCoefficients[0]) &&
-                    m.isPositive(firstEquationCoefficients[1]) &&
-                    m.isPositive(secondEquationCoefficients[0]) &&
-                    m.isNegative(secondEquationCoefficients[1])));
-        }
-    }
-    return equivalence;
-};
-exports.compareEquations = compareEquations;
-//# sourceMappingURL=compare-equations.js.map

package/lib/symbolic/compare-equations.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"compare-equations.js","sourceRoot":"","sources":["../../src/symbolic/compare-equations.ts"],"names":[],"mappings":";;;AAAA,sCAAmC;AAEnC,mCAWiB;AAEjB,MAAM,CAAC,GAAQ,eAAM,CAAC;AAEtB,MAAM,mBAAmB,GAAG,CAAC,YAAsB,EAAE,aAAuB,EAAE,EAAE,CAC9E,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC;IAC5B,YAAY,CAAC,MAAM,KAAK,aAAa,CAAC,MAAM;IAC5C,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;AAE5D,MAAM,gBAAgB,GAAG,CAC9B,aAAuB,EACvB,cAAwB,EACxB,YAAqB,EACrB,EAAE;IACF,IAAI,WAAW,GAAY,KAAK,CAAC;IAEjC,IAAI,gCAAwB,CAAC,aAAa,EAAE,cAAc,CAAC,EAAE;QAC3D,IAAI,eAAe,GAAG,qCAA6B,CAAC,aAAa,CAAC,CAAC;QACnE,IAAI,gBAAgB,GAAG,qCAA6B,CAAC,cAAc,CAAC,CAAC;QAErE,IAAI,eAAe,CAAC,MAAM,CAAC,gBAAgB,CAAC,EAAE;YAC5C,OAAO,IAAI,CAAC;SACb;QAED,IAAI,0BAA0B,GAAG,oBAAY,CAAC,eAAe,CAAC,CAAC;QAC/D,IAAI,2BAA2B,GAAG,oBAAY,CAAC,gBAAgB,CAAC,CAAC;QAEjE,IACE,CAAC,qCAA6B,CAC5B,0BAA0B,EAC1B,2BAA2B,CAC5B,EACD;YACA,OAAO,KAAK,CAAC;SACd;QAED,IAAI,yBAAmC,CAAC;QACxC,IAAI,0BAAoC,CAAC;QAEzC,IACE,2BAAmB,CAAC,eAAe,CAAC;YACpC,2BAAmB,CAAC,gBAAgB,CAAC,EACrC;YACA,MAAM,YAAY,GAAG,gCAAwB,CAC3C,eAAe,EACf,gBAAgB,EAChB,0BAA0B,CAC3B,CAAC;YAEF,OAAO,YAAY,CAAC;SACrB;QAED,IAAI,0BAA0B,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3C,yBAAyB,GAAG,uBAAe,CACzC,eAAe,EACf,YAAY,CACb,CAAC;YACF,0BAA0B,GAAG,uBAAe,CAC1C,gBAAgB,EAChB,YAAY,CACb,CAAC;YAEF,mGAAmG;YACnG,IACE,mBAAmB,CACjB,yBAAyB,EACzB,0BAA0B,CAC3B,EACD;gBACA,OAAO,IAAI,CAAC;aACb;YAED,2FAA2F;YAC3F,IACE,CAAC,yBAAyB,CAAC,MAAM,KAAK,CAAC;gBACrC,0BAA0B,CAAC,MAAM,KAAK,CAAC;gBACvC,CAAC,YAAY;gBACb,yBAAyB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrC,CAAC,yBAAyB,CAAC,MAAM,KAAK,CAAC;oBACrC,yBAAyB,CAAC,CAAC,CAAC,KAAK,CAAC;oBAClC,0BAA0B,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EACtC;gBACA,IAAI,yBAAyB,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;oBACtC,yBAAyB,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnE,0BAA0B,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBACtE;gBAED,IAAI,kBAAkB,GAAG,8BAAsB,CAC7C,yBAAyB,CAC1B,CAAC;gBAEF,IAAI,mBAAmB,GAAG,8BAAsB,CAC9C,0BAA0B,CAC3B,CAAC;gBAEF,IAAI,SAAS,GAAa,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;gBACxD,IAAI,UAAU,GAAa,CAAC,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAC;gBAE1D,IAAI,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE;oBACpE,OAAO,CACL,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;wBACjC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;wBACrC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;4BACjC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CACtC,CAAC;iBACH;gBAED,YAAY;gBACZ,OAAO,CACL,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;wBAClC,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;oBACvC,kBAAkB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;wBAClC,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CACxC,CAAC;aACH;YAED,iIAAiI;YACjI,yBAAyB;YACzB,MAAM,wBAAwB,GAAG,2BAAmB,CAClD,yBAAyB,CAC1B,CAAC;YACF,MAAM,yBAAyB,GAAG,2BAAmB,CACnD,0BAA0B,CAC3B,CAAC;YAEF,WAAW;gBACT,wBAAwB,KAAK,yBAAyB;oBACtD,wBAAwB,KAAK,SAAS,CAAC;SAC1C;QAED,gOAAgO;QAChO,IAAI,0BAA0B,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3C,IAAI,CAAC,GAAG,0BAA0B,CAAC,CAAC,CAAC,CAAC;YAEtC,2BAA2B;YAC3B,IAAI,QAAQ,GAAG,iBAAS,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;YAC7C,yBAAyB,GAAG,uBAAe,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAEpE,IAAI,QAAQ,GAAG,iBAAS,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;YAC9C,0BAA0B,GAAG,uBAAe,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAErE,8CAA8C;YAC9C,IAAI,oBAAoB,GAAG,2BAAmB,CAAC,yBAAyB,CAAC,CAAC;YAC1E,IAAI,qBAAqB,GAAG,2BAAmB,CAC7C,0BAA0B,CAC3B,CAAC;YAEF,oFAAoF;YACpF,WAAW,GAAG,oBAAoB,KAAK,qBAAqB,CAAC;SAC9D;QAED,0EAA0E;QAC1E,0JAA0J;QAC1J,iIAAiI;QACjI,IAAI,WAAW,IAAI,YAAY,EAAE;YAC/B,uCAAuC;YACvC,OAAO,CAAC,CACN,CAAC,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;gBAC1C,CAAC,CAAC,UAAU,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC,CAAC,UAAU,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9C,CAAC,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;oBACzC,CAAC,CAAC,UAAU,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;oBAC1C,CAAC,CAAC,UAAU,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC;oBAC3C,CAAC,CAAC,UAAU,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC,CAAC,CAC/C,CAAC;SACH;KACF;IAED,OAAO,WAAW,CAAC;AACrB,CAAC,CAAC;AAnKW,QAAA,gBAAgB,oBAmK3B"}

package/lib/symbolic/index.d.ts

@@ -1,4 +0,0 @@
-import { MathNode } from "mathjs";
-export declare type SymbolicOpts = {};
-export declare const simplify: (v: any) => MathNode;
-export declare const isMathEqual: (a: any, b: any) => any;