@clear-capabilities/agentic-security-scanner 0.149.1 → 0.149.4

package/vendor/java-parser/node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_engine.js

@@ -0,0 +1,542 @@
+import { clone, every, flatten, has, isArray, isEmpty, isObject, reduce, uniq, values, } from "lodash-es";
+import { AT_LEAST_ONE_IDX, AT_LEAST_ONE_SEP_IDX, BITS_FOR_METHOD_TYPE, BITS_FOR_OCCURRENCE_IDX, MANY_IDX, MANY_SEP_IDX, OPTION_IDX, OR_IDX, } from "../../grammar/keys.js";
+import { isRecognitionException, MismatchedTokenException, NotAllInputParsedException, } from "../../exceptions_public.js";
+import { PROD_TYPE } from "../../grammar/lookahead.js";
+import { NextTerminalAfterAtLeastOneSepWalker, NextTerminalAfterAtLeastOneWalker, NextTerminalAfterManySepWalker, NextTerminalAfterManyWalker, } from "../../grammar/interpreter.js";
+import { DEFAULT_RULE_CONFIG } from "../parser.js";
+import { IN_RULE_RECOVERY_EXCEPTION } from "./recoverable.js";
+import { EOF } from "../../../scan/tokens_public.js";
+import { augmentTokenTypes, isTokenType, tokenStructuredMatcher, tokenStructuredMatcherNoCategories, } from "../../../scan/tokens.js";
+/**
+ * This trait is responsible for the runtime parsing engine
+ * Used by the official API (recognizer_api.ts)
+ */
+export class RecognizerEngine {
+    initRecognizerEngine(tokenVocabulary, config) {
+        this.className = this.constructor.name;
+        // TODO: would using an ES6 Map or plain object be faster (CST building scenario)
+        this.shortRuleNameToFull = {};
+        this.fullRuleNameToShort = {};
+        this.ruleShortNameIdx = 256;
+        this.tokenMatcher = tokenStructuredMatcherNoCategories;
+        this.subruleIdx = 0;
+        this.definedRulesNames = [];
+        this.tokensMap = {};
+        this.isBackTrackingStack = [];
+        this.RULE_STACK = [];
+        this.RULE_OCCURRENCE_STACK = [];
+        this.gastProductionsCache = {};
+        if (has(config, "serializedGrammar")) {
+            throw Error("The Parser's configuration can no longer contain a <serializedGrammar> property.\n" +
+                "\tSee: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0\n" +
+                "\tFor Further details.");
+        }
+        if (isArray(tokenVocabulary)) {
+            // This only checks for Token vocabularies provided as arrays.
+            // That is good enough because the main objective is to detect users of pre-V4.0 APIs
+            // rather than all edge cases of empty Token vocabularies.
+            if (isEmpty(tokenVocabulary)) {
+                throw Error("A Token Vocabulary cannot be empty.\n" +
+                    "\tNote that the first argument for the parser constructor\n" +
+                    "\tis no longer a Token vector (since v4.0).");
+            }
+            if (typeof tokenVocabulary[0].startOffset === "number") {
+                throw Error("The Parser constructor no longer accepts a token vector as the first argument.\n" +
+                    "\tSee: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_4-0-0\n" +
+                    "\tFor Further details.");
+            }
+        }
+        if (isArray(tokenVocabulary)) {
+            this.tokensMap = reduce(tokenVocabulary, (acc, tokType) => {
+                acc[tokType.name] = tokType;
+                return acc;
+            }, {});
+        }
+        else if (has(tokenVocabulary, "modes") &&
+            every(flatten(values(tokenVocabulary.modes)), isTokenType)) {
+            const allTokenTypes = flatten(values(tokenVocabulary.modes));
+            const uniqueTokens = uniq(allTokenTypes);
+            this.tokensMap = reduce(uniqueTokens, (acc, tokType) => {
+                acc[tokType.name] = tokType;
+                return acc;
+            }, {});
+        }
+        else if (isObject(tokenVocabulary)) {
+            this.tokensMap = clone(tokenVocabulary);
+        }
+        else {
+            throw new Error("<tokensDictionary> argument must be An Array of Token constructors," +
+                " A dictionary of Token constructors or an IMultiModeLexerDefinition");
+        }
+        // always add EOF to the tokenNames -> constructors map. it is useful to assure all the input has been
+        // parsed with a clear error message ("expecting EOF but found ...")
+        this.tokensMap["EOF"] = EOF;
+        const allTokenTypes = has(tokenVocabulary, "modes")
+            ? flatten(values(tokenVocabulary.modes))
+            : values(tokenVocabulary);
+        const noTokenCategoriesUsed = every(allTokenTypes, (tokenConstructor) => isEmpty(tokenConstructor.categoryMatches));
+        this.tokenMatcher = noTokenCategoriesUsed
+            ? tokenStructuredMatcherNoCategories
+            : tokenStructuredMatcher;
+        // Because ES2015+ syntax should be supported for creating Token classes
+        // We cannot assume that the Token classes were created using the "extendToken" utilities
+        // Therefore we must augment the Token classes both on Lexer initialization and on Parser initialization
+        augmentTokenTypes(values(this.tokensMap));
+    }
+    defineRule(ruleName, impl, config) {
+        if (this.selfAnalysisDone) {
+            throw Error(`Grammar rule <${ruleName}> may not be defined after the 'performSelfAnalysis' method has been called'\n` +
+                `Make sure that all grammar rule definitions are done before 'performSelfAnalysis' is called.`);
+        }
+        const resyncEnabled = has(config, "resyncEnabled")
+            ? config.resyncEnabled // assumes end user provides the correct config value/type
+            : DEFAULT_RULE_CONFIG.resyncEnabled;
+        const recoveryValueFunc = has(config, "recoveryValueFunc")
+            ? config.recoveryValueFunc // assumes end user provides the correct config value/type
+            : DEFAULT_RULE_CONFIG.recoveryValueFunc;
+        // performance optimization: Use small integers as keys for the longer human readable "full" rule names.
+        // this greatly improves Map access time (as much as 8% for some performance benchmarks).
+        const shortName = this.ruleShortNameIdx << (BITS_FOR_METHOD_TYPE + BITS_FOR_OCCURRENCE_IDX);
+        this.ruleShortNameIdx++;
+        this.shortRuleNameToFull[shortName] = ruleName;
+        this.fullRuleNameToShort[ruleName] = shortName;
+        let invokeRuleWithTry;
+        // Micro optimization, only check the condition **once** on rule definition
+        // instead of **every single** rule invocation.
+        if (this.outputCst === true) {
+            invokeRuleWithTry = function invokeRuleWithTry(...args) {
+                try {
+                    this.ruleInvocationStateUpdate(shortName, ruleName, this.subruleIdx);
+                    impl.apply(this, args);
+                    const cst = this.CST_STACK[this.CST_STACK.length - 1];
+                    this.cstPostRule(cst);
+                    return cst;
+                }
+                catch (e) {
+                    return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc);
+                }
+                finally {
+                    this.ruleFinallyStateUpdate();
+                }
+            };
+        }
+        else {
+            invokeRuleWithTry = function invokeRuleWithTryCst(...args) {
+                try {
+                    this.ruleInvocationStateUpdate(shortName, ruleName, this.subruleIdx);
+                    return impl.apply(this, args);
+                }
+                catch (e) {
+                    return this.invokeRuleCatch(e, resyncEnabled, recoveryValueFunc);
+                }
+                finally {
+                    this.ruleFinallyStateUpdate();
+                }
+            };
+        }
+        const wrappedGrammarRule = Object.assign(invokeRuleWithTry, { ruleName, originalGrammarAction: impl });
+        return wrappedGrammarRule;
+    }
+    invokeRuleCatch(e, resyncEnabledConfig, recoveryValueFunc) {
+        const isFirstInvokedRule = this.RULE_STACK.length === 1;
+        // note the reSync is always enabled for the first rule invocation, because we must always be able to
+        // reSync with EOF and just output some INVALID ParseTree
+        // during backtracking reSync recovery is disabled, otherwise we can't be certain the backtracking
+        // path is really the most valid one
+        const reSyncEnabled = resyncEnabledConfig && !this.isBackTracking() && this.recoveryEnabled;
+        if (isRecognitionException(e)) {
+            const recogError = e;
+            if (reSyncEnabled) {
+                const reSyncTokType = this.findReSyncTokenType();
+                if (this.isInCurrentRuleReSyncSet(reSyncTokType)) {
+                    recogError.resyncedTokens = this.reSyncTo(reSyncTokType);
+                    if (this.outputCst) {
+                        const partialCstResult = this.CST_STACK[this.CST_STACK.length - 1];
+                        partialCstResult.recoveredNode = true;
+                        return partialCstResult;
+                    }
+                    else {
+                        return recoveryValueFunc(e);
+                    }
+                }
+                else {
+                    if (this.outputCst) {
+                        const partialCstResult = this.CST_STACK[this.CST_STACK.length - 1];
+                        partialCstResult.recoveredNode = true;
+                        recogError.partialCstResult = partialCstResult;
+                    }
+                    // to be handled Further up the call stack
+                    throw recogError;
+                }
+            }
+            else if (isFirstInvokedRule) {
+                // otherwise a Redundant input error will be created as well and we cannot guarantee that this is indeed the case
+                this.moveToTerminatedState();
+                // the parser should never throw one of its own errors outside its flow.
+                // even if error recovery is disabled
+                return recoveryValueFunc(e);
+            }
+            else {
+                // to be recovered Further up the call stack
+                throw recogError;
+            }
+        }
+        else {
+            // some other Error type which we don't know how to handle (for example a built in JavaScript Error)
+            throw e;
+        }
+    }
+    // Implementation of parsing DSL
+    optionInternal(actionORMethodDef, occurrence) {
+        const key = this.getKeyForAutomaticLookahead(OPTION_IDX, occurrence);
+        return this.optionInternalLogic(actionORMethodDef, occurrence, key);
+    }
+    optionInternalLogic(actionORMethodDef, occurrence, key) {
+        let lookAheadFunc = this.getLaFuncFromCache(key);
+        let action;
+        if (typeof actionORMethodDef !== "function") {
+            action = actionORMethodDef.DEF;
+            const predicate = actionORMethodDef.GATE;
+            // predicate present
+            if (predicate !== undefined) {
+                const orgLookaheadFunction = lookAheadFunc;
+                lookAheadFunc = () => {
+                    return predicate.call(this) && orgLookaheadFunction.call(this);
+                };
+            }
+        }
+        else {
+            action = actionORMethodDef;
+        }
+        if (lookAheadFunc.call(this) === true) {
+            return action.call(this);
+        }
+        return undefined;
+    }
+    atLeastOneInternal(prodOccurrence, actionORMethodDef) {
+        const laKey = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_IDX, prodOccurrence);
+        return this.atLeastOneInternalLogic(prodOccurrence, actionORMethodDef, laKey);
+    }
+    atLeastOneInternalLogic(prodOccurrence, actionORMethodDef, key) {
+        let lookAheadFunc = this.getLaFuncFromCache(key);
+        let action;
+        if (typeof actionORMethodDef !== "function") {
+            action = actionORMethodDef.DEF;
+            const predicate = actionORMethodDef.GATE;
+            // predicate present
+            if (predicate !== undefined) {
+                const orgLookaheadFunction = lookAheadFunc;
+                lookAheadFunc = () => {
+                    return predicate.call(this) && orgLookaheadFunction.call(this);
+                };
+            }
+        }
+        else {
+            action = actionORMethodDef;
+        }
+        if (lookAheadFunc.call(this) === true) {
+            let notStuck = this.doSingleRepetition(action);
+            while (lookAheadFunc.call(this) === true &&
+                notStuck === true) {
+                notStuck = this.doSingleRepetition(action);
+            }
+        }
+        else {
+            throw this.raiseEarlyExitException(prodOccurrence, PROD_TYPE.REPETITION_MANDATORY, actionORMethodDef.ERR_MSG);
+        }
+        // note that while it may seem that this can cause an error because by using a recursive call to
+        // AT_LEAST_ONE we change the grammar to AT_LEAST_TWO, AT_LEAST_THREE ... , the possible recursive call
+        // from the tryInRepetitionRecovery(...) will only happen IFF there really are TWO/THREE/.... items.
+        // Performance optimization: "attemptInRepetitionRecovery" will be defined as NOOP unless recovery is enabled
+        this.attemptInRepetitionRecovery(this.atLeastOneInternal, [prodOccurrence, actionORMethodDef], lookAheadFunc, AT_LEAST_ONE_IDX, prodOccurrence, NextTerminalAfterAtLeastOneWalker);
+    }
+    atLeastOneSepFirstInternal(prodOccurrence, options) {
+        const laKey = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_SEP_IDX, prodOccurrence);
+        this.atLeastOneSepFirstInternalLogic(prodOccurrence, options, laKey);
+    }
+    atLeastOneSepFirstInternalLogic(prodOccurrence, options, key) {
+        const action = options.DEF;
+        const separator = options.SEP;
+        const firstIterationLookaheadFunc = this.getLaFuncFromCache(key);
+        // 1st iteration
+        if (firstIterationLookaheadFunc.call(this) === true) {
+            action.call(this);
+            //  TODO: Optimization can move this function construction into "attemptInRepetitionRecovery"
+            //  because it is only needed in error recovery scenarios.
+            const separatorLookAheadFunc = () => {
+                return this.tokenMatcher(this.LA(1), separator);
+            };
+            // 2nd..nth iterations
+            while (this.tokenMatcher(this.LA(1), separator) === true) {
+                // note that this CONSUME will never enter recovery because
+                // the separatorLookAheadFunc checks that the separator really does exist.
+                this.CONSUME(separator);
+                // No need for checking infinite loop here due to consuming the separator.
+                action.call(this);
+            }
+            // Performance optimization: "attemptInRepetitionRecovery" will be defined as NOOP unless recovery is enabled
+            this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [
+                prodOccurrence,
+                separator,
+                separatorLookAheadFunc,
+                action,
+                NextTerminalAfterAtLeastOneSepWalker,
+            ], separatorLookAheadFunc, AT_LEAST_ONE_SEP_IDX, prodOccurrence, NextTerminalAfterAtLeastOneSepWalker);
+        }
+        else {
+            throw this.raiseEarlyExitException(prodOccurrence, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, options.ERR_MSG);
+        }
+    }
+    manyInternal(prodOccurrence, actionORMethodDef) {
+        const laKey = this.getKeyForAutomaticLookahead(MANY_IDX, prodOccurrence);
+        return this.manyInternalLogic(prodOccurrence, actionORMethodDef, laKey);
+    }
+    manyInternalLogic(prodOccurrence, actionORMethodDef, key) {
+        let lookaheadFunction = this.getLaFuncFromCache(key);
+        let action;
+        if (typeof actionORMethodDef !== "function") {
+            action = actionORMethodDef.DEF;
+            const predicate = actionORMethodDef.GATE;
+            // predicate present
+            if (predicate !== undefined) {
+                const orgLookaheadFunction = lookaheadFunction;
+                lookaheadFunction = () => {
+                    return predicate.call(this) && orgLookaheadFunction.call(this);
+                };
+            }
+        }
+        else {
+            action = actionORMethodDef;
+        }
+        let notStuck = true;
+        while (lookaheadFunction.call(this) === true && notStuck === true) {
+            notStuck = this.doSingleRepetition(action);
+        }
+        // Performance optimization: "attemptInRepetitionRecovery" will be defined as NOOP unless recovery is enabled
+        this.attemptInRepetitionRecovery(this.manyInternal, [prodOccurrence, actionORMethodDef], lookaheadFunction, MANY_IDX, prodOccurrence, NextTerminalAfterManyWalker, 
+        // The notStuck parameter is only relevant when "attemptInRepetitionRecovery"
+        // is invoked from manyInternal, in the MANY_SEP case and AT_LEAST_ONE[_SEP]
+        // An infinite loop cannot occur as:
+        // - Either the lookahead is guaranteed to consume something (Single Token Separator)
+        // - AT_LEAST_ONE by definition is guaranteed to consume something (or error out).
+        notStuck);
+    }
+    manySepFirstInternal(prodOccurrence, options) {
+        const laKey = this.getKeyForAutomaticLookahead(MANY_SEP_IDX, prodOccurrence);
+        this.manySepFirstInternalLogic(prodOccurrence, options, laKey);
+    }
+    manySepFirstInternalLogic(prodOccurrence, options, key) {
+        const action = options.DEF;
+        const separator = options.SEP;
+        const firstIterationLaFunc = this.getLaFuncFromCache(key);
+        // 1st iteration
+        if (firstIterationLaFunc.call(this) === true) {
+            action.call(this);
+            const separatorLookAheadFunc = () => {
+                return this.tokenMatcher(this.LA(1), separator);
+            };
+            // 2nd..nth iterations
+            while (this.tokenMatcher(this.LA(1), separator) === true) {
+                // note that this CONSUME will never enter recovery because
+                // the separatorLookAheadFunc checks that the separator really does exist.
+                this.CONSUME(separator);
+                // No need for checking infinite loop here due to consuming the separator.
+                action.call(this);
+            }
+            // Performance optimization: "attemptInRepetitionRecovery" will be defined as NOOP unless recovery is enabled
+            this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [
+                prodOccurrence,
+                separator,
+                separatorLookAheadFunc,
+                action,
+                NextTerminalAfterManySepWalker,
+            ], separatorLookAheadFunc, MANY_SEP_IDX, prodOccurrence, NextTerminalAfterManySepWalker);
+        }
+    }
+    repetitionSepSecondInternal(prodOccurrence, separator, separatorLookAheadFunc, action, nextTerminalAfterWalker) {
+        while (separatorLookAheadFunc()) {
+            // note that this CONSUME will never enter recovery because
+            // the separatorLookAheadFunc checks that the separator really does exist.
+            this.CONSUME(separator);
+            action.call(this);
+        }
+        // we can only arrive to this function after an error
+        // has occurred (hence the name 'second') so the following
+        // IF will always be entered, its possible to remove it...
+        // however it is kept to avoid confusion and be consistent.
+        // Performance optimization: "attemptInRepetitionRecovery" will be defined as NOOP unless recovery is enabled
+        /* istanbul ignore else */
+        this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [
+            prodOccurrence,
+            separator,
+            separatorLookAheadFunc,
+            action,
+            nextTerminalAfterWalker,
+        ], separatorLookAheadFunc, AT_LEAST_ONE_SEP_IDX, prodOccurrence, nextTerminalAfterWalker);
+    }
+    doSingleRepetition(action) {
+        const beforeIteration = this.getLexerPosition();
+        action.call(this);
+        const afterIteration = this.getLexerPosition();
+        // This boolean will indicate if this repetition progressed
+        // or if we are "stuck" (potential infinite loop in the repetition).
+        return afterIteration > beforeIteration;
+    }
+    orInternal(altsOrOpts, occurrence) {
+        const laKey = this.getKeyForAutomaticLookahead(OR_IDX, occurrence);
+        const alts = isArray(altsOrOpts) ? altsOrOpts : altsOrOpts.DEF;
+        const laFunc = this.getLaFuncFromCache(laKey);
+        const altIdxToTake = laFunc.call(this, alts);
+        if (altIdxToTake !== undefined) {
+            const chosenAlternative = alts[altIdxToTake];
+            return chosenAlternative.ALT.call(this);
+        }
+        this.raiseNoAltException(occurrence, altsOrOpts.ERR_MSG);
+    }
+    ruleFinallyStateUpdate() {
+        this.RULE_STACK.pop();
+        this.RULE_OCCURRENCE_STACK.pop();
+        // NOOP when cst is disabled
+        this.cstFinallyStateUpdate();
+        if (this.RULE_STACK.length === 0 && this.isAtEndOfInput() === false) {
+            const firstRedundantTok = this.LA(1);
+            const errMsg = this.errorMessageProvider.buildNotAllInputParsedMessage({
+                firstRedundant: firstRedundantTok,
+                ruleName: this.getCurrRuleFullName(),
+            });
+            this.SAVE_ERROR(new NotAllInputParsedException(errMsg, firstRedundantTok));
+        }
+    }
+    subruleInternal(ruleToCall, idx, options) {
+        let ruleResult;
+        try {
+            const args = options !== undefined ? options.ARGS : undefined;
+            this.subruleIdx = idx;
+            ruleResult = ruleToCall.apply(this, args);
+            this.cstPostNonTerminal(ruleResult, options !== undefined && options.LABEL !== undefined
+                ? options.LABEL
+                : ruleToCall.ruleName);
+            return ruleResult;
+        }
+        catch (e) {
+            throw this.subruleInternalError(e, options, ruleToCall.ruleName);
+        }
+    }
+    subruleInternalError(e, options, ruleName) {
+        if (isRecognitionException(e) && e.partialCstResult !== undefined) {
+            this.cstPostNonTerminal(e.partialCstResult, options !== undefined && options.LABEL !== undefined
+                ? options.LABEL
+                : ruleName);
+            delete e.partialCstResult;
+        }
+        throw e;
+    }
+    consumeInternal(tokType, idx, options) {
+        let consumedToken;
+        try {
+            const nextToken = this.LA(1);
+            if (this.tokenMatcher(nextToken, tokType) === true) {
+                this.consumeToken();
+                consumedToken = nextToken;
+            }
+            else {
+                this.consumeInternalError(tokType, nextToken, options);
+            }
+        }
+        catch (eFromConsumption) {
+            consumedToken = this.consumeInternalRecovery(tokType, idx, eFromConsumption);
+        }
+        this.cstPostTerminal(options !== undefined && options.LABEL !== undefined
+            ? options.LABEL
+            : tokType.name, consumedToken);
+        return consumedToken;
+    }
+    consumeInternalError(tokType, nextToken, options) {
+        let msg;
+        const previousToken = this.LA(0);
+        if (options !== undefined && options.ERR_MSG) {
+            msg = options.ERR_MSG;
+        }
+        else {
+            msg = this.errorMessageProvider.buildMismatchTokenMessage({
+                expected: tokType,
+                actual: nextToken,
+                previous: previousToken,
+                ruleName: this.getCurrRuleFullName(),
+            });
+        }
+        throw this.SAVE_ERROR(new MismatchedTokenException(msg, nextToken, previousToken));
+    }
+    consumeInternalRecovery(tokType, idx, eFromConsumption) {
+        // no recovery allowed during backtracking, otherwise backtracking may recover invalid syntax and accept it
+        // but the original syntax could have been parsed successfully without any backtracking + recovery
+        if (this.recoveryEnabled &&
+            // TODO: more robust checking of the exception type. Perhaps Typescript extending expressions?
+            eFromConsumption.name === "MismatchedTokenException" &&
+            !this.isBackTracking()) {
+            const follows = this.getFollowsForInRuleRecovery(tokType, idx);
+            try {
+                return this.tryInRuleRecovery(tokType, follows);
+            }
+            catch (eFromInRuleRecovery) {
+                if (eFromInRuleRecovery.name === IN_RULE_RECOVERY_EXCEPTION) {
+                    // failed in RuleRecovery.
+                    // throw the original error in order to trigger reSync error recovery
+                    throw eFromConsumption;
+                }
+                else {
+                    throw eFromInRuleRecovery;
+                }
+            }
+        }
+        else {
+            throw eFromConsumption;
+        }
+    }
+    saveRecogState() {
+        // errors is a getter which will clone the errors array
+        const savedErrors = this.errors;
+        const savedRuleStack = clone(this.RULE_STACK);
+        return {
+            errors: savedErrors,
+            lexerState: this.exportLexerState(),
+            RULE_STACK: savedRuleStack,
+            CST_STACK: this.CST_STACK,
+        };
+    }
+    reloadRecogState(newState) {
+        this.errors = newState.errors;
+        this.importLexerState(newState.lexerState);
+        this.RULE_STACK = newState.RULE_STACK;
+    }
+    ruleInvocationStateUpdate(shortName, fullName, idxInCallingRule) {
+        this.RULE_OCCURRENCE_STACK.push(idxInCallingRule);
+        this.RULE_STACK.push(shortName);
+        // NOOP when cst is disabled
+        this.cstInvocationStateUpdate(fullName);
+    }
+    isBackTracking() {
+        return this.isBackTrackingStack.length !== 0;
+    }
+    getCurrRuleFullName() {
+        const shortName = this.getLastExplicitRuleShortName();
+        return this.shortRuleNameToFull[shortName];
+    }
+    shortRuleNameToFullName(shortName) {
+        return this.shortRuleNameToFull[shortName];
+    }
+    isAtEndOfInput() {
+        return this.tokenMatcher(this.LA(1), EOF);
+    }
+    reset() {
+        this.resetLexerState();
+        this.subruleIdx = 0;
+        this.isBackTrackingStack = [];
+        this.errors = [];
+        this.RULE_STACK = [];
+        // TODO: extract a specific reset for TreeBuilder trait
+        this.CST_STACK = [];
+        this.RULE_OCCURRENCE_STACK = [];
+    }
+}
+//# sourceMappingURL=recognizer_engine.js.map

package/vendor/java-parser/node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recognizer_engine.js","sourceRoot":"","sources":["../../../../../src/parse/parser/traits/recognizer_engine.ts"],"names":[],"mappings":"AAkBA,OAAO,EACL,KAAK,EACL,KAAK,EACL,OAAO,EACP,GAAG,EACH,OAAO,EACP,OAAO,EACP,QAAQ,EACR,MAAM,EACN,IAAI,EACJ,MAAM,GACP,MAAM,WAAW,CAAC;AACnB,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,oBAAoB,EACpB,uBAAuB,EACvB,QAAQ,EACR,YAAY,EACZ,UAAU,EACV,MAAM,GACP,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,sBAAsB,EACtB,wBAAwB,EACxB,0BAA0B,GAC3B,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAEL,oCAAoC,EACpC,iCAAiC,EACjC,8BAA8B,EAC9B,2BAA2B,GAC5B,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAAE,mBAAmB,EAA8B,MAAM,cAAc,CAAC;AAC/E,OAAO,EAAE,0BAA0B,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,GAAG,EAAE,MAAM,gCAAgC,CAAC;AAErD,OAAO,EACL,iBAAiB,EACjB,WAAW,EACX,sBAAsB,EACtB,kCAAkC,GACnC,MAAM,yBAAyB,CAAC;AAIjC;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IAe3B,oBAAoB,CAClB,eAAgC,EAChC,MAAqB;QAErB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;QACvC,iFAAiF;QACjF,IAAI,CAAC,mBAAmB,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,mBAAmB,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,gBAAgB,GAAG,GAAG,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,kCAAkC,CAAC;QACvD,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QAEpB,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,mBAAmB,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,qBAAqB,GAAG,EAAE,CAAC;QAChC,IAAI,CAAC,oBAAoB,GAAG,EAAE,CAAC;QAE/B,IAAI,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,EAAE;YACpC,MAAM,KAAK,CACT,oFAAoF;gBAClF,0EAA0E;gBAC1E,wBAAwB,CAC3B,CAAC;SACH;QAED,IAAI,OAAO,CAAC,eAAe,CAAC,EAAE;YAC5B,8DAA8D;YAC9D,qFAAqF;YACrF,0DAA0D;YAC1D,IAAI,OAAO,CAAC,eAAwB,CAAC,EAAE;gBACrC,MAAM,KAAK,CACT,uCAAuC;oBACrC,6DAA6D;oBAC7D,6CAA6C,CAChD,CAAC;aACH;YAED,IAAI,OAAQ,eAAyB,CAAC,CAAC,CAAC,CAAC,WAAW,KAAK,QAAQ,EAAE;gBACjE,MAAM,KAAK,CACT,kFAAkF;oBAChF,0EAA0E;oBAC1E,wBAAwB,CAC3B,CAAC;aACH;SACF;QAED,IAAI,OAAO,CAAC,eAAe,CAAC,EAAE;YAC5B,IAAI,CAAC,SAAS,GAAG,MAAM,CACrB,eAAe,EACf,CAAC,GAAG,EAAE,OAAkB,EAAE,EAAE;gBAC1B,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;gBAC5B,OAAO,GAAG,CAAC;YACb,CAAC,EACD,EAAwC,CACzC,CAAC;SACH;aAAM,IACL,GAAG,CAAC,eAAe,EAAE,OAAO,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAO,eAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,EACjE;YACA,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAAO,eAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;YACpE,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;YACzC,IAAI,CAAC,SAAS,GAAQ,MAAM,CAC1B,YAAY,EACZ,CAAC,GAAG,EAAE,OAAkB,EAAE,EAAE;gBAC1B,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;gBAC5B,OAAO,GAAG,CAAC;YACb,CAAC,EACD,EAAwC,CACzC,CAAC;SACH;aAAM,IAAI,QAAQ,CAAC,eAAe,CAAC,EAAE;YACpC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,eAAsC,CAAC,CAAC;SAChE;aAAM;YACL,MAAM,IAAI,KAAK,CACb,qEAAqE;gBACnE,qEAAqE,CACxE,CAAC;SACH;QAED,sGAAsG;QACtG,oEAAoE;QACpE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;QAE5B,MAAM,aAAa,GAAG,GAAG,CAAC,eAAe,EAAE,OAAO,CAAC;YACjD,CAAC,CAAC,OAAO,CAAC,MAAM,CAAO,eAAgB,CAAC,KAAK,CAAC,CAAC;YAC/C,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QAC5B,MAAM,qBAAqB,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,gBAAgB,EAAE,EAAE,CACtE,OAAO,CAAC,gBAAgB,CAAC,eAAe,CAAC,CAC1C,CAAC;QAEF,IAAI,CAAC,YAAY,GAAG,qBAAqB;YACvC,CAAC,CAAC,kCAAkC;YACpC,CAAC,CAAC,sBAAsB,CAAC;QAE3B,wEAAwE;QACxE,yFAAyF;QACzF,wGAAwG;QACxG,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,UAAU,CAER,QAAgB,EAChB,IAA0B,EAC1B,MAAsB;QAEtB,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACzB,MAAM,KAAK,CACT,iBAAiB,QAAQ,gFAAgF;gBACvG,8FAA8F,CACjG,CAAC;SACH;QACD,MAAM,aAAa,GAAY,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC;YACzD,CAAC,CAAE,MAAM,CAAC,aAAyB,CAAC,0DAA0D;YAC9F,CAAC,CAAC,mBAAmB,CAAC,aAAa,CAAC;QACtC,MAAM,iBAAiB,GAAG,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC;YACxD,CAAC,CAAE,MAAM,CAAC,iBAA6B,CAAC,0DAA0D;YAClG,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC;QAE1C,wGAAwG;QACxG,yFAAyF;QACzF,MAAM,SAAS,GACb,IAAI,CAAC,gBAAgB,IAAI,CAAC,oBAAoB,GAAG,uBAAuB,CAAC,CAAC;QAE5E,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAC;QAC/C,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;QAE/C,IAAI,iBAAwC,CAAC;QAE7C,2EAA2E;QAC3E,+CAA+C;QAC/C,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE;YAC3B,iBAAiB,GAAG,SAAS,iBAAiB,CAE5C,GAAG,IAAU;gBAEb,IAAI;oBACF,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;oBACrE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;oBACvB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACtD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;oBACtB,OAAO,GAAmB,CAAC;iBAC5B;gBAAC,OAAO,CAAC,EAAE;oBACV,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,aAAa,EAAE,iBAAiB,CAAM,CAAC;iBACvE;wBAAS;oBACR,IAAI,CAAC,sBAAsB,EAAE,CAAC;iBAC/B;YACH,CAAC,CAAC;SACH;aAAM;YACL,iBAAiB,GAAG,SAAS,oBAAoB,CAE/C,GAAG,IAAU;gBAEb,IAAI;oBACF,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;oBACrE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;iBAC/B;gBAAC,OAAO,CAAC,EAAE;oBACV,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,aAAa,EAAE,iBAAiB,CAAM,CAAC;iBACvE;wBAAS;oBACR,IAAI,CAAC,sBAAsB,EAAE,CAAC;iBAC/B;YACH,CAAC,CAAC;SACH;QAED,MAAM,kBAAkB,GAAkC,MAAM,CAAC,MAAM,CACrE,iBAAwB,EACxB,EAAE,QAAQ,EAAE,qBAAqB,EAAE,IAAI,EAAE,CAC1C,CAAC;QAEF,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED,eAAe,CAEb,CAAQ,EACR,mBAA4B,EAC5B,iBAA2B;QAE3B,MAAM,kBAAkB,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;QACxD,qGAAqG;QACrG,yDAAyD;QACzD,kGAAkG;QAClG,oCAAoC;QACpC,MAAM,aAAa,GACjB,mBAAmB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,IAAI,CAAC,eAAe,CAAC;QAExE,IAAI,sBAAsB,CAAC,CAAC,CAAC,EAAE;YAC7B,MAAM,UAAU,GAAQ,CAAC,CAAC;YAC1B,IAAI,aAAa,EAAE;gBACjB,MAAM,aAAa,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBACjD,IAAI,IAAI,CAAC,wBAAwB,CAAC,aAAa,CAAC,EAAE;oBAChD,UAAU,CAAC,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;oBACzD,IAAI,IAAI,CAAC,SAAS,EAAE;wBAClB,MAAM,gBAAgB,GACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBAC5C,gBAAgB,CAAC,aAAa,GAAG,IAAI,CAAC;wBACtC,OAAO,gBAAgB,CAAC;qBACzB;yBAAM;wBACL,OAAO,iBAAiB,CAAC,CAAC,CAAC,CAAC;qBAC7B;iBACF;qBAAM;oBACL,IAAI,IAAI,CAAC,SAAS,EAAE;wBAClB,MAAM,gBAAgB,GACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBAC5C,gBAAgB,CAAC,aAAa,GAAG,IAAI,CAAC;wBACtC,UAAU,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;qBAChD;oBACD,0CAA0C;oBAC1C,MAAM,UAAU,CAAC;iBAClB;aACF;iBAAM,IAAI,kBAAkB,EAAE;gBAC7B,iHAAiH;gBACjH,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBAC7B,wEAAwE;gBACxE,qCAAqC;gBACrC,OAAO,iBAAiB,CAAC,CAAC,CAAC,CAAC;aAC7B;iBAAM;gBACL,4CAA4C;gBAC5C,MAAM,UAAU,CAAC;aAClB;SACF;aAAM;YACL,oGAAoG;YACpG,MAAM,CAAC,CAAC;SACT;IACH,CAAC;IAED,gCAAgC;IAChC,cAAc,CAEZ,iBAA0D,EAC1D,UAAkB;QAElB,MAAM,GAAG,GAAG,IAAI,CAAC,2BAA2B,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC,mBAAmB,CAAC,iBAAiB,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IACtE,CAAC;IAED,mBAAmB,CAEjB,iBAA0D,EAC1D,UAAkB,EAClB,GAAW;QAEX,IAAI,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,MAA0B,CAAC;QAC/B,IAAI,OAAO,iBAAiB,KAAK,UAAU,EAAE;YAC3C,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC;YAC/B,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC;YACzC,oBAAoB;YACpB,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,MAAM,oBAAoB,GAAG,aAAa,CAAC;gBAC3C,aAAa,GAAG,GAAG,EAAE;oBACnB,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjE,CAAC,CAAC;aACH;SACF;aAAM;YACL,MAAM,GAAG,iBAAiB,CAAC;SAC5B;QAED,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YACrC,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC1B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,kBAAkB,CAEhB,cAAsB,EACtB,iBAAiE;QAEjE,MAAM,KAAK,GAAG,IAAI,CAAC,2BAA2B,CAC5C,gBAAgB,EAChB,cAAc,CACf,CAAC;QACF,OAAO,IAAI,CAAC,uBAAuB,CACjC,cAAc,EACd,iBAAiB,EACjB,KAAK,CACN,CAAC;IACJ,CAAC;IAED,uBAAuB,CAErB,cAAsB,EACtB,iBAAiE,EACjE,GAAW;QAEX,IAAI,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,MAAM,CAAC;QACX,IAAI,OAAO,iBAAiB,KAAK,UAAU,EAAE;YAC3C,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC;YAC/B,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC;YACzC,oBAAoB;YACpB,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,MAAM,oBAAoB,GAAG,aAAa,CAAC;gBAC3C,aAAa,GAAG,GAAG,EAAE;oBACnB,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjE,CAAC,CAAC;aACH;SACF;aAAM;YACL,MAAM,GAAG,iBAAiB,CAAC;SAC5B;QAED,IAAe,aAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YACjD,IAAI,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;YAC/C,OACa,aAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI;gBAC7C,QAAQ,KAAK,IAAI,EACjB;gBACA,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;aAC5C;SACF;aAAM;YACL,MAAM,IAAI,CAAC,uBAAuB,CAChC,cAAc,EACd,SAAS,CAAC,oBAAoB,EACF,iBAAkB,CAAC,OAAO,CACvD,CAAC;SACH;QAED,gGAAgG;QAChG,uGAAuG;QACvG,oGAAoG;QAEpG,6GAA6G;QAC7G,IAAI,CAAC,2BAA2B,CAC9B,IAAI,CAAC,kBAAkB,EACvB,CAAC,cAAc,EAAE,iBAAiB,CAAC,EAC9B,aAAa,EAClB,gBAAgB,EAChB,cAAc,EACd,iCAAiC,CAClC,CAAC;IACJ,CAAC;IAED,0BAA0B,CAExB,cAAsB,EACtB,OAAqC;QAErC,MAAM,KAAK,GAAG,IAAI,CAAC,2BAA2B,CAC5C,oBAAoB,EACpB,cAAc,CACf,CAAC;QACF,IAAI,CAAC,+BAA+B,CAAC,cAAc,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IACvE,CAAC;IAED,+BAA+B,CAE7B,cAAsB,EACtB,OAAqC,EACrC,GAAW;QAEX,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC;QAC3B,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC;QAE9B,MAAM,2BAA2B,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAEjE,gBAAgB;QAChB,IAAI,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YAC9B,MAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAExC,6FAA6F;YAC7F,0DAA0D;YAC1D,MAAM,sBAAsB,GAAG,GAAG,EAAE;gBAClC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAClD,CAAC,CAAC;YAEF,sBAAsB;YACtB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,IAAI,EAAE;gBACxD,2DAA2D;gBAC3D,0EAA0E;gBAC1E,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACxB,0EAA0E;gBACrD,MAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACzC;YAED,6GAA6G;YAC7G,IAAI,CAAC,2BAA2B,CAC9B,IAAI,CAAC,2BAA2B,EAChC;gBACE,cAAc;gBACd,SAAS;gBACT,sBAAsB;gBACtB,MAAM;gBACN,oCAAoC;aACrC,EACD,sBAAsB,EACtB,oBAAoB,EACpB,cAAc,EACd,oCAAoC,CACrC,CAAC;SACH;aAAM;YACL,MAAM,IAAI,CAAC,uBAAuB,CAChC,cAAc,EACd,SAAS,CAAC,mCAAmC,EAC7C,OAAO,CAAC,OAAO,CAChB,CAAC;SACH;IACH,CAAC;IAED,YAAY,CAEV,cAAsB,EACtB,iBAA0D;QAE1D,MAAM,KAAK,GAAG,IAAI,CAAC,2BAA2B,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QACzE,OAAO,IAAI,CAAC,iBAAiB,CAAC,cAAc,EAAE,iBAAiB,EAAE,KAAK,CAAC,CAAC;IAC1E,CAAC;IAED,iBAAiB,CAEf,cAAsB,EACtB,iBAA0D,EAC1D,GAAW;QAEX,IAAI,iBAAiB,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,MAAM,CAAC;QACX,IAAI,OAAO,iBAAiB,KAAK,UAAU,EAAE;YAC3C,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC;YAC/B,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC;YACzC,oBAAoB;YACpB,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,MAAM,oBAAoB,GAAG,iBAAiB,CAAC;gBAC/C,iBAAiB,GAAG,GAAG,EAAE;oBACvB,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjE,CAAC,CAAC;aACH;SACF;aAAM;YACL,MAAM,GAAG,iBAAiB,CAAC;SAC5B;QAED,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,OAAO,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,EAAE;YACjE,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;SAC5C;QAED,6GAA6G;QAC7G,IAAI,CAAC,2BAA2B,CAC9B,IAAI,CAAC,YAAY,EACjB,CAAC,cAAc,EAAE,iBAAiB,CAAC,EAC9B,iBAAiB,EACtB,QAAQ,EACR,cAAc,EACd,2BAA2B;QAC3B,6EAA6E;QAC7E,4EAA4E;QAC5E,oCAAoC;QACpC,qFAAqF;QACrF,kFAAkF;QAClF,QAAQ,CACT,CAAC;IACJ,CAAC;IAED,oBAAoB,CAElB,cAAsB,EACtB,OAA+B;QAE/B,MAAM,KAAK,GAAG,IAAI,CAAC,2BAA2B,CAC5C,YAAY,EACZ,cAAc,CACf,CAAC;QACF,IAAI,CAAC,yBAAyB,CAAC,cAAc,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IACjE,CAAC;IAED,yBAAyB,CAEvB,cAAsB,EACtB,OAA+B,EAC/B,GAAW;QAEX,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC;QAC3B,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC;QAC9B,MAAM,oBAAoB,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAE1D,gBAAgB;QAChB,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,sBAAsB,GAAG,GAAG,EAAE;gBAClC,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAClD,CAAC,CAAC;YACF,sBAAsB;YACtB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,IAAI,EAAE;gBACxD,2DAA2D;gBAC3D,0EAA0E;gBAC1E,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACxB,0EAA0E;gBAC1E,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnB;YAED,6GAA6G;YAC7G,IAAI,CAAC,2BAA2B,CAC9B,IAAI,CAAC,2BAA2B,EAChC;gBACE,cAAc;gBACd,SAAS;gBACT,sBAAsB;gBACtB,MAAM;gBACN,8BAA8B;aAC/B,EACD,sBAAsB,EACtB,YAAY,EACZ,cAAc,EACd,8BAA8B,CAC/B,CAAC;SACH;IACH,CAAC;IAED,2BAA2B,CAEzB,cAAsB,EACtB,SAAoB,EACpB,sBAAqC,EACrC,MAA0B,EAC1B,uBAAyE;QAEzE,OAAO,sBAAsB,EAAE,EAAE;YAC/B,2DAA2D;YAC3D,0EAA0E;YAC1E,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACnB;QAED,qDAAqD;QACrD,0DAA0D;QAC1D,0DAA0D;QAC1D,2DAA2D;QAC3D,6GAA6G;QAC7G,0BAA0B;QAC1B,IAAI,CAAC,2BAA2B,CAC9B,IAAI,CAAC,2BAA2B,EAChC;YACE,cAAc;YACd,SAAS;YACT,sBAAsB;YACtB,MAAM;YACN,uBAAuB;SACxB,EACD,sBAAsB,EACtB,oBAAoB,EACpB,cAAc,EACd,uBAAuB,CACxB,CAAC;IACJ,CAAC;IAED,kBAAkB,CAAsB,MAAgB;QACtD,MAAM,eAAe,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAE/C,2DAA2D;QAC3D,oEAAoE;QACpE,OAAO,cAAc,GAAG,eAAe,CAAC;IAC1C,CAAC;IAED,UAAU,CAER,UAAiD,EACjD,UAAkB;QAElB,MAAM,KAAK,GAAG,IAAI,CAAC,2BAA2B,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;QAE/D,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,YAAY,KAAK,SAAS,EAAE;YAC9B,MAAM,iBAAiB,GAAQ,IAAI,CAAC,YAAY,CAAC,CAAC;YAClD,OAAO,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACzC;QACD,IAAI,CAAC,mBAAmB,CACtB,UAAU,EACT,UAAoC,CAAC,OAAO,CAC9C,CAAC;IACJ,CAAC;IAED,sBAAsB;QACpB,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,CAAC;QAEjC,4BAA4B;QAC5B,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAE7B,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,KAAK,KAAK,EAAE;YACnE,MAAM,iBAAiB,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,6BAA6B,CAAC;gBACrE,cAAc,EAAE,iBAAiB;gBACjC,QAAQ,EAAE,IAAI,CAAC,mBAAmB,EAAE;aACrC,CAAC,CAAC;YACH,IAAI,CAAC,UAAU,CACb,IAAI,0BAA0B,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAC1D,CAAC;SACH;IACH,CAAC;IAED,eAAe,CAEb,UAAyC,EACzC,GAAW,EACX,OAAiC;QAEjC,IAAI,UAAU,CAAC;QACf,IAAI;YACF,MAAM,IAAI,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;YAC9D,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;YACtB,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1C,IAAI,CAAC,kBAAkB,CACrB,UAAU,EACV,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAClD,CAAC,CAAC,OAAO,CAAC,KAAK;gBACf,CAAC,CAAC,UAAU,CAAC,QAAQ,CACxB,CAAC;YACF,OAAO,UAAU,CAAC;SACnB;QAAC,OAAO,CAAC,EAAE;YACV,MAAM,IAAI,CAAC,oBAAoB,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;SAClE;IACH,CAAC;IAED,oBAAoB,CAElB,CAAM,EACN,OAAiD,EACjD,QAAgB;QAEhB,IAAI,sBAAsB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,gBAAgB,KAAK,SAAS,EAAE;YACjE,IAAI,CAAC,kBAAkB,CACrB,CAAC,CAAC,gBAAgB,EAClB,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAClD,CAAC,CAAC,OAAO,CAAC,KAAK;gBACf,CAAC,CAAC,QAAQ,CACb,CAAC;YAEF,OAAO,CAAC,CAAC,gBAAgB,CAAC;SAC3B;QACD,MAAM,CAAC,CAAC;IACV,CAAC;IAED,eAAe,CAEb,OAAkB,EAClB,GAAW,EACX,OAAsC;QAEtC,IAAI,aAAsB,CAAC;QAC3B,IAAI;YACF,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE;gBAClD,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpB,aAAa,GAAG,SAAS,CAAC;aAC3B;iBAAM;gBACL,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;aACxD;SACF;QAAC,OAAO,gBAAgB,EAAE;YACzB,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAC1C,OAAO,EACP,GAAG,EACH,gBAAgB,CACjB,CAAC;SACH;QAED,IAAI,CAAC,eAAe,CAClB,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;YAClD,CAAC,CAAC,OAAO,CAAC,KAAK;YACf,CAAC,CAAC,OAAO,CAAC,IAAI,EAChB,aAAa,CACd,CAAC;QACF,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,oBAAoB,CAElB,OAAkB,EAClB,SAAiB,EACjB,OAAsC;QAEtC,IAAI,GAAG,CAAC;QACR,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,OAAO,EAAE;YAC5C,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC;SACvB;aAAM;YACL,GAAG,GAAG,IAAI,CAAC,oBAAoB,CAAC,yBAAyB,CAAC;gBACxD,QAAQ,EAAE,OAAO;gBACjB,MAAM,EAAE,SAAS;gBACjB,QAAQ,EAAE,aAAa;gBACvB,QAAQ,EAAE,IAAI,CAAC,mBAAmB,EAAE;aACrC,CAAC,CAAC;SACJ;QACD,MAAM,IAAI,CAAC,UAAU,CACnB,IAAI,wBAAwB,CAAC,GAAG,EAAE,SAAS,EAAE,aAAa,CAAC,CAC5D,CAAC;IACJ,CAAC;IAED,uBAAuB,CAErB,OAAkB,EAClB,GAAW,EACX,gBAAuB;QAEvB,2GAA2G;QAC3G,kGAAkG;QAClG,IACE,IAAI,CAAC,eAAe;YACpB,8FAA8F;YAC9F,gBAAgB,CAAC,IAAI,KAAK,0BAA0B;YACpD,CAAC,IAAI,CAAC,cAAc,EAAE,EACtB;YACA,MAAM,OAAO,GAAG,IAAI,CAAC,2BAA2B,CAAM,OAAO,EAAE,GAAG,CAAC,CAAC;YACpE,IAAI;gBACF,OAAO,IAAI,CAAC,iBAAiB,CAAM,OAAO,EAAE,OAAO,CAAC,CAAC;aACtD;YAAC,OAAO,mBAAmB,EAAE;gBAC5B,IAAI,mBAAmB,CAAC,IAAI,KAAK,0BAA0B,EAAE;oBAC3D,0BAA0B;oBAC1B,qEAAqE;oBACrE,MAAM,gBAAgB,CAAC;iBACxB;qBAAM;oBACL,MAAM,mBAAmB,CAAC;iBAC3B;aACF;SACF;aAAM;YACL,MAAM,gBAAgB,CAAC;SACxB;IACH,CAAC;IAED,cAAc;QACZ,uDAAuD;QACvD,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;QAChC,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC9C,OAAO;YACL,MAAM,EAAE,WAAW;YACnB,UAAU,EAAE,IAAI,CAAC,gBAAgB,EAAE;YACnC,UAAU,EAAE,cAAc;YAC1B,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;IAED,gBAAgB,CAAsB,QAAsB;QAC1D,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC3C,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;IACxC,CAAC;IAED,yBAAyB,CAEvB,SAAiB,EACjB,QAAgB,EAChB,gBAAwB;QAExB,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChC,4BAA4B;QAC5B,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,mBAAmB,CAAC,MAAM,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,mBAAmB;QACjB,MAAM,SAAS,GAAG,IAAI,CAAC,4BAA4B,EAAE,CAAC;QACtD,OAAO,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,uBAAuB,CAAsB,SAAiB;QAC5D,OAAO,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC;IAEM,cAAc;QACnB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC5C,CAAC;IAEM,KAAK;QACV,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,mBAAmB,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QACrB,uDAAuD;QACvD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,qBAAqB,GAAG,EAAE,CAAC;IAClC,CAAC;CACF"}