repoburg 1.0.67 → 1.0.69

package/backend/node_modules/@typescript-eslint/eslint-plugin/dist/rules/prefer-optional-chain-utils/analyzeChain.js

@@ -1,417 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.analyzeChain = void 0;
-const utils_1 = require("@typescript-eslint/utils");
-const ts_api_utils_1 = require("ts-api-utils");
-const ts = __importStar(require("typescript"));
-const util_1 = require("../../util");
-const compareNodes_1 = require("./compareNodes");
-function includesType(parserServices, node, typeFlagIn) {
-    const typeFlag = typeFlagIn | ts.TypeFlags.Any | ts.TypeFlags.Unknown;
-    const types = (0, ts_api_utils_1.unionTypeParts)(parserServices.getTypeAtLocation(node));
-    for (const type of types) {
-        if ((0, util_1.isTypeFlagSet)(type, typeFlag)) {
-            return true;
-        }
-    }
-    return false;
-}
-const analyzeAndChainOperand = (parserServices, operand, index, chain) => {
-    switch (operand.comparisonType) {
-        case "Boolean" /* NullishComparisonType.Boolean */:
-        case "NotEqualNullOrUndefined" /* NullishComparisonType.NotEqualNullOrUndefined */:
-            return [operand];
-        case "NotStrictEqualNull" /* NullishComparisonType.NotStrictEqualNull */: {
-            // handle `x !== null && x !== undefined`
-            const nextOperand = chain[index + 1];
-            if (nextOperand?.comparisonType ===
-                "NotStrictEqualUndefined" /* NullishComparisonType.NotStrictEqualUndefined */ &&
-                (0, compareNodes_1.compareNodes)(operand.comparedName, nextOperand.comparedName) ===
-                    "Equal" /* NodeComparisonResult.Equal */) {
-                return [operand, nextOperand];
-            }
-            if (includesType(parserServices, operand.comparedName, ts.TypeFlags.Undefined)) {
-                // we know the next operand is not an `undefined` check and that this
-                // operand includes `undefined` - which means that making this an
-                // optional chain would change the runtime behavior of the expression
-                return null;
-            }
-            return [operand];
-        }
-        case "NotStrictEqualUndefined" /* NullishComparisonType.NotStrictEqualUndefined */: {
-            // handle `x !== undefined && x !== null`
-            const nextOperand = chain[index + 1];
-            if (nextOperand?.comparisonType ===
-                "NotStrictEqualNull" /* NullishComparisonType.NotStrictEqualNull */ &&
-                (0, compareNodes_1.compareNodes)(operand.comparedName, nextOperand.comparedName) ===
-                    "Equal" /* NodeComparisonResult.Equal */) {
-                return [operand, nextOperand];
-            }
-            if (includesType(parserServices, operand.comparedName, ts.TypeFlags.Null)) {
-                // we know the next operand is not a `null` check and that this
-                // operand includes `null` - which means that making this an
-                // optional chain would change the runtime behavior of the expression
-                return null;
-            }
-            return [operand];
-        }
-        default:
-            return null;
-    }
-};
-const analyzeOrChainOperand = (parserServices, operand, index, chain) => {
-    switch (operand.comparisonType) {
-        case "NotBoolean" /* NullishComparisonType.NotBoolean */:
-        case "EqualNullOrUndefined" /* NullishComparisonType.EqualNullOrUndefined */:
-            return [operand];
-        case "StrictEqualNull" /* NullishComparisonType.StrictEqualNull */: {
-            // handle `x === null || x === undefined`
-            const nextOperand = chain[index + 1];
-            if (nextOperand?.comparisonType ===
-                "StrictEqualUndefined" /* NullishComparisonType.StrictEqualUndefined */ &&
-                (0, compareNodes_1.compareNodes)(operand.comparedName, nextOperand.comparedName) ===
-                    "Equal" /* NodeComparisonResult.Equal */) {
-                return [operand, nextOperand];
-            }
-            if (includesType(parserServices, operand.comparedName, ts.TypeFlags.Undefined)) {
-                // we know the next operand is not an `undefined` check and that this
-                // operand includes `undefined` - which means that making this an
-                // optional chain would change the runtime behavior of the expression
-                return null;
-            }
-            return [operand];
-        }
-        case "StrictEqualUndefined" /* NullishComparisonType.StrictEqualUndefined */: {
-            // handle `x === undefined || x === null`
-            const nextOperand = chain[index + 1];
-            if (nextOperand?.comparisonType === "StrictEqualNull" /* NullishComparisonType.StrictEqualNull */ &&
-                (0, compareNodes_1.compareNodes)(operand.comparedName, nextOperand.comparedName) ===
-                    "Equal" /* NodeComparisonResult.Equal */) {
-                return [operand, nextOperand];
-            }
-            if (includesType(parserServices, operand.comparedName, ts.TypeFlags.Null)) {
-                // we know the next operand is not a `null` check and that this
-                // operand includes `null` - which means that making this an
-                // optional chain would change the runtime behavior of the expression
-                return null;
-            }
-            return [operand];
-        }
-        default:
-            return null;
-    }
-};
-function getFixer(sourceCode, parserServices, operator, options, chain) {
-    const lastOperand = chain[chain.length - 1];
-    let useSuggestionFixer;
-    if (options.allowPotentiallyUnsafeFixesThatModifyTheReturnTypeIKnowWhatImDoing ===
-        true) {
-        // user has opted-in to the unsafe behavior
-        useSuggestionFixer = false;
-    }
-    else {
-        // optional chain specifically will union `undefined` into the final type
-        // so we need to make sure that there is at least one operand that includes
-        // `undefined`, or else we're going to change the final type - which is
-        // unsafe and might cause downstream type errors.
-        if (lastOperand.comparisonType ===
-            "EqualNullOrUndefined" /* NullishComparisonType.EqualNullOrUndefined */ ||
-            lastOperand.comparisonType ===
-                "NotEqualNullOrUndefined" /* NullishComparisonType.NotEqualNullOrUndefined */ ||
-            lastOperand.comparisonType ===
-                "StrictEqualUndefined" /* NullishComparisonType.StrictEqualUndefined */ ||
-            lastOperand.comparisonType ===
-                "NotStrictEqualUndefined" /* NullishComparisonType.NotStrictEqualUndefined */ ||
-            (operator === '||' &&
-                lastOperand.comparisonType === "NotBoolean" /* NullishComparisonType.NotBoolean */)) {
-            // we know the last operand is an equality check - so the change in types
-            // DOES NOT matter and will not change the runtime result or cause a type
-            // check error
-            useSuggestionFixer = false;
-        }
-        else {
-            useSuggestionFixer = true;
-            for (const operand of chain) {
-                if (includesType(parserServices, operand.node, ts.TypeFlags.Undefined)) {
-                    useSuggestionFixer = false;
-                    break;
-                }
-            }
-            // TODO - we could further reduce the false-positive rate of this check by
-            //        checking for cases where the change in types don't matter like
-            //        the test location of an if/while/etc statement.
-            //        but it's quite complex to do this without false-negatives, so
-            //        for now we'll just be over-eager with our matching.
-            //
-            //        it's MUCH better to false-positive here and only provide a
-            //        suggestion fixer, rather than false-negative and autofix to
-            //        broken code.
-        }
-    }
-    // In its most naive form we could just slap `?.` for every single part of the
-    // chain. However this would be undesirable because it'd create unnecessary
-    // conditions in the user's code where there were none before - and it would
-    // cause errors with rules like our `no-unnecessary-condition`.
-    //
-    // Instead we want to include the minimum number of `?.` required to correctly
-    // unify the code into a single chain. Naively you might think that we can
-    // just take the final operand add `?.` after the locations from the previous
-    // operands - however this won't be correct either because earlier operands
-    // can include a necessary `?.` that's not needed or included in a later
-    // operand.
-    //
-    // So instead what we need to do is to start at the first operand and
-    // iteratively diff it against the next operand, and add the difference to the
-    // first operand.
-    //
-    // eg
-    // `foo && foo.bar && foo.bar.baz?.bam && foo.bar.baz.bam()`
-    // 1) `foo`
-    // 2) diff(`foo`, `foo.bar`) = `.bar`
-    // 3) result = `foo?.bar`
-    // 4) diff(`foo.bar`, `foo.bar.baz?.bam`) = `.baz?.bam`
-    // 5) result = `foo?.bar?.baz?.bam`
-    // 6) diff(`foo.bar.baz?.bam`, `foo.bar.baz.bam()`) = `()`
-    // 7) result = `foo?.bar?.baz?.bam?.()`
-    const parts = [];
-    for (const current of chain) {
-        const nextOperand = flattenChainExpression(sourceCode, current.comparedName);
-        const diff = nextOperand.slice(parts.length);
-        if (diff.length > 0) {
-            if (parts.length > 0) {
-                // we need to make the first operand of the diff optional so it matches the
-                // logic before merging
-                // foo.bar && foo.bar.baz
-                // diff = .baz
-                // result = foo.bar?.baz
-                diff[0].optional = true;
-            }
-            parts.push(...diff);
-        }
-    }
-    let newCode = parts
-        .map(part => {
-        let str = '';
-        if (part.optional) {
-            str += '?.';
-        }
-        else {
-            if (part.nonNull) {
-                str += '!';
-            }
-            if (part.requiresDot) {
-                str += '.';
-            }
-        }
-        if (part.precedence !== util_1.OperatorPrecedence.Invalid &&
-            part.precedence < util_1.OperatorPrecedence.Member) {
-            str += `(${part.text})`;
-        }
-        else {
-            str += part.text;
-        }
-        return str;
-    })
-        .join('');
-    if (lastOperand.node.type === utils_1.AST_NODE_TYPES.BinaryExpression) {
-        // retain the ending comparison for cases like
-        // x && x.a != null
-        // x && typeof x.a !== 'undefined'
-        const operator = lastOperand.node.operator;
-        const { left, right } = (() => {
-            if (lastOperand.isYoda) {
-                const unaryOperator = lastOperand.node.right.type === utils_1.AST_NODE_TYPES.UnaryExpression
-                    ? lastOperand.node.right.operator + ' '
-                    : '';
-                return {
-                    left: sourceCode.getText(lastOperand.node.left),
-                    right: unaryOperator + newCode,
-                };
-            }
-            const unaryOperator = lastOperand.node.left.type === utils_1.AST_NODE_TYPES.UnaryExpression
-                ? lastOperand.node.left.operator + ' '
-                : '';
-            return {
-                left: unaryOperator + newCode,
-                right: sourceCode.getText(lastOperand.node.right),
-            };
-        })();
-        newCode = `${left} ${operator} ${right}`;
-    }
-    else if (lastOperand.comparisonType === "NotBoolean" /* NullishComparisonType.NotBoolean */) {
-        newCode = `!${newCode}`;
-    }
-    const fix = fixer => fixer.replaceTextRange([chain[0].node.range[0], lastOperand.node.range[1]], newCode);
-    return useSuggestionFixer
-        ? { suggest: [{ fix, messageId: 'optionalChainSuggest' }] }
-        : { fix };
-    function flattenChainExpression(sourceCode, node) {
-        switch (node.type) {
-            case utils_1.AST_NODE_TYPES.ChainExpression:
-                return flattenChainExpression(sourceCode, node.expression);
-            case utils_1.AST_NODE_TYPES.CallExpression: {
-                const argumentsText = (() => {
-                    const closingParenToken = (0, util_1.nullThrows)(sourceCode.getLastToken(node), util_1.NullThrowsReasons.MissingToken('closing parenthesis', node.type));
-                    const openingParenToken = (0, util_1.nullThrows)(sourceCode.getFirstTokenBetween(node.typeArguments ?? node.callee, closingParenToken, util_1.isOpeningParenToken), util_1.NullThrowsReasons.MissingToken('opening parenthesis', node.type));
-                    return sourceCode.text.substring(openingParenToken.range[0], closingParenToken.range[1]);
-                })();
-                const typeArgumentsText = (() => {
-                    if (node.typeArguments == null) {
-                        return '';
-                    }
-                    return sourceCode.getText(node.typeArguments);
-                })();
-                return [
-                    ...flattenChainExpression(sourceCode, node.callee),
-                    {
-                        nonNull: false,
-                        optional: node.optional,
-                        // no precedence for this
-                        precedence: util_1.OperatorPrecedence.Invalid,
-                        requiresDot: false,
-                        text: typeArgumentsText + argumentsText,
-                    },
-                ];
-            }
-            case utils_1.AST_NODE_TYPES.MemberExpression: {
-                const propertyText = sourceCode.getText(node.property);
-                return [
-                    ...flattenChainExpression(sourceCode, node.object),
-                    {
-                        nonNull: node.object.type === utils_1.AST_NODE_TYPES.TSNonNullExpression,
-                        optional: node.optional,
-                        precedence: node.computed
-                            ? // computed is already wrapped in [] so no need to wrap in () as well
-                                util_1.OperatorPrecedence.Invalid
-                            : (0, util_1.getOperatorPrecedenceForNode)(node.property),
-                        requiresDot: !node.computed,
-                        text: node.computed ? `[${propertyText}]` : propertyText,
-                    },
-                ];
-            }
-            case utils_1.AST_NODE_TYPES.TSNonNullExpression:
-                return flattenChainExpression(sourceCode, node.expression);
-            default:
-                return [
-                    {
-                        nonNull: false,
-                        optional: false,
-                        precedence: (0, util_1.getOperatorPrecedenceForNode)(node),
-                        requiresDot: false,
-                        text: sourceCode.getText(node),
-                    },
-                ];
-        }
-    }
-}
-function analyzeChain(context, sourceCode, parserServices, options, operator, chain) {
-    // need at least 2 operands in a chain for it to be a chain
-    if (chain.length <= 1 ||
-        /* istanbul ignore next -- previous checks make this unreachable, but keep it for exhaustiveness check */
-        operator === '??') {
-        return;
-    }
-    const analyzeOperand = (() => {
-        switch (operator) {
-            case '&&':
-                return analyzeAndChainOperand;
-            case '||':
-                return analyzeOrChainOperand;
-        }
-    })();
-    let subChain = [];
-    const maybeReportThenReset = (newChainSeed) => {
-        if (subChain.length > 1) {
-            context.report({
-                messageId: 'preferOptionalChain',
-                loc: {
-                    start: subChain[0].node.loc.start,
-                    end: subChain[subChain.length - 1].node.loc.end,
-                },
-                ...getFixer(sourceCode, parserServices, operator, options, subChain),
-            });
-        }
-        // we've reached the end of a chain of logical expressions
-        // i.e. the current operand doesn't belong to the previous chain.
-        //
-        // we don't want to throw away the current operand otherwise we will skip it
-        // and that can cause us to miss chains. So instead we seed the new chain
-        // with the current operand
-        //
-        // eg this means we can catch cases like:
-        //     unrelated != null && foo != null && foo.bar != null;
-        //     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ first "chain"
-        //                          ^^^^^^^^^^^ newChainSeed
-        //                          ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ second chain
-        subChain = newChainSeed ? [...newChainSeed] : [];
-    };
-    for (let i = 0; i < chain.length; i += 1) {
-        const lastOperand = subChain[subChain.length - 1];
-        const operand = chain[i];
-        const validatedOperands = analyzeOperand(parserServices, operand, i, chain);
-        if (!validatedOperands) {
-            // TODO - #7170
-            // check if the name is a superset/equal - if it is, then it likely
-            // intended to be part of the chain and something we should include in the
-            // report, eg
-            //     foo == null || foo.bar;
-            //     ^^^^^^^^^^^ valid OR chain
-            //                    ^^^^^^^ invalid OR chain logical, but still part of
-            //                            the chain for combination purposes
-            maybeReportThenReset();
-            continue;
-        }
-        // in case multiple operands were consumed - make sure to correctly increment the index
-        i += validatedOperands.length - 1;
-        const currentOperand = validatedOperands[0];
-        if (lastOperand) {
-            const comparisonResult = (0, compareNodes_1.compareNodes)(lastOperand.comparedName, 
-            // purposely inspect and push the last operand because the prior operands don't matter
-            // this also means we won't false-positive in cases like
-            // foo !== null && foo !== undefined
-            validatedOperands[validatedOperands.length - 1].comparedName);
-            if (comparisonResult === "Subset" /* NodeComparisonResult.Subset */) {
-                // the operands are comparable, so we can continue searching
-                subChain.push(currentOperand);
-            }
-            else if (comparisonResult === "Invalid" /* NodeComparisonResult.Invalid */) {
-                maybeReportThenReset(validatedOperands);
-            }
-            else {
-                // purposely don't push this case because the node is a no-op and if
-                // we consider it then we might report on things like
-                // foo && foo
-            }
-        }
-        else {
-            subChain.push(currentOperand);
-        }
-    }
-    // check the leftovers
-    maybeReportThenReset();
-}
-exports.analyzeChain = analyzeChain;
-//# sourceMappingURL=analyzeChain.js.map

package/backend/node_modules/@typescript-eslint/eslint-plugin/dist/rules/prefer-optional-chain-utils/analyzeChain.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"analyzeChain.js","sourceRoot":"","sources":["../../../src/rules/prefer-optional-chain-utils/analyzeChain.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,oDAA0D;AAO1D,+CAA8C;AAC9C,+CAAiC;AAEjC,qCAOoB;AACpB,iDAAoE;AAQpE,SAAS,YAAY,CACnB,cAAiD,EACjD,IAAmB,EACnB,UAAwB;IAExB,MAAM,QAAQ,GAAG,UAAU,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC;IACtE,MAAM,KAAK,GAAG,IAAA,6BAAc,EAAC,cAAc,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;IACrE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAA,oBAAa,EAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAYD,MAAM,sBAAsB,GAAoB,CAC9C,cAAc,EACd,OAAO,EACP,KAAK,EACL,KAAK,EACL,EAAE;IACF,QAAQ,OAAO,CAAC,cAAc,EAAE,CAAC;QAC/B,mDAAmC;QACnC;YACE,OAAO,CAAC,OAAO,CAAC,CAAC;QAEnB,wEAA6C,CAAC,CAAC,CAAC;YAC9C,yCAAyC;YACzC,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAA6B,CAAC;YACjE,IACE,WAAW,EAAE,cAAc;6FACoB;gBAC/C,IAAA,2BAAY,EAAC,OAAO,CAAC,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC;4DAChC,EAC5B,CAAC;gBACD,OAAO,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAChC,CAAC;YACD,IACE,YAAY,CACV,cAAc,EACd,OAAO,CAAC,YAAY,EACpB,EAAE,CAAC,SAAS,CAAC,SAAS,CACvB,EACD,CAAC;gBACD,qEAAqE;gBACrE,iEAAiE;gBACjE,qEAAqE;gBACrE,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;QAED,kFAAkD,CAAC,CAAC,CAAC;YACnD,yCAAyC;YACzC,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAA6B,CAAC;YACjE,IACE,WAAW,EAAE,cAAc;mFACe;gBAC1C,IAAA,2BAAY,EAAC,OAAO,CAAC,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC;4DAChC,EAC5B,CAAC;gBACD,OAAO,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAChC,CAAC;YACD,IACE,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EACrE,CAAC;gBACD,+DAA+D;gBAC/D,4DAA4D;gBAC5D,qEAAqE;gBACrE,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;QAED;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC,CAAC;AACF,MAAM,qBAAqB,GAAoB,CAC7C,cAAc,EACd,OAAO,EACP,KAAK,EACL,KAAK,EACL,EAAE;IACF,QAAQ,OAAO,CAAC,cAAc,EAAE,CAAC;QAC/B,yDAAsC;QACtC;YACE,OAAO,CAAC,OAAO,CAAC,CAAC;QAEnB,kEAA0C,CAAC,CAAC,CAAC;YAC3C,yCAAyC;YACzC,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAA6B,CAAC;YACjE,IACE,WAAW,EAAE,cAAc;uFACiB;gBAC5C,IAAA,2BAAY,EAAC,OAAO,CAAC,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC;4DAChC,EAC5B,CAAC;gBACD,OAAO,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAChC,CAAC;YACD,IACE,YAAY,CACV,cAAc,EACd,OAAO,CAAC,YAAY,EACpB,EAAE,CAAC,SAAS,CAAC,SAAS,CACvB,EACD,CAAC;gBACD,qEAAqE;gBACrE,iEAAiE;gBACjE,qEAAqE;gBACrE,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;QAED,4EAA+C,CAAC,CAAC,CAAC;YAChD,yCAAyC;YACzC,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAA6B,CAAC;YACjE,IACE,WAAW,EAAE,cAAc,kEAA0C;gBACrE,IAAA,2BAAY,EAAC,OAAO,CAAC,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC;4DAChC,EAC5B,CAAC;gBACD,OAAO,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAChC,CAAC;YACD,IACE,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EACrE,CAAC;gBACD,+DAA+D;gBAC/D,4DAA4D;gBAC5D,qEAAqE;gBACrE,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;QAED;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC,CAAC;AAEF,SAAS,QAAQ,CACf,UAAsB,EACtB,cAAiD,EACjD,QAAqB,EACrB,OAAmC,EACnC,KAAqB;IAUrB,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE5C,IAAI,kBAA2B,CAAC;IAChC,IACE,OAAO,CAAC,kEAAkE;QAC1E,IAAI,EACJ,CAAC;QACD,2CAA2C;QAC3C,kBAAkB,GAAG,KAAK,CAAC;IAC7B,CAAC;SAAM,CAAC;QACN,yEAAyE;QACzE,2EAA2E;QAC3E,uEAAuE;QACvE,iDAAiD;QAEjD,IACE,WAAW,CAAC,cAAc;mFACkB;YAC5C,WAAW,CAAC,cAAc;6FACqB;YAC/C,WAAW,CAAC,cAAc;uFACkB;YAC5C,WAAW,CAAC,cAAc;6FACqB;YAC/C,CAAC,QAAQ,KAAK,IAAI;gBAChB,WAAW,CAAC,cAAc,wDAAqC,CAAC,EAClE,CAAC;YACD,yEAAyE;YACzE,yEAAyE;YACzE,cAAc;YACd,kBAAkB,GAAG,KAAK,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,kBAAkB,GAAG,IAAI,CAAC;YAE1B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;gBAC5B,IACE,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,EAClE,CAAC;oBACD,kBAAkB,GAAG,KAAK,CAAC;oBAC3B,MAAM;gBACR,CAAC;YACH,CAAC;YAED,0EAA0E;YAC1E,wEAAwE;YACxE,yDAAyD;YACzD,uEAAuE;YACvE,6DAA6D;YAC7D,EAAE;YACF,oEAAoE;YACpE,qEAAqE;YACrE,sBAAsB;QACxB,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,EAAE;IACF,8EAA8E;IAC9E,0EAA0E;IAC1E,6EAA6E;IAC7E,2EAA2E;IAC3E,wEAAwE;IACxE,WAAW;IACX,EAAE;IACF,qEAAqE;IACrE,8EAA8E;IAC9E,iBAAiB;IACjB,EAAE;IACF,KAAK;IACL,4DAA4D;IAC5D,WAAW;IACX,qCAAqC;IACrC,yBAAyB;IACzB,uDAAuD;IACvD,mCAAmC;IACnC,0DAA0D;IAC1D,uCAAuC;IAEvC,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAG,sBAAsB,CACxC,UAAU,EACV,OAAO,CAAC,YAAY,CACrB,CAAC;QACF,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,2EAA2E;gBAC3E,uBAAuB;gBACvB,yBAAyB;gBACzB,cAAc;gBACd,wBAAwB;gBACxB,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC1B,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,GAAG,KAAK;SAChB,GAAG,CAAC,IAAI,CAAC,EAAE;QACV,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,GAAG,IAAI,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,GAAG,IAAI,GAAG,CAAC;YACb,CAAC;YACD,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,GAAG,IAAI,GAAG,CAAC;YACb,CAAC;QACH,CAAC;QACD,IACE,IAAI,CAAC,UAAU,KAAK,yBAAkB,CAAC,OAAO;YAC9C,IAAI,CAAC,UAAU,GAAG,yBAAkB,CAAC,MAAM,EAC3C,CAAC;YACD,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;SACD,IAAI,CAAC,EAAE,CAAC,CAAC;IAEZ,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,KAAK,sBAAc,CAAC,gBAAgB,EAAE,CAAC;QAC9D,8CAA8C;QAC9C,mBAAmB;QACnB,kCAAkC;QAClC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC;QAC3C,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE;YAC5B,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;gBACvB,MAAM,aAAa,GACjB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,sBAAc,CAAC,eAAe;oBAC5D,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG;oBACvC,CAAC,CAAC,EAAE,CAAC;gBAET,OAAO;oBACL,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;oBAC/C,KAAK,EAAE,aAAa,GAAG,OAAO;iBAC/B,CAAC;YACJ,CAAC;YACD,MAAM,aAAa,GACjB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,sBAAc,CAAC,eAAe;gBAC3D,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,GAAG;gBACtC,CAAC,CAAC,EAAE,CAAC;YACT,OAAO;gBACL,IAAI,EAAE,aAAa,GAAG,OAAO;gBAC7B,KAAK,EAAE,UAAU,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;aAClD,CAAC;QACJ,CAAC,CAAC,EAAE,CAAC;QAEL,OAAO,GAAG,GAAG,IAAI,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;IAC3C,CAAC;SAAM,IAAI,WAAW,CAAC,cAAc,wDAAqC,EAAE,CAAC;QAC3E,OAAO,GAAG,IAAI,OAAO,EAAE,CAAC;IAC1B,CAAC;IAED,MAAM,GAAG,GAAsB,KAAK,CAAC,EAAE,CACrC,KAAK,CAAC,gBAAgB,CACpB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EACnD,OAAO,CACR,CAAC;IAEJ,OAAO,kBAAkB;QACvB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,sBAAsB,EAAE,CAAC,EAAE;QAC3D,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;IASZ,SAAS,sBAAsB,CAC7B,UAAsB,EACtB,IAAmB;QAEnB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,sBAAc,CAAC,eAAe;gBACjC,OAAO,sBAAsB,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAE7D,KAAK,sBAAc,CAAC,cAAc,CAAC,CAAC,CAAC;gBACnC,MAAM,aAAa,GAAG,CAAC,GAAG,EAAE;oBAC1B,MAAM,iBAAiB,GAAG,IAAA,iBAAU,EAClC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,EAC7B,wBAAiB,CAAC,YAAY,CAAC,qBAAqB,EAAE,IAAI,CAAC,IAAI,CAAC,CACjE,CAAC;oBACF,MAAM,iBAAiB,GAAG,IAAA,iBAAU,EAClC,UAAU,CAAC,oBAAoB,CAC7B,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,EACjC,iBAAiB,EACjB,0BAAmB,CACpB,EACD,wBAAiB,CAAC,YAAY,CAAC,qBAAqB,EAAE,IAAI,CAAC,IAAI,CAAC,CACjE,CAAC;oBACF,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,CAC9B,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,EAC1B,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAC3B,CAAC;gBACJ,CAAC,CAAC,EAAE,CAAC;gBAEL,MAAM,iBAAiB,GAAG,CAAC,GAAG,EAAE;oBAC9B,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,EAAE,CAAC;wBAC/B,OAAO,EAAE,CAAC;oBACZ,CAAC;oBAED,OAAO,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChD,CAAC,CAAC,EAAE,CAAC;gBAEL,OAAO;oBACL,GAAG,sBAAsB,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC;oBAClD;wBACE,OAAO,EAAE,KAAK;wBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;wBACvB,yBAAyB;wBACzB,UAAU,EAAE,yBAAkB,CAAC,OAAO;wBACtC,WAAW,EAAE,KAAK;wBAClB,IAAI,EAAE,iBAAiB,GAAG,aAAa;qBACxC;iBACF,CAAC;YACJ,CAAC;YAED,KAAK,sBAAc,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBACrC,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvD,OAAO;oBACL,GAAG,sBAAsB,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC;oBAClD;wBACE,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,sBAAc,CAAC,mBAAmB;wBAChE,QAAQ,EAAE,IAAI,CAAC,QAAQ;wBACvB,UAAU,EAAE,IAAI,CAAC,QAAQ;4BACvB,CAAC,CAAC,qEAAqE;gCACrE,yBAAkB,CAAC,OAAO;4BAC5B,CAAC,CAAC,IAAA,mCAA4B,EAAC,IAAI,CAAC,QAAQ,CAAC;wBAC/C,WAAW,EAAE,CAAC,IAAI,CAAC,QAAQ;wBAC3B,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC,YAAY;qBACzD;iBACF,CAAC;YACJ,CAAC;YAED,KAAK,sBAAc,CAAC,mBAAmB;gBACrC,OAAO,sBAAsB,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAE7D;gBACE,OAAO;oBACL;wBACE,OAAO,EAAE,KAAK;wBACd,QAAQ,EAAE,KAAK;wBACf,UAAU,EAAE,IAAA,mCAA4B,EAAC,IAAI,CAAC;wBAC9C,WAAW,EAAE,KAAK;wBAClB,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC;qBAC/B;iBACF,CAAC;QACN,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAgB,YAAY,CAC1B,OAGC,EACD,UAAsB,EACtB,cAAiD,EACjD,OAAmC,EACnC,QAAgD,EAChD,KAAqB;IAErB,2DAA2D;IAC3D,IACE,KAAK,CAAC,MAAM,IAAI,CAAC;QACjB,yGAAyG;QACzG,QAAQ,KAAK,IAAI,EACjB,CAAC;QACD,OAAO;IACT,CAAC;IAED,MAAM,cAAc,GAAG,CAAC,GAAG,EAAE;QAC3B,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,IAAI;gBACP,OAAO,sBAAsB,CAAC;YAEhC,KAAK,IAAI;gBACP,OAAO,qBAAqB,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,EAAE,CAAC;IAEL,IAAI,QAAQ,GAAmB,EAAE,CAAC;IAClC,MAAM,oBAAoB,GAAG,CAC3B,YAAsC,EAChC,EAAE;QACR,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,MAAM,CAAC;gBACb,SAAS,EAAE,qBAAqB;gBAChC,GAAG,EAAE;oBACH,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK;oBACjC,GAAG,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG;iBAChD;gBACD,GAAG,QAAQ,CAAC,UAAU,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC;aACrE,CAAC,CAAC;QACL,CAAC;QAED,0DAA0D;QAC1D,iEAAiE;QACjE,EAAE;QACF,4EAA4E;QAC5E,yEAAyE;QACzE,2BAA2B;QAC3B,EAAE;QACF,yCAAyC;QACzC,2DAA2D;QAC3D,qDAAqD;QACrD,oDAAoD;QACpD,uEAAuE;QACvE,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,CAAC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAEnC,CAAC;QACd,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEzB,MAAM,iBAAiB,GAAG,cAAc,CAAC,cAAc,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5E,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACvB,eAAe;YACf,mEAAmE;YACnE,0EAA0E;YAC1E,aAAa;YACb,8BAA8B;YAC9B,iCAAiC;YACjC,yEAAyE;YACzE,gEAAgE;YAEhE,oBAAoB,EAAE,CAAC;YACvB,SAAS;QACX,CAAC;QACD,uFAAuF;QACvF,CAAC,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;QAElC,MAAM,cAAc,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,gBAAgB,GAAG,IAAA,2BAAY,EACnC,WAAW,CAAC,YAAY;YACxB,sFAAsF;YACtF,wDAAwD;YACxD,oCAAoC;YACpC,iBAAiB,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,YAAY,CAC7D,CAAC;YACF,IAAI,gBAAgB,+CAAgC,EAAE,CAAC;gBACrD,4DAA4D;gBAC5D,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAChC,CAAC;iBAAM,IAAI,gBAAgB,iDAAiC,EAAE,CAAC;gBAC7D,oBAAoB,CAAC,iBAAiB,CAAC,CAAC;YAC1C,CAAC;iBAAM,CAAC;gBACN,oEAAoE;gBACpE,qDAAqD;gBACrD,aAAa;YACf,CAAC;QACH,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,oBAAoB,EAAE,CAAC;AACzB,CAAC;AA7GD,oCA6GC"}