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

package/dist/latex-equal.d.ts

@@ -0,0 +1,2 @@
+import type { Latex, Opts } from './options.js';
+export declare const latexEqual: (a: Latex, b: Latex, opts: Opts) => boolean;

package/dist/literal/index.d.ts

@@ -0,0 +1,3 @@
+import type { MathNode } from 'mathjs';
+import type { LiteralOpts } from '../options.js';
+export declare const isMathEqual: (a: MathNode, b: MathNode, opts?: LiteralOpts) => boolean;

package/dist/log.d.ts

@@ -0,0 +1 @@
+export declare const logger: (name: string) => ((...args: unknown[]) => void);

package/dist/mathjs.d.ts

@@ -0,0 +1,11 @@
+import { type MathJsStatic } from 'mathjs';
+export declare const mathjs: MathJsStatic & {
+    replacer: (key: string, value: unknown) => unknown;
+};
+export declare const parse: import("mathjs").ParseFunction;
+export declare const replacer: (key: string, value: unknown) => unknown;
+export declare const numeric: MathJsStatic;
+export declare const TRAILING_ZEROS_RULE: Readonly<{
+    l: "tzn(n1, n2)";
+    r: "n1";
+}>;

package/{lib → dist}/node-sort.d.ts

@@ -1,4 +1,4 @@
-import { MathNode } from "mathjs";
+import type { MathNode } from 'mathjs';
 export declare const flattenNode: (node: MathNode) => MathNode;
 export declare const sortRelationalNode: (node: any) => any;
 export declare const sort: (node: MathNode) => any;

package/dist/options.d.ts

@@ -0,0 +1,13 @@
+export type Latex = string;
+export type Mode = 'symbolic' | 'literal';
+export type LiteralOpts = {
+    allowTrailingZeros?: boolean;
+    ignoreOrder?: boolean;
+    /** A single number matches only a single number of equal value, so `4/6` matches `2/3` and `3+3` doesn't match `6`. */
+    compareNumbersByValue?: boolean;
+};
+/** Symbolic mode takes no options. */
+export type Opts = {
+    mode?: Mode;
+    literal?: LiteralOpts;
+};

package/{lib → dist}/symbolic/compare-compound-inequations.d.ts

@@ -1,4 +1,4 @@
-import { MathNode } from "mathjs";
+import type { MathNode } from 'mathjs';
 export type NodePair = {
     left: MathNode;
     right: MathNode;
@@ -8,5 +8,5 @@ export type Range = {
     max: number;
 };
 export declare const splitInequality: (compoundInequality: any) => NodePair;
-export declare const getLimit: (expressionsPair: NodePair, limitType: string) => number;
+export declare const getInterval: ({ left, right }: NodePair) => Range;
 export declare const compareCompoundInequations: (firstInequation: any, secondInequation: any) => boolean;

package/{lib → dist}/symbolic/compare-equations.d.ts

@@ -1,2 +1,2 @@
-import { MathNode } from "mathjs";
+import type { MathNode } from 'mathjs';
 export declare const compareEquations: (firstEquation: MathNode, secondEquation: MathNode, isInequality: boolean) => any;

package/dist/symbolic/index.d.ts

@@ -0,0 +1 @@
+export declare const isMathEqual: (a: any, b: any) => any;

package/dist/symbolic/simplify.d.ts

@@ -0,0 +1,2 @@
+import type { MathNode } from 'mathjs';
+export declare const simplify: (v: MathNode | string) => MathNode;

package/{lib → dist}/symbolic/utils.d.ts

@@ -1,4 +1,4 @@
-import { MathNode } from "mathjs";
+import type { MathNode } from 'mathjs';
 export declare const expressionsCanBeCompared: (firstEquation: MathNode, secondEquation: MathNode) => boolean;
 export declare const hasSymbolicExponent: (node: MathNode) => boolean;
 export declare const getSamplePoints: (variables: string[], count?: number) => Record<string, number>[];
@@ -14,5 +14,5 @@ export declare const solveQuadraticEquation: (coefficients: number[]) => {
     re: any;
     im: number;
 }[];
-export declare const solveLinearEquation: (coefficients: number[]) => number;
-export declare const equationsHaveTheSameVariables: (firstEquationVariables: string[], secondEquationVariables: string[]) => boolean;
+export declare const solveLinearEquation: (coefficients: number[]) => number | undefined;
+export declare const haveSameElements: <T>(first: T[], second: T[]) => boolean;

package/dist/value.d.ts

@@ -0,0 +1,6 @@
+import type { Latex } from './options.js';
+/**
+ * Compares by value when either side is a single number: equal when both are and their values are
+ * equal, unequal when only one is. Undefined when neither is, which leaves the comparison to the mode.
+ */
+export declare const compareNumbers: (a: Latex, b: Latex) => boolean | undefined;

package/package.json

@@ -1,71 +1,43 @@
 {
   "name": "@pie-framework/math-validation",
-  "version": "1.4.3",
-  "description": "New math validation",
-  "module": "src/index.ts",
-  "main": "lib/index.js",
-  "types": "lib/index.d.ts",
-  "prepublish": "tsc",
+  "version": "2.0.0-next.20261110063142",
+  "description": "Decides whether two LaTeX math expressions are equal, literally or symbolically",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
   "files": [
-    "lib"
+    "dist"
   ],
+  "sideEffects": false,
   "scripts": {
-    "build": "rollup -c",
-    "watch": "rollup -cw",
-    "test": "jest",
-    "test:report": "jest --config jest-stare.config.js",
-    "build:demo": "tsc && yarn rollup -c rollup.config.js",
-    "demo": "yarn rollup -c rollup.config.js && serve docs",
-    "semantic-release": "yarn tsc && semantic-release"
+    "build": "rm -rf dist tsconfig.tsbuildinfo && vite build && tsc --emitDeclarationOnly",
+    "dev": "vite build --watch",
+    "test": "vitest",
+    "demo": "vite --config vite.demo.config.ts",
+    "build:demo": "tsc -p demo && vite build --config vite.demo.config.ts",
+    "clean": "rm -rf dist demo/dist"
   },
-  "license": "ISC",
   "dependencies": {
-    "lodash": "^4.17.21",
+    "debug": "^4.4.3",
     "mathjs": "^9.4.2"
   },
-  "devDependencies": {
-    "@babel/runtime": "^7.13.10",
-    "@rollup/plugin-commonjs": "^15.0.0",
-    "@rollup/plugin-node-resolve": "^9.0.0",
-    "@rollup/plugin-strip": "^2.1.0",
-    "@rollup/plugin-sucrase": "^3.1.0",
-    "@semantic-release/changelog": "^6.0.3",
-    "@semantic-release/commit-analyzer": "^13.0.1",
-    "@semantic-release/exec": "^7.1.0",
-    "@semantic-release/git": "^10.0.1",
-    "@semantic-release/github": "^12.0.6",
-    "@semantic-release/npm": "^13.1.5",
-    "@semantic-release/release-notes-generator": "^14.1.0",
-    "@types/fs-extra": "^9.0.1",
-    "@types/glob": "^7.1.3",
-    "@types/jest": "^26.0.14",
-    "@types/jest-diff": "^24.3.0",
-    "@types/mathjs": "^6.0.11",
-    "@types/minimist": "^1.2.0",
-    "debug": "^4.3.1",
-    "fs-extra": "^9.0.1",
-    "glob": "^7.1.6",
-    "jest": "^26.4.2",
-    "jest-diff": "^26.4.2",
-    "jest-silent-reporter": "^0.2.1",
-    "jest-stare": "^2.2.1",
-    "latex-utensils": "^2.0.3",
-    "latex.js": "^0.12.4",
-    "minimist": "^1.2.5",
-    "prettier": "^2.3.2",
-    "rollup": "^2.50.2",
-    "rollup-plugin-cleanup": "^3.2.1",
-    "semantic-release": "^25.0.3",
-    "serve": "^11.3.2",
-    "ts-jest": "^26.3.0",
-    "ts-node": "^9.0.0",
-    "typescript": "^4.9.5"
+  "publishConfig": {
+    "access": "public"
   },
+  "license": "MIT",
   "repository": {
     "type": "git",
-    "url": "git@github.com:pie-framework/math-validation.git"
+    "url": "git+https://github.com/pie-framework/pie-elements-ng.git",
+    "directory": "packages/shared/math-validation"
   },
-  "publishConfig": {
-    "access": "public"
+  "homepage": "https://github.com/pie-framework/pie-elements-ng/tree/develop/packages/shared/math-validation#readme",
+  "bugs": {
+    "url": "https://github.com/pie-framework/pie-elements-ng/issues"
   }
 }

package/lib/conversion/ast-to-mathjs.d.ts

@@ -1,12 +0,0 @@
-export type AstToMathJsOpts = {
-    number?: string;
-};
-export declare class AstToMathJs {
-    private opts;
-    /**
-     * Note: we use fractions as the default number format.
-     * So by default AstToMathJs will generate fractions too.
-     */
-    constructor(opts?: AstToMathJsOpts);
-    convert(tree: any): any;
-}

package/lib/conversion/ast-to-mathjs.js

@@ -1,329 +0,0 @@
-"use strict";
-/*
- * convert AST to a expression tree from math.js
- *
- * Copyright 2014-2017 by
- * Jim Fowler <kisonecat@gmail.com>
- * Duane Nykamp <nykamp@umn.edu>
- *
- * This file is part of a math-expressions library
- *
- * math-expressions is free software: you can redistribute
- * it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either
- * version 3 of the License, or at your option any later version.
- *
- * math-expressions is distributed in the hope that it
- * will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
- * See the GNU General Public License for more details.
- *
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AstToMathJs = void 0;
-const mathjs_1 = require("../mathjs");
-const log_1 = require("../log");
-const log = (0, log_1.logger)("mv:ast-to-math");
-const m = mathjs_1.mathjs;
-const operators = {
-    "+": function (operands) {
-        return new m.OperatorNode("+", "add", operands);
-    },
-    "*": function (operands) {
-        const [left, right] = operands;
-        if ((left === null || left === void 0 ? void 0 : left.type) === "ConstantNode" &&
-            (right === null || right === void 0 ? void 0 : right.isUnit) &&
-            typeof left.value === "object") {
-            const leftVal = left.value.valueOf();
-            const unitResult = m.multiply(leftVal, right);
-            return unitResult;
-        }
-        return new m.OperatorNode("*", "multiply", operands);
-    },
-    "/": function (operands) {
-        return new m.OperatorNode("/", "divide", operands);
-    },
-    "-": function (operands) {
-        return new m.OperatorNode("-", "unaryMinus", [operands[0]]);
-    },
-    "^": function (operands) {
-        return new m.OperatorNode("^", "pow", operands);
-    },
-    //"prime": function(operands) { return operands[0] + "'"; },
-    // tuple: function (operands) {
-    //   return new m.ArrayNode(operands);
-    // },
-    list: function (operands) {
-        return new m.ArrayNode(operands);
-    },
-    //"array": function(operands) { return '\\left[ ' + operands.join( ', ' ) + ' \\right]';},
-    //"set": function(operands) { return '\\left\\{ ' + operands.join( ', ' ) + ' \\right\\}';},
-    vector: function (operands) {
-        return new m.ArrayNode(operands);
-    },
-    //"interval": function(operands) { return '\\left( ' + operands.join( ', ' ) + ' \\right)';},
-    and: function (operands) {
-        return new m.OperatorNode("and", "and", operands);
-    },
-    or: function (operands) {
-        return new m.OperatorNode("or", "or", operands);
-    },
-    not: function (operands) {
-        return new m.OperatorNode("not", "not", [operands[0]]);
-    },
-    "<": function (operands) {
-        return new m.OperatorNode("<", "smaller", operands);
-    },
-    ">": function (operands) {
-        return new m.OperatorNode(">", "larger", operands);
-    },
-    le: function (operands) {
-        return new m.OperatorNode("<=", "smallerEq", operands);
-    },
-    ge: function (operands) {
-        return new m.OperatorNode(">=", "largerEq", operands);
-    },
-    _: function (operands) {
-        const [arrayName, ...position] = operands;
-        const result = new m.SymbolNode(`${arrayName}[${position}]`);
-        return result;
-    },
-    ne: function (operands) {
-        return new m.OperatorNode("!=", "unequal", operands);
-    },
-    //"union": function (operands) { return operands.join(' \\cup '); },
-    //"intersect": function (operands) { return operands.join(' \\cap '); },
-    tzn: function (operands) {
-        return new m.FunctionNode("tzn", operands);
-    },
-    "≈": function (operands) {
-        return new m.FunctionNode("≈", operands);
-    },
-    "≉": function (operands) {
-        return new m.FunctionNode("≉", operands);
-    },
-    "~": function (operands) {
-        return new m.FunctionNode("~", operands);
-    },
-    "≃": function (operands) {
-        return new m.FunctionNode("≃", operands);
-    },
-    "≁": function (operands) {
-        return new m.FunctionNode("≁", operands);
-    },
-    "≅": function (operands) {
-        return new m.FunctionNode("≅", operands);
-    },
-    "≆": function (operands) {
-        return new m.FunctionNode("≆", operands);
-    },
-};
-class AstToMathJs {
-    /**
-     * Note: we use fractions as the default number format.
-     * So by default AstToMathJs will generate fractions too.
-     */
-    constructor(opts = { number: "Fraction" }) {
-        this.opts = opts;
-    }
-    convert(tree) {
-        if (typeof tree === "number") {
-            if (Number.isFinite(tree)) {
-                if (this.opts.number === "Fraction") {
-                    const f = new m.Fraction([
-                        new m.ConstantNode(tree),
-                        new m.ConstantNode(1),
-                    ]);
-                    return new m.ConstantNode(f);
-                }
-                else {
-                    return new m.ConstantNode(tree);
-                }
-            }
-            if (Number.isNaN(tree))
-                return new m.SymbolNode("NaN");
-            if (tree < 0)
-                return operators["-"]([new m.SymbolNode("Infinity")]);
-            return new m.SymbolNode("Infinity");
-        }
-        if (typeof tree === "string") {
-            return new m.SymbolNode(tree);
-        }
-        if (typeof tree === "boolean")
-            throw Error("no support for boolean");
-        if (!Array.isArray(tree))
-            throw Error("Invalid ast");
-        const operator = tree[0];
-        const operands = tree.slice(1);
-        if (operator === "apply") {
-            log("operands:", operands);
-            log("0", operands[0]);
-            if (typeof operands[0] !== "string")
-                throw Error("Non string functions not implemented for conversion to mathjs");
-            if (operands[0] === "factorial")
-                return new m.OperatorNode("!", "factorial", [
-                    this.convert(operands[1]),
-                ]);
-            const f = operands[0];
-            const args = operands[1];
-            let f_args;
-            if (args[0] === "tuple")
-                f_args = args.slice(1).map(function (v, i) {
-                    return this.convert(v);
-                }.bind(this));
-            else
-                f_args = [this.convert(args)];
-            return new m.FunctionNode(f, f_args);
-        }
-        if (operator === "unit") {
-            const unit = new m.Unit(1, operands[0]);
-            return unit;
-        }
-        if (operator === "relational") {
-            // if we have more than one comparison operators return a Relational Node
-            const params = operands[0];
-            const strict = operands[1];
-            if (params[0] !== "tuple" || strict[0] !== "tuple")
-                // something wrong if args or strict are not tuples
-                throw new Error("Badly formed ast");
-            params.splice(0, 1);
-            strict.splice(0, 1);
-            const arg_nodes = params.map(function (v, i) {
-                return this.convert(v);
-            }.bind(this));
-            let comparisons = [];
-            for (let i = 0; i < params.length - 1; i++) {
-                comparisons.push(strict[i]);
-            }
-            let result = new m.RelationalNode(comparisons, arg_nodes);
-            return result;
-        }
-        // if we have more than one equality operators return a Relational Node
-        if (operator === "=") {
-            let arg_nodes = operands.map(function (v, i) {
-                return this.convert(v);
-            }.bind(this));
-            let comparisons = [];
-            for (let i = 0; i < arg_nodes.length - 1; i++) {
-                comparisons.push("equal");
-            }
-            if (comparisons.length === 1)
-                return new m.OperatorNode("==", "equal", arg_nodes);
-            let result = new m.RelationalNode(comparisons, arg_nodes);
-            return result;
-        }
-        if (operator === "in" ||
-            operator === "notin" ||
-            operator === "ni" ||
-            operator === "notni") {
-            let x, interval;
-            if (operator === "in" || operator === "notin") {
-                x = operands[0];
-                interval = operands[1];
-            }
-            else {
-                x = operands[1];
-                interval = operands[0];
-            }
-            if (typeof x !== "number" && typeof x !== "string")
-                throw Error("Set membership non-string variables not implemented for conversion to mathjs");
-            x = this.convert(x);
-            if (interval[0] !== "interval")
-                throw Error("Set membership in non-intervals not implemented for conversion to mathjs");
-            let args = interval[1];
-            let closed = interval[2];
-            if (args[0] !== "tuple" || closed[0] !== "tuple")
-                throw new Error("Badly formed ast");
-            let a = this.convert(args[1]);
-            let b = this.convert(args[2]);
-            let comparisons = [];
-            if (closed[1])
-                comparisons.push(new m.OperatorNode(">=", "largerEq", [x, a]));
-            else
-                comparisons.push(new m.OperatorNode(">", "larger", [x, a]));
-            if (closed[2])
-                comparisons.push(new m.OperatorNode("<=", "smallerEq", [x, b]));
-            else
-                comparisons.push(new m.OperatorNode("<", "smaller", [x, b]));
-            let result = new m.OperatorNode("and", "and", comparisons);
-            if (operator === "notin" || operator === "notni")
-                result = new m.OperatorNode("not", "not", [result]);
-            return result;
-        }
-        if (operator === "subset" ||
-            operator === "notsubset" ||
-            operator === "superset" ||
-            operator === "notsuperset") {
-            let big, small;
-            if (operator === "subset" || operator === "notsubset") {
-                small = operands[0];
-                big = operands[1];
-            }
-            else {
-                small = operands[1];
-                big = operands[0];
-            }
-            if (small[0] !== "interval" || big[0] !== "interval")
-                throw Error("Set containment of non-intervals not implemented for conversion to mathjs");
-            let small_args = small[1];
-            let small_closed = small[2];
-            let big_args = big[1];
-            let big_closed = big[2];
-            if (small_args[0] !== "tuple" ||
-                small_closed[0] !== "tuple" ||
-                big_args[0] !== "tuple" ||
-                big_closed[0] !== "tuple")
-                throw Error("Badly formed ast");
-            let small_a = this.convert(small_args[1]);
-            let small_b = this.convert(small_args[2]);
-            let big_a = this.convert(big_args[1]);
-            let big_b = this.convert(big_args[2]);
-            let comparisons = [];
-            if (small_closed[1] && !big_closed[1])
-                comparisons.push(new m.OperatorNode(">", "larger", [small_a, big_a]));
-            else
-                comparisons.push(new m.OperatorNode(">=", "largerEq", [small_a, big_a]));
-            if (small_closed[2] && !big_closed[2])
-                comparisons.push(new m.OperatorNode("<", "smaller", [small_b, big_b]));
-            else
-                comparisons.push(new m.OperatorNode("<=", "smallerEq", [small_b, big_b]));
-            let result = new m.OperatorNode("and", "and", comparisons);
-            if (operator === "notsubset" || operator === "notsuperset")
-                result = new m.OperatorNode("not", "not", [result]);
-            return result;
-        }
-        if (operator === "matrix") {
-            // Convert matrices into nested array nodes
-            // Will become matrix on eval
-            let size = operands[0];
-            let nrows = size[1];
-            let ncols = size[2];
-            let entries = operands[1];
-            if (!Number.isInteger(nrows) || !Number.isInteger(ncols))
-                throw Error("Matrix must have integer dimensions");
-            let result = [];
-            for (let i = 1; i <= nrows; i++) {
-                let row = [];
-                for (let j = 1; j <= ncols; j++) {
-                    row.push(this.convert(entries[i][j]));
-                }
-                result.push(new m.ArrayNode(row));
-            }
-            return new m.ArrayNode(result);
-        }
-        if (operator == "%") {
-            const dividend = this.convert(operands[0]);
-            const divisor = new m.ConstantNode(100);
-            const result = new m.OperatorNode("/", "divide", [dividend, divisor]);
-            return result;
-        }
-        if (operator in operators) {
-            return operators[operator](operands.map(function (v, i) {
-                return this.convert(v);
-            }.bind(this)));
-        }
-        throw Error("Operator " + operator + " not implemented for conversion to mathjs");
-    }
-}
-exports.AstToMathJs = AstToMathJs;
-//# sourceMappingURL=ast-to-mathjs.js.map

package/lib/conversion/ast-to-mathjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ast-to-mathjs.js","sourceRoot":"","sources":["../../src/conversion/ast-to-mathjs.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;GAmBG;;;AAEH,sCAA0C;AAC1C,gCAAgC;AAChC,MAAM,GAAG,GAAG,IAAA,YAAM,EAAC,gBAAgB,CAAC,CAAC;AACrC,MAAM,CAAC,GAAQ,eAAG,CAAC;AAEnB,MAAM,SAAS,GAAG;IAChB,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,QAAQ,CAAC;QAC/B,IACE,CAAA,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,MAAK,cAAc;aAC7B,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAA;YACb,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,EAC9B;YACA,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YACrC,MAAM,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAE9C,OAAO,UAAU,CAAC;SACnB;QACD,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,YAAY,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;IACD,4DAA4D;IAC5D,+BAA+B;IAC/B,sCAAsC;IACtC,KAAK;IACL,IAAI,EAAE,UAAU,QAAQ;QACtB,OAAO,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IACD,0FAA0F;IAC1F,4FAA4F;IAC5F,MAAM,EAAE,UAAU,QAAQ;QACxB,OAAO,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IACD,6FAA6F;IAC7F,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IACD,EAAE,EAAE,UAAU,QAAQ;QACpB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACtD,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD,EAAE,EAAE,UAAU,QAAQ;QACpB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IACD,EAAE,EAAE,UAAU,QAAQ;QACpB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;IACxD,CAAC;IACD,CAAC,EAAE,UAAU,QAAQ;QACnB,MAAM,CAAC,SAAS,EAAE,GAAG,QAAQ,CAAC,GAAG,QAAQ,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,SAAS,IAAI,QAAQ,GAAG,CAAC,CAAC;QAC7D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,EAAE,EAAE,UAAU,QAAQ;QACpB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,oEAAoE;IACpE,wEAAwE;IACxE,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC7C,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,GAAG,EAAE,UAAU,QAAQ;QACrB,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;CACF,CAAC;AAMF,MAAa,WAAW;IACtB;;;OAGG;IACH,YAAoB,OAAwB,EAAE,MAAM,EAAE,UAAU,EAAE;QAA9C,SAAI,GAAJ,IAAI,CAA0C;IAAG,CAAC;IAEtE,OAAO,CAAC,IAAI;QACV,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC5B,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;gBACzB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE;oBACnC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC;wBACvB,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC;wBACxB,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;qBACtB,CAAC,CAAC;oBACH,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;iBAC9B;qBAAM;oBACL,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;iBACjC;aACF;YAED,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,IAAI,GAAG,CAAC;gBAAE,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACpE,OAAO,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;SACrC;QAED,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC5B,OAAO,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SAC/B;QAED,IAAI,OAAO,IAAI,KAAK,SAAS;YAAE,MAAM,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAErE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,MAAM,KAAK,CAAC,aAAa,CAAC,CAAC;QAErD,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAE/B,IAAI,QAAQ,KAAK,OAAO,EAAE;YACxB,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YAC3B,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,QAAQ;gBACjC,MAAM,KAAK,CACT,+DAA+D,CAChE,CAAC;YAEJ,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW;gBAC7B,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,WAAW,EAAE;oBAC1C,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;iBAC1B,CAAC,CAAC;YAEL,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,MAAM,CAAC;YAEX,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO;gBACrB,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CACxB,UAAU,CAAC,EAAE,CAAC;oBACZ,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACzB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACb,CAAC;;gBACC,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAEnC,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACtC;QAED,IAAI,QAAQ,KAAK,MAAM,EAAE;YACvB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAExC,OAAO,IAAI,CAAC;SACb;QAED,IAAI,QAAQ,KAAK,YAAY,EAAE;YAC7B,yEAAyE;YACzE,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAE3B,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO;gBAChD,mDAAmD;gBACnD,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAC1B,UAAU,CAAC,EAAE,CAAC;gBACZ,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACb,CAAC;YAEF,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1C,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;aAC7B;YAED,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YAE1D,OAAO,MAAM,CAAC;SACf;QAED,uEAAuE;QACvE,IAAI,QAAQ,KAAK,GAAG,EAAE;YACpB,IAAI,SAAS,GAAG,QAAQ,CAAC,GAAG,CAC1B,UAAU,CAAC,EAAE,CAAC;gBACZ,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACb,CAAC;YAEF,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC7C,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aAC3B;YAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;gBAC1B,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;YAEtD,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YAE1D,OAAO,MAAM,CAAC;SACf;QAED,IACE,QAAQ,KAAK,IAAI;YACjB,QAAQ,KAAK,OAAO;YACpB,QAAQ,KAAK,IAAI;YACjB,QAAQ,KAAK,OAAO,EACpB;YACA,IAAI,CAAC,EAAE,QAAQ,CAAC;YAChB,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,OAAO,EAAE;gBAC7C,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAChB,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;aACxB;iBAAM;gBACL,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAChB,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;aACxB;YACD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ;gBAChD,MAAM,KAAK,CACT,8EAA8E,CAC/E,CAAC;YACJ,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAEpB,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,UAAU;gBAC5B,MAAM,KAAK,CACT,0EAA0E,CAC3E,CAAC;YAEJ,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO;gBAC9C,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;YAEtC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAE9B,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,IAAI,MAAM,CAAC,CAAC,CAAC;gBACX,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;;gBAC5D,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,IAAI,MAAM,CAAC,CAAC,CAAC;gBACX,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;;gBAC7D,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAElE,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;YAE3D,IAAI,QAAQ,KAAK,OAAO,IAAI,QAAQ,KAAK,OAAO;gBAC9C,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YAEtD,OAAO,MAAM,CAAC;SACf;QAED,IACE,QAAQ,KAAK,QAAQ;YACrB,QAAQ,KAAK,WAAW;YACxB,QAAQ,KAAK,UAAU;YACvB,QAAQ,KAAK,aAAa,EAC1B;YACA,IAAI,GAAG,EAAE,KAAK,CAAC;YACf,IAAI,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,WAAW,EAAE;gBACrD,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACpB,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;aACnB;iBAAM;gBACL,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACpB,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;aACnB;YACD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,UAAU,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,UAAU;gBAClD,MAAM,KAAK,CACT,2EAA2E,CAC5E,CAAC;YAEJ,IAAI,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,IACE,UAAU,CAAC,CAAC,CAAC,KAAK,OAAO;gBACzB,YAAY,CAAC,CAAC,CAAC,KAAK,OAAO;gBAC3B,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO;gBACvB,UAAU,CAAC,CAAC,CAAC,KAAK,OAAO;gBAEzB,MAAM,KAAK,CAAC,kBAAkB,CAAC,CAAC;YAElC,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtC,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACnC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;;gBAEtE,WAAW,CAAC,IAAI,CACd,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CACvD,CAAC;YAEJ,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACnC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;;gBAEvE,WAAW,CAAC,IAAI,CACd,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CACxD,CAAC;YAEJ,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;YAE3D,IAAI,QAAQ,KAAK,WAAW,IAAI,QAAQ,KAAK,aAAa;gBACxD,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YAEtD,OAAO,MAAM,CAAC;SACf;QAED,IAAI,QAAQ,KAAK,QAAQ,EAAE;YACzB,2CAA2C;YAC3C,6BAA6B;YAE7B,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAEpB,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAE1B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC;gBACtD,MAAM,KAAK,CAAC,qCAAqC,CAAC,CAAC;YAErD,IAAI,MAAM,GAAG,EAAE,CAAC;YAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE;gBAC/B,IAAI,GAAG,GAAG,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE;oBAC/B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACvC;gBACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;aACnC;YAED,OAAO,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;SAChC;QAED,IAAI,QAAQ,IAAI,GAAG,EAAE;YACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;YAEtE,OAAO,MAAM,CAAC;SACf;QAED,IAAI,QAAQ,IAAI,SAAS,EAAE;YACzB,OAAO,SAAS,CAAC,QAAQ,CAAC,CACxB,QAAQ,CAAC,GAAG,CACV,UAAU,CAAC,EAAE,CAAC;gBACZ,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CACb,CACF,CAAC;SACH;QAED,MAAM,KAAK,CACT,WAAW,GAAG,QAAQ,GAAG,2CAA2C,CACrE,CAAC;IACJ,CAAC;CACF;AAlRD,kCAkRC"}

package/lib/conversion/error.d.ts

@@ -1,5 +0,0 @@
-declare function ParseError(message: string, location?: number): void;
-declare namespace ParseError {
-    var prototype: any;
-}
-export { ParseError };

package/lib/conversion/error.js

@@ -1,13 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParseError = void 0;
-function ParseError(message, location) {
-    this.name = "ParseError";
-    this.message = message || "Error parsing input";
-    this.stack = new Error().stack;
-    this.location = location;
-}
-exports.ParseError = ParseError;
-ParseError.prototype = Object.create(Error.prototype);
-ParseError.prototype.constructor = ParseError;
-//# sourceMappingURL=error.js.map

package/lib/conversion/error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"error.js","sourceRoot":"","sources":["../../src/conversion/error.ts"],"names":[],"mappings":";;;AAAA,SAAS,UAAU,CAAC,OAAe,EAAE,QAAiB;IACpD,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IACzB,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,qBAAqB,CAAC;IAChD,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC,KAAK,CAAC;IAC/B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;AAC3B,CAAC;AAIQ,gCAAU;AAHnB,UAAU,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;AACtD,UAAU,CAAC,SAAS,CAAC,WAAW,GAAG,UAAU,CAAC"}

package/lib/conversion/flatten.d.ts

@@ -1,12 +0,0 @@
-export declare var is_associative: {
-    "+": boolean;
-    "*": boolean;
-    and: boolean;
-    or: boolean;
-    union: boolean;
-    intersect: boolean;
-};
-export declare function flatten(expr: any): any;
-export declare const unflattenRight: (expr: any) => any;
-export declare const unflattenLeft: (expr: any) => any;
-export declare const allChildren: (tree: any) => any;