n8n-workflow 1.97.0 → 1.99.0

package/dist/cjs/node-reference-parser-utils.js

@@ -0,0 +1,468 @@
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports", "lodash/cloneDeep", "lodash/escapeRegExp", "lodash/isEqual", "lodash/mapValues", "./errors"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.hasDotNotationBannedChar = hasDotNotationBannedChar;
+    exports.backslashEscape = backslashEscape;
+    exports.dollarEscape = dollarEscape;
+    exports.applyAccessPatterns = applyAccessPatterns;
+    exports.extractReferencesInNodeExpressions = extractReferencesInNodeExpressions;
+    const cloneDeep_1 = __importDefault(require("lodash/cloneDeep"));
+    const escapeRegExp_1 = __importDefault(require("lodash/escapeRegExp"));
+    const isEqual_1 = __importDefault(require("lodash/isEqual"));
+    const mapValues_1 = __importDefault(require("lodash/mapValues"));
+    const errors_1 = require("./errors");
+    class LazyRegExp {
+        pattern;
+        flags;
+        regExp;
+        constructor(pattern, flags) {
+            this.pattern = pattern;
+            this.flags = flags;
+        }
+        get() {
+            if (!this.regExp)
+                this.regExp = new RegExp(this.pattern(), this.flags);
+            return this.regExp;
+        }
+    }
+    const DOT_REFERENCEABLE_JS_VARIABLE = /\w[\w\d_\$]*/;
+    const INVALID_JS_DOT_PATH = /[^\.\w\d_\$]/;
+    const INVALID_JS_DOT_NAME = /[^\w\d_\$]/;
+    // These are the keys that are followed by one of DATA_ACCESSORS
+    const ITEM_TO_DATA_ACCESSORS = [
+        /^first\(\)/,
+        /^last\(\)/,
+        /^all\(\)/,
+        // The order here is relevant because `item` would match occurrences of `itemMatching`
+        /^itemMatching\(\d+\)/, // We only support trivial itemMatching arguments
+        /^item/,
+    ];
+    // These we safely can convert to a normal argument
+    const ITEM_ACCESSORS = ['params', 'isExecuted'];
+    const DATA_ACCESSORS = ['json', 'binary'];
+    function hasDotNotationBannedChar(nodeName) {
+        const DOT_NOTATION_BANNED_CHARS = /^(\d)|[\\ `!@#$%^&*()_+\-=[\]{};':"\\|,.<>?~]/g;
+        return DOT_NOTATION_BANNED_CHARS.test(nodeName);
+    }
+    function backslashEscape(nodeName) {
+        const BACKSLASH_ESCAPABLE_CHARS = /[.*+?^${}()|[\]\\]/g;
+        return nodeName.replace(BACKSLASH_ESCAPABLE_CHARS, (char) => `\\${char}`);
+    }
+    function dollarEscape(nodeName) {
+        return nodeName.replace(new RegExp('\\$', 'g'), '$$$$');
+    }
+    const ACCESS_PATTERNS = [
+        {
+            checkPattern: '$(',
+            replacePattern: (s) => String.raw `(\$\(['"])${s}(['"]\))`,
+        },
+        {
+            checkPattern: '$node[',
+            replacePattern: (s) => String.raw `(\$node\[['"])${s}(['"]\])`,
+        },
+        {
+            checkPattern: '$node.',
+            replacePattern: (s) => String.raw `(\$node\.)${s}(\.?)`,
+            customCallback: (expression, newName, escapedNewName) => {
+                if (hasDotNotationBannedChar(newName)) {
+                    const regex = new RegExp(`.${backslashEscape(newName)}( |\\.)`, 'g');
+                    return expression.replace(regex, `["${escapedNewName}"]$1`);
+                }
+                return expression;
+            },
+        },
+        {
+            checkPattern: '$items(',
+            replacePattern: (s) => String.raw `(\$items\(['"])${s}(['"],|['"]\))`,
+        },
+    ];
+    function applyAccessPatterns(expression, previousName, newName) {
+        // To not run the "expensive" regex stuff when it is not needed
+        // make a simple check first if it really contains the node-name
+        if (!expression.includes(previousName))
+            return expression;
+        // Really contains node-name (even though we do not know yet if really as $node-expression)
+        const escapedOldName = backslashEscape(previousName); // for match
+        const escapedNewName = dollarEscape(newName); // for replacement
+        for (const pattern of ACCESS_PATTERNS) {
+            if (expression.includes(pattern.checkPattern)) {
+                expression = expression.replace(new RegExp(pattern.replacePattern(escapedOldName), 'g'), `$1${escapedNewName}$2`);
+                if (pattern.customCallback) {
+                    expression = pattern.customCallback(expression, newName, escapedNewName);
+                }
+            }
+        }
+        return expression;
+    }
+    function convertToUniqueJsDotName(nodeName, allNodeNames) {
+        let jsLegal = nodeName
+            .replaceAll(' ', '_')
+            .split('')
+            .filter((x) => !INVALID_JS_DOT_NAME.test(x))
+            .join('');
+        if (nodeName === jsLegal)
+            return jsLegal;
+        // This accounts for theoretical cases where we collide with other reduced names
+        // By adding our own index in the array we also avoid running into theoretical cases
+        // where a node with the name 'ourName_27' exists for our reduced name 'ourName'
+        // because we must have a different index, so therefore only one of us can be `ourName_27_27`
+        //
+        // The underscore prevents colliding e.g. index 1 with 11
+        while (allNodeNames.includes(jsLegal))
+            jsLegal += `_${allNodeNames.indexOf(nodeName)}`;
+        return jsLegal;
+    }
+    function convertDataAccessorName(name) {
+        const [fnName, maybeDigits] = name.split('(');
+        switch (fnName.toLowerCase()) {
+            case 'item':
+                return fnName;
+            case 'first':
+            case 'last':
+                return `${fnName}Item`;
+            case 'all':
+                return `${fnName}Items`;
+        }
+        // use the digits without the )
+        return `${fnName}_${maybeDigits?.slice(0, -1) ?? 'unknown'}`;
+    }
+    function parseExpressionMapping(isolatedExpression, nodeNameInExpression, nodeNamePlainJs, startNodeName) {
+        const splitExpr = isolatedExpression.split('.');
+        // This supports literal . used in the node name
+        const dotsInName = nodeNameInExpression?.split('').filter((x) => x === '.').length ?? 0;
+        const dotInAccessorsOffset = isolatedExpression.startsWith('$node.') ? 1 : 0;
+        const exprStart = splitExpr.slice(0, dotInAccessorsOffset + dotsInName + 1).join('.');
+        const parts = splitExpr.slice(dotInAccessorsOffset + dotsInName + 1);
+        // The calling code is expected to only handle $json expressions for the root node
+        // As these are invalid conversions for inner nodes
+        if (exprStart === '$json') {
+            let partsIdx = 0;
+            for (; partsIdx < parts.length; ++partsIdx) {
+                if (!DOT_REFERENCEABLE_JS_VARIABLE.test(parts[partsIdx]))
+                    break;
+            }
+            return {
+                nodeNameInExpression: null,
+                originalExpression: `${exprStart}.${parts.slice(0, partsIdx + 1).join('.')}`, // $json.valid.until, but not ['x'] after
+                replacementPrefix: `${exprStart}`, // $json
+                replacementName: `${parts.slice(0, partsIdx).join('_')}`, // valid_until
+            };
+        }
+        if (parts.length === 0) {
+            // If a node is referenced by name without any accessor we return a proxy that stringifies as an empty object
+            // But it can still be validly passed to other functions
+            // However when passed to a sub-workflow it collapses into a true empty object
+            // So lets just abort porting this and don't touch it
+            return null;
+        }
+        // Handling `all()` is very awkward since we need to pass the value as a single parameter but
+        // can't do `$('Start').all() since it would be a different node's all
+        const accessorPrefix = parts[0] === 'all()' ? 'first()' : parts[0];
+        if (ITEM_TO_DATA_ACCESSORS.some((x) => parts[0].match(x))) {
+            if (parts.length === 1) {
+                // this case is a literal use of the return value of `$('nodeName').first()`
+                // Note that it's safe to rename to first, even if there is a variable of the same name
+                // since we resolve duplicate names later in the process
+                const originalName = parts[0];
+                return {
+                    nodeNameInExpression,
+                    originalExpression: `${exprStart}.${parts[0]}`, // $('abc').first()
+                    replacementPrefix: `$('${startNodeName}').${accessorPrefix}.json`, //  $('Start').first().json
+                    replacementName: `${nodeNamePlainJs}_${convertDataAccessorName(originalName)}`, // nodeName_firstItem, nodeName_itemMatching_20
+                };
+            }
+            else {
+                if (DATA_ACCESSORS.some((x) => parts[1] === x)) {
+                    let partsIdx = 2;
+                    for (; partsIdx < parts.length; ++partsIdx) {
+                        if (!DOT_REFERENCEABLE_JS_VARIABLE.test(parts[partsIdx]))
+                            break;
+                    }
+                    // Use a separate name for anything except item to avoid users confusing their e.g. first() variables
+                    const replacementPostfix = parts[0] === 'item' ? '' : `_${convertDataAccessorName(parts[0])}`;
+                    return {
+                        nodeNameInExpression,
+                        originalExpression: `${exprStart}.${parts.slice(0, partsIdx + 1).join('.')}`, // $('abc').item.json.valid.until, but not ['x'] after
+                        replacementPrefix: `$('${startNodeName}').${accessorPrefix}.${parts[1]}`, // $('Start').item.json
+                        replacementName: parts.slice(2, partsIdx).join('_') + replacementPostfix, // valid_until, or valid_until_firstItem
+                    };
+                }
+                else {
+                    // this case covers any normal ObjectExtensions functions called on the ITEM_TO_DATA_ACCESSORS entry
+                    // e.g. $('nodeName').first().toJsonObject().randomJSFunction() or $('nodeName').all().map(x => ({...x, a: 3 }))
+                    return {
+                        nodeNameInExpression,
+                        originalExpression: `${exprStart}.${parts[0]}`, // $('abc').first()
+                        replacementPrefix: `$('${startNodeName}').${accessorPrefix}.json`, //  $('Start').first().json.
+                        replacementName: `${nodeNamePlainJs}_${convertDataAccessorName(parts[0])}`, // nodeName_firstItem
+                    };
+                }
+            }
+        }
+        // This covers specific metadata functions available on nodes
+        const itemAccessorMatch = ITEM_ACCESSORS.flatMap((x) => (x === parts[0] ? x : []))[0];
+        if (itemAccessorMatch !== undefined) {
+            return {
+                nodeNameInExpression,
+                originalExpression: `${exprStart}.${parts[0]}`, // $('abc').isExecuted
+                replacementPrefix: `$('${startNodeName}').first().json`, //  $('Start').first()
+                replacementName: `${nodeNamePlainJs}_${parts[0]}`, // nodeName_isExecuted
+            };
+        }
+        // If we end up here it means that:
+        // - we have a complex `itemMatching(<expr>)` case, or
+        // - the expression should be invalid, or
+        // - a new function was added that we're not aware of.
+        //
+        // In these cases let's just not touch it and keep it as is
+        return null;
+    }
+    // find `$('NodeName').item.json.path.to.x` in `{{ $('NodeName').item.json.path.to.x[someFunction()] }}`
+    function extractExpressionCandidate(expression, startIndex, endIndex) {
+        const firstPartException = ITEM_TO_DATA_ACCESSORS.map((x) => x.exec(expression.slice(endIndex))).filter((x) => x !== null);
+        // Note that by choosing match 0 we use `itemMatching` matches over `item`
+        // matches by relying on the order in ITEM_TO_DATA_ACCESSORS
+        let after_accessor_idx = endIndex + (firstPartException[0]?.[0].length ?? -1);
+        // skip `.` to continue, but halt before other symbols like `[` in `all()[0]`
+        if (expression[after_accessor_idx + 1] === '.')
+            after_accessor_idx += 1;
+        const after_accessor = expression.slice(after_accessor_idx);
+        const firstInvalidCharMatch = INVALID_JS_DOT_PATH.exec(after_accessor);
+        // we should at least find the }} closing the JS expressions in valid cases
+        if (!firstInvalidCharMatch)
+            return null;
+        return expression.slice(startIndex, after_accessor_idx + firstInvalidCharMatch.index);
+    }
+    // Parse a given regex accessor match (e.g. `$('nodeName')`, `$node['nodeName']`)
+    // and extract a potential ExpressionMapping
+    function parseCandidateMatch(match, expression, nodeNames, startNodeName) {
+        const startIndex = match.index;
+        const endIndex = startIndex + match[0].length + 1;
+        // this works because all access patterns define match groups
+        // [fullMatch, "$('", "nodeName", "')"]
+        const nodeNameInExpression = match[2];
+        // This should be invalid in theory, since the regex matches should only act
+        // on known node names
+        if (!nodeNames.includes(nodeNameInExpression))
+            return null;
+        const candidate = extractExpressionCandidate(expression, startIndex, endIndex);
+        if (candidate === null)
+            return null;
+        return parseExpressionMapping(candidate, nodeNameInExpression, convertToUniqueJsDotName(nodeNameInExpression, nodeNames), startNodeName);
+    }
+    // Handle matches of form `$json.path.to.value`, which is necessary for the selection input node
+    function parse$jsonMatch(match, expression, startNodeName) {
+        const candidate = extractExpressionCandidate(expression, match.index, match.index + match[0].length + 1);
+        if (candidate === null)
+            return null;
+        return parseExpressionMapping(candidate, null, null, startNodeName);
+    }
+    // Parse all references to other nodes in `expression` and return them as `ExpressionMappings`
+    function parseReferencingExpressions(expression, nodeRegexps, nodeNames, startNodeName, parse$json) {
+        const result = [];
+        for (const [pattern, regexp] of nodeRegexps) {
+            if (!expression.includes(pattern))
+                continue;
+            const matches = [...expression.matchAll(regexp.get())];
+            result.push(...matches
+                .map((x) => parseCandidateMatch(x, expression, nodeNames, startNodeName))
+                .filter((x) => x !== null));
+        }
+        if (parse$json && expression.includes('$json')) {
+            for (const match of expression.matchAll(/\$json/gi)) {
+                const res = parse$jsonMatch(match, expression, startNodeName);
+                if (res)
+                    result.push(res);
+            }
+        }
+        return result;
+    }
+    // Recursively apply `mapper` to all expressions in `parameterValue`
+    function applyParameterMapping(parameterValue, mapper, keyOfValue) {
+        const result = {};
+        if (typeof parameterValue !== 'object' || parameterValue === null) {
+            if (typeof parameterValue === 'string' &&
+                (parameterValue.charAt(0) === '=' || keyOfValue === 'jsCode')) {
+                const mapping = mapper(parameterValue);
+                return [mapping, mapping];
+            }
+            return [undefined, []];
+        }
+        const allMappings = [];
+        for (const [key, value] of Object.entries(parameterValue)) {
+            const [mapping, all] = applyParameterMapping(value, mapper, key);
+            result[key] = mapping;
+            allMappings.push(...all);
+        }
+        return [result, allMappings];
+    }
+    // Ensure all expressions have a unique variable name
+    function resolveDuplicates(data, allNodeNames) {
+        // Map from candidate variableName to its expressionData
+        const triggerArgumentMap = new Map();
+        const originalExpressionMap = new Map();
+        for (const mapping of data) {
+            const { nodeNameInExpression, originalExpression, replacementPrefix } = mapping;
+            let { replacementName } = mapping;
+            const hasKeyAndCollides = (key) => {
+                const value = triggerArgumentMap.get(key);
+                if (!value)
+                    return false;
+                return !(0, isEqual_1.default)(value, mapping);
+            };
+            // We need both parts in the key as we may need to pass e.g. `.first()` and `.item` separately
+            // Since we cannot pass the node itself as its proxy reduces it to an empty object
+            const key = () => `${replacementPrefix}.${replacementName}`;
+            // This covers a realistic case where two nodes have the same path, e.g.
+            //    $('original input').item.json.path.to.url
+            //    $('some time later in the workflow').item.json.path.to.url
+            if (hasKeyAndCollides(key()) && nodeNameInExpression) {
+                replacementName = `${convertToUniqueJsDotName(nodeNameInExpression, allNodeNames)}_${replacementName}`;
+            }
+            // This covers all other theoretical cases, like where `${nodeName}_${variable}` might clash with another variable name
+            while (hasKeyAndCollides(key()))
+                replacementName += '_1';
+            triggerArgumentMap.set(key(), {
+                originalExpression,
+                nodeNameInExpression,
+                replacementName,
+                replacementPrefix,
+            });
+            originalExpressionMap.set(originalExpression, key());
+        }
+        return {
+            triggerArgumentMap,
+            originalExpressionMap,
+        };
+    }
+    // Recursively loop through the nodeProperties and apply `parameterExtractMapping` where defined
+    function applyExtractMappingToNode(node, parameterExtractMapping) {
+        const usedMappings = [];
+        const applyMapping = (parameters, mapping) => {
+            if (!mapping)
+                return parameters;
+            if (typeof parameters !== 'object' || parameters === null) {
+                if (Array.isArray(mapping) && typeof parameters === 'string') {
+                    for (const mapper of mapping) {
+                        if (!parameters.includes(mapper.originalExpression))
+                            continue;
+                        parameters = parameters.replaceAll(mapper.originalExpression, `${mapper.replacementPrefix}.${mapper.replacementName}`);
+                        usedMappings.push(mapper);
+                    }
+                }
+                return parameters;
+            }
+            // This should be an invalid state, though an explicit check makes typings easier
+            if (Array.isArray(mapping)) {
+                return parameters;
+            }
+            if (Array.isArray(parameters) && typeof mapping === 'object' && !Array.isArray(mapping)) {
+                return parameters.map((x, i) => applyMapping(x, mapping[i]));
+            }
+            return (0, mapValues_1.default)(parameters, (v, k) => applyMapping(v, mapping[k]));
+        };
+        const parameters = applyMapping(node.parameters, parameterExtractMapping);
+        return { result: { ...node, parameters }, usedMappings };
+    }
+    // Recursively find the finalized mapping for provisional mappings
+    function applyCanonicalMapping(mapping, getCanonicalData) {
+        if (!mapping)
+            return;
+        if (Array.isArray(mapping)) {
+            // Sort by longest so that we don't accidentally replace part of a longer expression
+            return mapping
+                .map(getCanonicalData)
+                .filter((x) => x !== undefined)
+                .sort((a, b) => b.originalExpression.length - a.originalExpression.length);
+        }
+        return (0, mapValues_1.default)(mapping, (v) => applyCanonicalMapping(v, getCanonicalData));
+    }
+    /**
+     * Extracts references to nodes in `nodeNames` from the nodes in `subGraph`.
+     *
+     * @returns an object with two keys:
+     * 		- nodes: Transformed copies of nodes in `subGraph`, ready for use in a sub-workflow
+     *    - variables: A map from variable name in the sub-workflow to the replaced expression
+     *
+     * @throws if the startNodeName already exists in `nodeNames`
+     * @throws if `nodeNames` does not include all node names in `subGraph`
+     */
+    function extractReferencesInNodeExpressions(subGraph, nodeNames, insertedStartName, graphInputNodeNames) {
+        ////
+        // STEP 1 - Validate input invariants
+        ////
+        const subGraphNames = subGraph.map((x) => x.name);
+        if (subGraphNames.includes(insertedStartName))
+            throw new errors_1.OperationalError(`StartNodeName ${insertedStartName} already exists in nodeNames: ${JSON.stringify(subGraphNames)}`);
+        if (subGraphNames.some((x) => !nodeNames.includes(x))) {
+            throw new errors_1.OperationalError(`extractReferencesInNodeExpressions called with node in subGraph ${JSON.stringify(subGraphNames)} whose name is not in provided 'nodeNames' list ${JSON.stringify(nodeNames)}.`);
+        }
+        ////
+        // STEP 2 - Compile all candidate regexp patterns
+        ////
+        // This looks scary for large workflows, but RegExp should support >1 million characters and
+        // it's a very linear pattern.
+        const namesRegexp = '(' + nodeNames.map(escapeRegExp_1.default).join('|') + ')';
+        const nodeRegexps = ACCESS_PATTERNS.map((pattern) => [
+            pattern.checkPattern,
+            // avoid compiling the expensive regex for rare legacy ways of accessing nodes
+            new LazyRegExp(() => pattern.replacePattern(namesRegexp), 'g'),
+        ]);
+        ////
+        // STEP 3 - Parse expressions used in parameters and build mappings
+        ////
+        // This map is used to change the actual expressions once resolved
+        // The value represents fields in the actual parameters object which require change
+        const parameterTreeMappingByNode = new Map();
+        // This is used to track all candidates for change, necessary for deduplication
+        const allData = [];
+        for (const node of subGraph) {
+            const [parameterMapping, allMappings] = applyParameterMapping(node.parameters, (s) => parseReferencingExpressions(s, nodeRegexps, nodeNames, insertedStartName, graphInputNodeNames?.includes(node.name) ?? false));
+            parameterTreeMappingByNode.set(node.name, parameterMapping);
+            allData.push(...allMappings);
+        }
+        ////
+        // STEP 4 - Filter out nodes in subGraph and handle name clashes
+        ////
+        const subGraphNodeNames = new Set(subGraphNames);
+        const dataFromOutsideSubgraph = allData.filter(
+        // `nodeNameInExpression` being absent implies direct access via `$json` or `$binary`
+        (x) => !x.nodeNameInExpression || !subGraphNodeNames.has(x.nodeNameInExpression));
+        const { originalExpressionMap, triggerArgumentMap } = resolveDuplicates(dataFromOutsideSubgraph, nodeNames);
+        ////
+        // STEP 5 - Apply canonical mappings to nodes and track created variables
+        ////
+        // triggerArgumentMap[originalExpressionMap[originalExpression]] returns its canonical object
+        // These should never be undefined at this stage
+        const getCanonicalData = (e) => {
+            const key = originalExpressionMap.get(e.originalExpression);
+            if (!key)
+                return undefined;
+            return triggerArgumentMap.get(key);
+        };
+        for (const [key, value] of parameterTreeMappingByNode.entries()) {
+            parameterTreeMappingByNode.set(key, applyCanonicalMapping(value, getCanonicalData));
+        }
+        const allUsedMappings = [];
+        const output = [];
+        for (const node of subGraph) {
+            const { result, usedMappings } = applyExtractMappingToNode((0, cloneDeep_1.default)(node), parameterTreeMappingByNode.get(node.name));
+            allUsedMappings.push(...usedMappings);
+            output.push(result);
+        }
+        const variables = new Map(allUsedMappings.map((m) => [m.replacementName, m.originalExpression]));
+        return { nodes: output, variables };
+    }
+});
+//# sourceMappingURL=node-reference-parser-utils.js.map

package/dist/cjs/node-reference-parser-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node-reference-parser-utils.js","sourceRoot":"","sources":["../../src/node-reference-parser-utils.ts"],"names":[],"mappings":";;;;;;;;;;;;;;IAqDA,4DAIC;IAED,0CAIC;IAED,oCAEC;IAkCD,kDAsBC;IA6WD,gFAwGC;IAhlBD,iEAAyC;IACzC,uEAA+C;IAC/C,6DAAqC;IACrC,iEAAyC;IAEzC,qCAA4C;IAG5C,MAAM,UAAU;QAIN;QACA;QAJD,MAAM,CAAU;QAExB,YACS,OAAqB,EACrB,KAAc;YADd,YAAO,GAAP,OAAO,CAAc;YACrB,UAAK,GAAL,KAAK,CAAS;QACpB,CAAC;QAEJ,GAAG;YACF,IAAI,CAAC,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAEvE,OAAO,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;KACD;IAaD,MAAM,6BAA6B,GAAG,cAAc,CAAC;IACrD,MAAM,mBAAmB,GAAG,cAAc,CAAC;IAC3C,MAAM,mBAAmB,GAAG,YAAY,CAAC;IAEzC,gEAAgE;IAChE,MAAM,sBAAsB,GAAG;QAC9B,YAAY;QACZ,WAAW;QACX,UAAU;QACV,sFAAsF;QACtF,sBAAsB,EAAE,iDAAiD;QACzE,OAAO;KACP,CAAC;IAEF,mDAAmD;IACnD,MAAM,cAAc,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IAEhD,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAE1C,SAAgB,wBAAwB,CAAC,QAAgB;QACxD,MAAM,yBAAyB,GAAG,gDAAgD,CAAC;QAEnF,OAAO,yBAAyB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,SAAgB,eAAe,CAAC,QAAgB;QAC/C,MAAM,yBAAyB,GAAG,qBAAqB,CAAC;QAExD,OAAO,QAAQ,CAAC,OAAO,CAAC,yBAAyB,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED,SAAgB,YAAY,CAAC,QAAgB;QAC5C,OAAO,QAAQ,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACzD,CAAC;IAQD,MAAM,eAAe,GAAoB;QACxC;YACC,YAAY,EAAE,IAAI;YAClB,cAAc,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAA,aAAa,CAAC,UAAU;SACzD;QACD;YACC,YAAY,EAAE,QAAQ;YACtB,cAAc,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAA,iBAAiB,CAAC,UAAU;SAC7D;QACD;YACC,YAAY,EAAE,QAAQ;YACtB,cAAc,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAA,aAAa,CAAC,OAAO;YACtD,cAAc,EAAE,CAAC,UAAkB,EAAE,OAAe,EAAE,cAAsB,EAAE,EAAE;gBAC/E,IAAI,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;oBACvC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,eAAe,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;oBACrE,OAAO,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,cAAc,MAAM,CAAC,CAAC;gBAC7D,CAAC;gBACD,OAAO,UAAU,CAAC;YACnB,CAAC;SACD;QACD;YACC,YAAY,EAAE,SAAS;YACvB,cAAc,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAA,kBAAkB,CAAC,gBAAgB;SACpE;KACD,CAAC;IAEF,SAAgB,mBAAmB,CAAC,UAAkB,EAAE,YAAoB,EAAE,OAAe;QAC5F,+DAA+D;QAC/D,gEAAgE;QAChE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,YAAY,CAAC;YAAE,OAAO,UAAU,CAAC;QAE1D,2FAA2F;QAC3F,MAAM,cAAc,GAAG,eAAe,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY;QAClE,MAAM,cAAc,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB;QAEhE,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACvC,IAAI,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC/C,UAAU,GAAG,UAAU,CAAC,OAAO,CAC9B,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,cAAc,CAAC,EAAE,GAAG,CAAC,EACvD,KAAK,cAAc,IAAI,CACvB,CAAC;gBAEF,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;oBAC5B,UAAU,GAAG,OAAO,CAAC,cAAc,CAAC,UAAU,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;gBAC1E,CAAC;YACF,CAAC;QACF,CAAC;QACD,OAAO,UAAU,CAAC;IACnB,CAAC;IAED,SAAS,wBAAwB,CAAC,QAAgB,EAAE,YAAsB;QACzE,IAAI,OAAO,GAAG,QAAQ;aACpB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC;aACpB,KAAK,CAAC,EAAE,CAAC;aACT,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aAC3C,IAAI,CAAC,EAAE,CAAC,CAAC;QAEX,IAAI,QAAQ,KAAK,OAAO;YAAE,OAAO,OAAO,CAAC;QAEzC,gFAAgF;QAChF,oFAAoF;QACpF,gFAAgF;QAChF,6FAA6F;QAC7F,EAAE;QACF,yDAAyD;QACzD,OAAO,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,IAAI,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvF,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,SAAS,uBAAuB,CAAC,IAAY;QAC5C,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9C,QAAQ,MAAM,CAAC,WAAW,EAAE,EAAE,CAAC;YAC9B,KAAK,MAAM;gBACV,OAAO,MAAM,CAAC;YACf,KAAK,OAAO,CAAC;YACb,KAAK,MAAM;gBACV,OAAO,GAAG,MAAM,MAAM,CAAC;YACxB,KAAK,KAAK;gBACT,OAAO,GAAG,MAAM,OAAO,CAAC;QAC1B,CAAC;QAED,+BAA+B;QAC/B,OAAO,GAAG,MAAM,IAAI,WAAW,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;IAC9D,CAAC;IAED,SAAS,sBAAsB,CAC9B,kBAA0B,EAC1B,oBAAmC,EACnC,eAA8B,EAC9B,aAAqB;QAErB,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEhD,gDAAgD;QAChD,MAAM,UAAU,GAAG,oBAAoB,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;QACxF,MAAM,oBAAoB,GAAG,kBAAkB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,oBAAoB,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtF,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,oBAAoB,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;QAErE,kFAAkF;QAClF,mDAAmD;QACnD,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;YAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,OAAO,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC;gBAC5C,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;oBAAE,MAAM;YACjE,CAAC;YACD,OAAO;gBACN,oBAAoB,EAAE,IAAI;gBAC1B,kBAAkB,EAAE,GAAG,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,yCAAyC;gBACvH,iBAAiB,EAAE,GAAG,SAAS,EAAE,EAAE,QAAQ;gBAC3C,eAAe,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc;aACxE,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,6GAA6G;YAC7G,wDAAwD;YACxD,8EAA8E;YAC9E,qDAAqD;YACrD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,6FAA6F;QAC7F,sEAAsE;QACtE,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEnE,IAAI,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,4EAA4E;gBAC5E,uFAAuF;gBACvF,wDAAwD;gBACxD,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC9B,OAAO;oBACN,oBAAoB;oBACpB,kBAAkB,EAAE,GAAG,SAAS,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,mBAAmB;oBACnE,iBAAiB,EAAE,MAAM,aAAa,MAAM,cAAc,OAAO,EAAE,2BAA2B;oBAC9F,eAAe,EAAE,GAAG,eAAe,IAAI,uBAAuB,CAAC,YAAY,CAAC,EAAE,EAAE,+CAA+C;iBAC/H,CAAC;YACH,CAAC;iBAAM,CAAC;gBACP,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAChD,IAAI,QAAQ,GAAG,CAAC,CAAC;oBACjB,OAAO,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC;wBAC5C,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;4BAAE,MAAM;oBACjE,CAAC;oBACD,qGAAqG;oBACrG,MAAM,kBAAkB,GACvB,KAAK,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpE,OAAO;wBACN,oBAAoB;wBACpB,kBAAkB,EAAE,GAAG,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,sDAAsD;wBACpI,iBAAiB,EAAE,MAAM,aAAa,MAAM,cAAc,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB;wBACjG,eAAe,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,kBAAkB,EAAE,wCAAwC;qBAClH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACP,oGAAoG;oBACpG,gHAAgH;oBAChH,OAAO;wBACN,oBAAoB;wBACpB,kBAAkB,EAAE,GAAG,SAAS,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,mBAAmB;wBACnE,iBAAiB,EAAE,MAAM,aAAa,MAAM,cAAc,OAAO,EAAE,4BAA4B;wBAC/F,eAAe,EAAE,GAAG,eAAe,IAAI,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,qBAAqB;qBACjG,CAAC;gBACH,CAAC;YACF,CAAC;QACF,CAAC;QAED,6DAA6D;QAC7D,MAAM,iBAAiB,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACrC,OAAO;gBACN,oBAAoB;gBACpB,kBAAkB,EAAE,GAAG,SAAS,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,sBAAsB;gBACtE,iBAAiB,EAAE,MAAM,aAAa,iBAAiB,EAAE,sBAAsB;gBAC/E,eAAe,EAAE,GAAG,eAAe,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,sBAAsB;aACzE,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,sDAAsD;QACtD,yCAAyC;QACzC,sDAAsD;QACtD,EAAE;QACF,2DAA2D;QAC3D,OAAO,IAAI,CAAC;IACb,CAAC;IAED,wGAAwG;IACxG,SAAS,0BAA0B,CAAC,UAAkB,EAAE,UAAkB,EAAE,QAAgB;QAC3F,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC3D,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAClC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QAE5B,0EAA0E;QAC1E,4DAA4D;QAC5D,IAAI,kBAAkB,GAAG,QAAQ,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9E,6EAA6E;QAC7E,IAAI,UAAU,CAAC,kBAAkB,GAAG,CAAC,CAAC,KAAK,GAAG;YAAE,kBAAkB,IAAI,CAAC,CAAC;QACxE,MAAM,cAAc,GAAG,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;QAC5D,MAAM,qBAAqB,GAAG,mBAAmB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAEvE,2EAA2E;QAC3E,IAAI,CAAC,qBAAqB;YAAE,OAAO,IAAI,CAAC;QAExC,OAAO,UAAU,CAAC,KAAK,CAAC,UAAU,EAAE,kBAAkB,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IACvF,CAAC;IAED,iFAAiF;IACjF,4CAA4C;IAC5C,SAAS,mBAAmB,CAC3B,KAAsB,EACtB,UAAkB,EAClB,SAAmB,EACnB,aAAqB;QAErB,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC;QAC/B,MAAM,QAAQ,GAAG,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QAClD,6DAA6D;QAC7D,uCAAuC;QACvC,MAAM,oBAAoB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEtC,4EAA4E;QAC5E,sBAAsB;QACtB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,oBAAoB,CAAC;YAAE,OAAO,IAAI,CAAC;QAE3D,MAAM,SAAS,GAAG,0BAA0B,CAAC,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC/E,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAEpC,OAAO,sBAAsB,CAC5B,SAAS,EACT,oBAAoB,EACpB,wBAAwB,CAAC,oBAAoB,EAAE,SAAS,CAAC,EACzD,aAAa,CACb,CAAC;IACH,CAAC;IAED,gGAAgG;IAChG,SAAS,eAAe,CAAC,KAAsB,EAAE,UAAkB,EAAE,aAAqB;QACzF,MAAM,SAAS,GAAG,0BAA0B,CAC3C,UAAU,EACV,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CACjC,CAAC;QACF,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACpC,OAAO,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;IACrE,CAAC;IAED,8FAA8F;IAC9F,SAAS,2BAA2B,CACnC,UAAkB,EAClB,WAAiD,EACjD,SAAmB,EACnB,aAAqB,EACrB,UAAmB;QAEnB,MAAM,MAAM,GAAwB,EAAE,CAAC;QAEvC,KAAK,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC7C,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAAE,SAAS;YAE5C,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACvD,MAAM,CAAC,IAAI,CACV,GAAG,OAAO;iBACR,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;iBACxE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAC3B,CAAC;QACH,CAAC;QAED,IAAI,UAAU,IAAI,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAChD,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACrD,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;gBAC9D,IAAI,GAAG;oBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;QACF,CAAC;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAED,oEAAoE;IACpE,SAAS,qBAAqB,CAC7B,cAAsC,EACtC,MAA0C,EAC1C,UAAmB;QAEnB,MAAM,MAAM,GAA4B,EAAE,CAAC;QAE3C,IAAI,OAAO,cAAc,KAAK,QAAQ,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;YACnE,IACC,OAAO,cAAc,KAAK,QAAQ;gBAClC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,UAAU,KAAK,QAAQ,CAAC,EAC5D,CAAC;gBACF,MAAM,OAAO,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;gBACvC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3B,CAAC;YACD,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACxB,CAAC;QAED,MAAM,WAAW,GAAG,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;YAC3D,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,GAAG,qBAAqB,CAAC,KAA+B,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YAC3F,MAAM,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;YACtB,WAAW,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC9B,CAAC;IAED,qDAAqD;IACrD,SAAS,iBAAiB,CAAC,IAAyB,EAAE,YAAsB;QAC3E,wDAAwD;QACxD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAA6B,CAAC;QAChE,MAAM,qBAAqB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAExD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC5B,MAAM,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,GAAG,OAAO,CAAC;YAChF,IAAI,EAAE,eAAe,EAAE,GAAG,OAAO,CAAC;YAClC,MAAM,iBAAiB,GAAG,CAAC,GAAW,EAAE,EAAE;gBACzC,MAAM,KAAK,GAAG,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC1C,IAAI,CAAC,KAAK;oBAAE,OAAO,KAAK,CAAC;gBACzB,OAAO,CAAC,IAAA,iBAAO,EAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACjC,CAAC,CAAC;YAEF,8FAA8F;YAC9F,kFAAkF;YAClF,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,iBAAiB,IAAI,eAAe,EAAE,CAAC;YAE5D,wEAAwE;YACxE,+CAA+C;YAC/C,gEAAgE;YAChE,IAAI,iBAAiB,CAAC,GAAG,EAAE,CAAC,IAAI,oBAAoB,EAAE,CAAC;gBACtD,eAAe,GAAG,GAAG,wBAAwB,CAAC,oBAAoB,EAAE,YAAY,CAAC,IAAI,eAAe,EAAE,CAAC;YACxG,CAAC;YACD,uHAAuH;YACvH,OAAO,iBAAiB,CAAC,GAAG,EAAE,CAAC;gBAAE,eAAe,IAAI,IAAI,CAAC;YAEzD,kBAAkB,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE;gBAC7B,kBAAkB;gBAClB,oBAAoB;gBACpB,eAAe;gBACf,iBAAiB;aACjB,CAAC,CAAC;YACH,qBAAqB,CAAC,GAAG,CAAC,kBAAkB,EAAE,GAAG,EAAE,CAAC,CAAC;QACtD,CAAC;QAED,OAAO;YACN,kBAAkB;YAClB,qBAAqB;SACrB,CAAC;IACH,CAAC;IAED,gGAAgG;IAChG,SAAS,yBAAyB,CAAC,IAAW,EAAE,uBAAgD;QAC/F,MAAM,YAAY,GAAwB,EAAE,CAAC;QAE7C,MAAM,YAAY,GAAG,CACpB,UAAkC,EAClC,OAAgC,EACP,EAAE;YAC3B,IAAI,CAAC,OAAO;gBAAE,OAAO,UAAU,CAAC;YAChC,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;gBAC3D,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;oBAC9D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;wBAC9B,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,kBAAkB,CAAC;4BAAE,SAAS;wBAC9D,UAAU,GAAG,UAAU,CAAC,UAAU,CACjC,MAAM,CAAC,kBAAkB,EACzB,GAAG,MAAM,CAAC,iBAAiB,IAAI,MAAM,CAAC,eAAe,EAAE,CACvD,CAAC;wBACF,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC3B,CAAC;gBACF,CAAC;gBACD,OAAO,UAAU,CAAC;YACnB,CAAC;YAED,iFAAiF;YACjF,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC5B,OAAO,UAAU,CAAC;YACnB,CAAC;YAED,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzF,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAoB,CAAC,CAAC;YACjF,CAAC;YAED,OAAO,IAAA,mBAAS,EAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAA2B,CAAC;QAC/F,CAAC,CAAC;QAEF,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,uBAAuB,CAAC,CAAC;QAE1E,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,UAAU,EAAW,EAAE,YAAY,EAAE,CAAC;IACnE,CAAC;IAED,kEAAkE;IAClE,SAAS,qBAAqB,CAC7B,OAAgC,EAChC,gBAAyE;QAEzE,IAAI,CAAC,OAAO;YAAE,OAAO;QACrB,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5B,oFAAoF;YACpF,OAAO,OAAO;iBACZ,GAAG,CAAC,gBAAgB,CAAC;iBACrB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;iBAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,IAAA,mBAAS,EAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,qBAAqB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED;;;;;;;;;OASG;IACH,SAAgB,kCAAkC,CACjD,QAAiB,EACjB,SAAmB,EACnB,iBAAyB,EACzB,mBAA8B;QAE9B,IAAI;QACJ,qCAAqC;QACrC,IAAI;QACJ,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,aAAa,CAAC,QAAQ,CAAC,iBAAiB,CAAC;YAC5C,MAAM,IAAI,yBAAgB,CACzB,iBAAiB,iBAAiB,iCAAiC,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,CAClG,CAAC;QAEH,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,yBAAgB,CACzB,mEAAmE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,mDAAmD,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,GAAG,CAC/K,CAAC;QACH,CAAC;QAED,IAAI;QACJ,iDAAiD;QACjD,IAAI;QAEJ,4FAA4F;QAC5F,8BAA8B;QAC9B,MAAM,WAAW,GAAG,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,sBAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACtE,MAAM,WAAW,GAAG,eAAe,CAAC,GAAG,CACtC,CAAC,OAAO,EAAE,EAAE,CACX;YACC,OAAO,CAAC,YAAY;YACpB,8EAA8E;YAC9E,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC;SACrD,CACX,CAAC;QAEF,IAAI;QACJ,mEAAmE;QACnE,IAAI;QAEJ,kEAAkE;QAClE,mFAAmF;QACnF,MAAM,0BAA0B,GAAG,IAAI,GAAG,EAAmC,CAAC;QAC9E,+EAA+E;QAC/E,MAAM,OAAO,GAAG,EAAE,CAAC;QAEnB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC,GAAG,qBAAqB,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CACpF,2BAA2B,CAC1B,CAAC,EACD,WAAW,EACX,SAAS,EACT,iBAAiB,EACjB,mBAAmB,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CACjD,CACD,CAAC;YACF,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;YAC5D,OAAO,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAC9B,CAAC;QAED,IAAI;QACJ,gEAAgE;QAChE,IAAI;QAEJ,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;QACjD,MAAM,uBAAuB,GAAG,OAAO,CAAC,MAAM;QAC7C,qFAAqF;QACrF,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAChF,CAAC;QACF,MAAM,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,GAAG,iBAAiB,CACtE,uBAAuB,EACvB,SAAS,CACT,CAAC;QAEF,IAAI;QACJ,yEAAyE;QACzE,IAAI;QAEJ,6FAA6F;QAC7F,gDAAgD;QAChD,MAAM,gBAAgB,GAAG,CAAC,CAAoB,EAAE,EAAE;YACjD,MAAM,GAAG,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;YAC5D,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,CAAC,CAAC;QAEF,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,0BAA0B,CAAC,OAAO,EAAE,EAAE,CAAC;YACjE,0BAA0B,CAAC,GAAG,CAAC,GAAG,EAAE,qBAAqB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC;QACrF,CAAC;QAED,MAAM,eAAe,GAAG,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,yBAAyB,CACzD,IAAA,mBAAS,EAAC,IAAI,CAAC,EACf,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CACzC,CAAC;YACF,eAAe,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;QACjG,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IACrC,CAAC"}

package/dist/{observable-object.d.ts → cjs/observable-object.d.ts}

@@ -4,3 +4,4 @@ interface IObservableOptions {
 }
 export declare function create(target: IDataObject, parent?: IObservableObject, option?: IObservableOptions, depth?: number): IDataObject;
 export {};
+//# sourceMappingURL=observable-object.d.ts.map

package/dist/cjs/observable-object.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"observable-object.d.ts","sourceRoot":"","sources":["../../src/observable-object.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEnE,UAAU,kBAAkB;IAC3B,uBAAuB,CAAC,EAAE,OAAO,CAAC;CAClC;AAED,wBAAgB,MAAM,CACrB,MAAM,EAAE,WAAW,EACnB,MAAM,CAAC,EAAE,iBAAiB,EAC1B,MAAM,CAAC,EAAE,kBAAkB,EAC3B,KAAK,CAAC,EAAE,MAAM,GACZ,WAAW,CA6Db"}

package/dist/cjs/observable-object.js

@@ -0,0 +1,72 @@
+/* eslint-disable @typescript-eslint/no-unsafe-return */
+/* eslint-disable @typescript-eslint/no-shadow */
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.create = create;
+    function create(target, parent, option, depth) {
+        // eslint-disable-next-line @typescript-eslint/prefer-nullish-coalescing
+        depth = depth || 0;
+        // Make all the children of target also observable
+        for (const key in target) {
+            if (typeof target[key] === 'object' && target[key] !== null) {
+                target[key] = create(target[key], 
+                // eslint-disable-next-line @typescript-eslint/prefer-nullish-coalescing
+                (parent || target), option, depth + 1);
+            }
+        }
+        Object.defineProperty(target, '__dataChanged', {
+            value: false,
+            writable: true,
+        });
+        return new Proxy(target, {
+            deleteProperty(target, name) {
+                if (parent === undefined) {
+                    // If no parent is given mark current data as changed
+                    target.__dataChanged = true;
+                }
+                else {
+                    // If parent is given mark the parent data as changed
+                    parent.__dataChanged = true;
+                }
+                return Reflect.deleteProperty(target, name);
+            },
+            get(target, name, receiver) {
+                return Reflect.get(target, name, receiver);
+            },
+            has(target, key) {
+                return Reflect.has(target, key);
+            },
+            set(target, name, value) {
+                if (parent === undefined) {
+                    // If no parent is given mark current data as changed
+                    if (option !== undefined &&
+                        option.ignoreEmptyOnFirstChild === true &&
+                        depth === 0 &&
+                        target[name.toString()] === undefined &&
+                        typeof value === 'object' &&
+                        // eslint-disable-next-line @typescript-eslint/no-unsafe-argument
+                        Object.keys(value).length === 0) {
+                    }
+                    else {
+                        target.__dataChanged = true;
+                    }
+                }
+                else {
+                    // If parent is given mark the parent data as changed
+                    parent.__dataChanged = true;
+                }
+                return Reflect.set(target, name, value);
+            },
+        });
+    }
+});
+//# sourceMappingURL=observable-object.js.map

package/dist/cjs/observable-object.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"observable-object.js","sourceRoot":"","sources":["../../src/observable-object.ts"],"names":[],"mappings":"AAAA,wDAAwD;AACxD,iDAAiD;;;;;;;;;;;;IAQjD,wBAkEC;IAlED,SAAgB,MAAM,CACrB,MAAmB,EACnB,MAA0B,EAC1B,MAA2B,EAC3B,KAAc;QAEd,wEAAwE;QACxE,KAAK,GAAG,KAAK,IAAI,CAAC,CAAC;QAEnB,kDAAkD;QAElD,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC7D,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CACnB,MAAM,CAAC,GAAG,CAAgB;gBAC1B,wEAAwE;gBACxE,CAAC,MAAM,IAAI,MAAM,CAAsB,EACvC,MAAM,EACN,KAAK,GAAG,CAAC,CACT,CAAC;YACH,CAAC;QACF,CAAC;QAED,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,eAAe,EAAE;YAC9C,KAAK,EAAE,KAAK;YACZ,QAAQ,EAAE,IAAI;SACd,CAAC,CAAC;QACH,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE;YACxB,cAAc,CAAC,MAAM,EAAE,IAAI;gBAC1B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBAC1B,qDAAqD;oBACpD,MAA4B,CAAC,aAAa,GAAG,IAAI,CAAC;gBACpD,CAAC;qBAAM,CAAC;oBACP,qDAAqD;oBACrD,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;gBAC7B,CAAC;gBACD,OAAO,OAAO,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7C,CAAC;YACD,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ;gBACzB,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC5C,CAAC;YACD,GAAG,CAAC,MAAM,EAAE,GAAG;gBACd,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACjC,CAAC;YACD,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK;gBACtB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBAC1B,qDAAqD;oBACrD,IACC,MAAM,KAAK,SAAS;wBACpB,MAAM,CAAC,uBAAuB,KAAK,IAAI;wBACvC,KAAK,KAAK,CAAC;wBACX,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,KAAK,SAAS;wBACrC,OAAO,KAAK,KAAK,QAAQ;wBACzB,iEAAiE;wBACjE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAC9B,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,MAA4B,CAAC,aAAa,GAAG,IAAI,CAAC;oBACpD,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,qDAAqD;oBACrD,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;gBAC7B,CAAC;gBACD,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACzC,CAAC;SACD,CAAC,CAAC;IACJ,CAAC"}

package/dist/{result.d.ts → cjs/result.d.ts}

@@ -9,4 +9,11 @@ export type ResultError<E> = {
 export type Result<T, E> = ResultOk<T> | ResultError<E>;
 export declare const createResultOk: <T>(data: T) => ResultOk<T>;
 export declare const createResultError: <E = unknown>(error: E) => ResultError<E>;
+/**
+ * Executes the given function and converts it to a Result object.
+ *
+ * @example
+ * const result = toResult(() => fs.writeFileSync('file.txt', 'Hello, World!'));
+ */
 export declare const toResult: <T, E extends Error = Error>(fn: () => T) => Result<T, E>;
+//# sourceMappingURL=result.d.ts.map

package/dist/cjs/result.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.d.ts","sourceRoot":"","sources":["../../src/result.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,MAAM,EAAE,CAAC,CAAA;CAAE,CAAC;AAClD,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,CAAC,CAAA;CAAE,CAAC;AACrD,MAAM,MAAM,MAAM,CAAC,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;AAExD,eAAO,MAAM,cAAc,GAAI,CAAC,EAAE,MAAM,CAAC,KAAG,QAAQ,CAAC,CAAC,CAGpD,CAAC;AAEH,eAAO,MAAM,iBAAiB,GAAI,CAAC,GAAG,OAAO,EAAE,OAAO,CAAC,KAAG,WAAW,CAAC,CAAC,CAGrE,CAAC;AAEH;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,CAAC,SAAS,KAAK,GAAG,KAAK,EAAE,IAAI,MAAM,CAAC,KAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAO7E,CAAC"}

package/dist/cjs/result.js

@@ -0,0 +1,41 @@
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports", "./errors"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.toResult = exports.createResultError = exports.createResultOk = void 0;
+    const errors_1 = require("./errors");
+    const createResultOk = (data) => ({
+        ok: true,
+        result: data,
+    });
+    exports.createResultOk = createResultOk;
+    const createResultError = (error) => ({
+        ok: false,
+        error,
+    });
+    exports.createResultError = createResultError;
+    /**
+     * Executes the given function and converts it to a Result object.
+     *
+     * @example
+     * const result = toResult(() => fs.writeFileSync('file.txt', 'Hello, World!'));
+     */
+    const toResult = (fn) => {
+        try {
+            return (0, exports.createResultOk)(fn());
+        }
+        catch (e) {
+            const error = (0, errors_1.ensureError)(e);
+            return (0, exports.createResultError)(error);
+        }
+    };
+    exports.toResult = toResult;
+});
+//# sourceMappingURL=result.js.map

package/dist/cjs/result.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.js","sourceRoot":"","sources":["../../src/result.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,qCAAuC;IAMhC,MAAM,cAAc,GAAG,CAAI,IAAO,EAAe,EAAE,CAAC,CAAC;QAC3D,EAAE,EAAE,IAAI;QACR,MAAM,EAAE,IAAI;KACZ,CAAC,CAAC;IAHU,QAAA,cAAc,kBAGxB;IAEI,MAAM,iBAAiB,GAAG,CAAc,KAAQ,EAAkB,EAAE,CAAC,CAAC;QAC5E,EAAE,EAAE,KAAK;QACT,KAAK;KACL,CAAC,CAAC;IAHU,QAAA,iBAAiB,qBAG3B;IAEH;;;;;OAKG;IACI,MAAM,QAAQ,GAAG,CAA6B,EAAW,EAAgB,EAAE;QACjF,IAAI,CAAC;YACJ,OAAO,IAAA,sBAAc,EAAI,EAAE,EAAE,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACZ,MAAM,KAAK,GAAG,IAAA,oBAAW,EAAC,CAAC,CAAC,CAAC;YAC7B,OAAO,IAAA,yBAAiB,EAAI,KAAU,CAAC,CAAC;QACzC,CAAC;IACF,CAAC,CAAC;IAPW,QAAA,QAAQ,YAOnB"}