@windrun-huaiin/third-ui 13.1.4 → 13.1.5

package/dist/node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/parser/parser-builder-base.mjs

@@ -1,481 +0,0 @@
-import { EMPTY_ALT } from '../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/parser/parser.mjs';
-import '../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/scan/lexer_public.mjs';
-import { EOF } from '../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/scan/tokens_public.mjs';
-import '../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/grammar/lookahead.mjs';
-import '../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/errors_public.mjs';
-import '../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/exceptions_public.mjs';
-import { isParserRule, isInfixRule, isKeyword, isAction, isAssignment, isCrossReference, isRuleCall, isAlternatives, isUnorderedGroup, isGroup, isEndOfFile, isTerminalRule, isAbstractParserRule, isDisjunction, isConjunction, isNegation, isParameterReference, isBooleanLiteral } from '../languages/generated/ast.mjs';
-import { ErrorWithLocation, assertUnreachable } from '../utils/errors.mjs';
-import { stream } from '../utils/stream.mjs';
-import { getAllReachableRules, getTypeName, findNameAssignment } from '../utils/grammar-utils.mjs';
-
-/******************************************************************************
- * Copyright 2022 TypeFox GmbH
- * This program and the accompanying materials are made available under the
- * terms of the MIT License, which is available in the project root.
- ******************************************************************************/
-function createParser(grammar, parser, tokens) {
-    const parserContext = {
-        parser,
-        tokens,
-        ruleNames: new Map()
-    };
-    buildRules(parserContext, grammar);
-    return parser;
-}
-function buildRules(parserContext, grammar) {
-    const reachable = getAllReachableRules(grammar, false);
-    const parserRules = stream(grammar.rules).filter(isParserRule).filter(rule => reachable.has(rule));
-    for (const rule of parserRules) {
-        const ctx = {
-            ...parserContext,
-            consume: 1,
-            optional: 1,
-            subrule: 1,
-            many: 1,
-            or: 1
-        };
-        parserContext.parser.rule(rule, buildElement(ctx, rule.definition));
-    }
-    const infixRules = stream(grammar.rules).filter(isInfixRule).filter(rule => reachable.has(rule));
-    for (const rule of infixRules) {
-        parserContext.parser.rule(rule, buildInfixRule(parserContext, rule));
-    }
-}
-function buildInfixRule(ctx, rule) {
-    const expressionRule = rule.call.rule.ref;
-    if (!expressionRule) {
-        throw new Error('Could not resolve reference to infix operator rule: ' + rule.call.rule.$refText);
-    }
-    if (isTerminalRule(expressionRule)) {
-        throw new Error('Cannot use terminal rule in infix expression');
-    }
-    // We need to construct a bunch of synthetic grammar AST nodes here
-    // This ensures that the CST and completion engine get populated as expected
-    const allKeywords = rule.operators.precedences.flatMap(e => e.operators);
-    // The outer group represents the first expression call and the whole (optional) loop
-    const outerGroup = {
-        $type: 'Group',
-        elements: []
-    };
-    const part1Assignment = {
-        $container: outerGroup,
-        $type: 'Assignment',
-        feature: 'parts',
-        operator: '+=',
-        terminal: rule.call
-    };
-    // The inner group represents the loop that contains the operator and expression call
-    // It can be infinitely repeated
-    const innerGroup = {
-        $container: outerGroup,
-        $type: 'Group',
-        elements: [],
-        cardinality: '*'
-    };
-    outerGroup.elements.push(part1Assignment, innerGroup);
-    // Store all operator keywords in one alternative/assignment
-    const alternatives = {
-        $type: 'Alternatives',
-        elements: allKeywords
-    };
-    const operatorAssignment = {
-        $container: innerGroup,
-        $type: 'Assignment',
-        feature: 'operators',
-        operator: '+=',
-        terminal: alternatives
-    };
-    // We need a second assignment of the called expression here
-    const part2Assignment = {
-        ...part1Assignment,
-        $container: innerGroup
-    };
-    innerGroup.elements.push(operatorAssignment, part2Assignment);
-    const tokens = allKeywords.map(e => ctx.tokens[e.value]);
-    const orAlts = tokens.map((token, index) => ({
-        ALT: () => ctx.parser.consume(index, token, operatorAssignment)
-    }));
-    let subrule;
-    return (args) => {
-        subrule ?? (subrule = getRule(ctx, expressionRule));
-        ctx.parser.subrule(0, subrule, false, part1Assignment, args);
-        ctx.parser.many(0, {
-            DEF: () => {
-                ctx.parser.alternatives(0, orAlts);
-                ctx.parser.subrule(1, subrule, false, part2Assignment, args);
-            }
-        });
-    };
-}
-function buildElement(ctx, element, ignoreGuard = false) {
-    let method;
-    if (isKeyword(element)) {
-        method = buildKeyword(ctx, element);
-    }
-    else if (isAction(element)) {
-        method = buildAction(ctx, element);
-    }
-    else if (isAssignment(element)) {
-        method = buildElement(ctx, element.terminal);
-    }
-    else if (isCrossReference(element)) {
-        method = buildCrossReference(ctx, element);
-    }
-    else if (isRuleCall(element)) {
-        method = buildRuleCall(ctx, element);
-    }
-    else if (isAlternatives(element)) {
-        method = buildAlternatives(ctx, element);
-    }
-    else if (isUnorderedGroup(element)) {
-        method = buildUnorderedGroup(ctx, element);
-    }
-    else if (isGroup(element)) {
-        method = buildGroup(ctx, element);
-    }
-    else if (isEndOfFile(element)) {
-        const idx = ctx.consume++;
-        method = () => ctx.parser.consume(idx, EOF, element);
-    }
-    else {
-        throw new ErrorWithLocation(element.$cstNode, `Unexpected element type: ${element.$type}`);
-    }
-    return wrap(ctx, ignoreGuard ? undefined : getGuardCondition(element), method, element.cardinality);
-}
-function buildAction(ctx, action) {
-    const actionType = getTypeName(action);
-    return () => ctx.parser.action(actionType, action);
-}
-function buildRuleCall(ctx, ruleCall) {
-    const rule = ruleCall.rule.ref;
-    if (isAbstractParserRule(rule)) {
-        const idx = ctx.subrule++;
-        const fragment = isParserRule(rule) && rule.fragment;
-        const predicate = ruleCall.arguments.length > 0 ? buildRuleCallPredicate(rule, ruleCall.arguments) : () => ({});
-        let subrule;
-        return (args) => {
-            subrule ?? (subrule = getRule(ctx, rule));
-            ctx.parser.subrule(idx, subrule, fragment, ruleCall, predicate(args));
-        };
-    }
-    else if (isTerminalRule(rule)) {
-        const idx = ctx.consume++;
-        const method = getToken(ctx, rule.name);
-        return () => ctx.parser.consume(idx, method, ruleCall);
-    }
-    else if (!rule) {
-        throw new ErrorWithLocation(ruleCall.$cstNode, `Undefined rule: ${ruleCall.rule.$refText}`);
-    }
-    else {
-        assertUnreachable();
-    }
-}
-function buildRuleCallPredicate(rule, namedArgs) {
-    const hasNamedArguments = namedArgs.some(arg => arg.calledByName);
-    if (hasNamedArguments) {
-        const namedPredicates = namedArgs.map(arg => ({
-            parameterName: arg.parameter?.ref?.name,
-            predicate: buildPredicate(arg.value)
-        }));
-        return (args) => {
-            const ruleArgs = {};
-            for (const { parameterName, predicate } of namedPredicates) {
-                if (parameterName) {
-                    ruleArgs[parameterName] = predicate(args);
-                }
-            }
-            return ruleArgs;
-        };
-    }
-    else {
-        const predicates = namedArgs.map(arg => buildPredicate(arg.value));
-        return (args) => {
-            const ruleArgs = {};
-            for (let i = 0; i < predicates.length; i++) {
-                if (i < rule.parameters.length) {
-                    const parameterName = rule.parameters[i].name;
-                    const predicate = predicates[i];
-                    ruleArgs[parameterName] = predicate(args);
-                }
-            }
-            return ruleArgs;
-        };
-    }
-}
-function buildPredicate(condition) {
-    if (isDisjunction(condition)) {
-        const left = buildPredicate(condition.left);
-        const right = buildPredicate(condition.right);
-        return (args) => (left(args) || right(args));
-    }
-    else if (isConjunction(condition)) {
-        const left = buildPredicate(condition.left);
-        const right = buildPredicate(condition.right);
-        return (args) => (left(args) && right(args));
-    }
-    else if (isNegation(condition)) {
-        const value = buildPredicate(condition.value);
-        return (args) => !value(args);
-    }
-    else if (isParameterReference(condition)) {
-        const name = condition.parameter.ref.name;
-        return (args) => args !== undefined && args[name] === true;
-    }
-    else if (isBooleanLiteral(condition)) {
-        const value = Boolean(condition.true);
-        return () => value;
-    }
-    assertUnreachable();
-}
-function buildAlternatives(ctx, alternatives) {
-    if (alternatives.elements.length === 1) {
-        return buildElement(ctx, alternatives.elements[0]);
-    }
-    else {
-        const methods = [];
-        for (const element of alternatives.elements) {
-            const predicatedMethod = {
-                // Since we handle the guard condition in the alternative already
-                // We can ignore the group guard condition inside
-                ALT: buildElement(ctx, element, true)
-            };
-            const guard = getGuardCondition(element);
-            if (guard) {
-                predicatedMethod.GATE = buildPredicate(guard);
-            }
-            methods.push(predicatedMethod);
-        }
-        const idx = ctx.or++;
-        return (args) => ctx.parser.alternatives(idx, methods.map(method => {
-            const alt = {
-                ALT: () => method.ALT(args)
-            };
-            const gate = method.GATE;
-            if (gate) {
-                alt.GATE = () => gate(args);
-            }
-            return alt;
-        }));
-    }
-}
-function buildUnorderedGroup(ctx, group) {
-    if (group.elements.length === 1) {
-        return buildElement(ctx, group.elements[0]);
-    }
-    const methods = [];
-    for (const element of group.elements) {
-        const predicatedMethod = {
-            // Since we handle the guard condition in the alternative already
-            // We can ignore the group guard condition inside
-            ALT: buildElement(ctx, element, true)
-        };
-        const guard = getGuardCondition(element);
-        if (guard) {
-            predicatedMethod.GATE = buildPredicate(guard);
-        }
-        methods.push(predicatedMethod);
-    }
-    const orIdx = ctx.or++;
-    const idFunc = (groupIdx, lParser) => {
-        const stackId = lParser.getRuleStack().join('-');
-        return `uGroup_${groupIdx}_${stackId}`;
-    };
-    const alternatives = (args) => ctx.parser.alternatives(orIdx, methods.map((method, idx) => {
-        const alt = { ALT: () => true };
-        const parser = ctx.parser;
-        alt.ALT = () => {
-            method.ALT(args);
-            if (!parser.isRecording()) {
-                const key = idFunc(orIdx, parser);
-                if (!parser.unorderedGroups.get(key)) {
-                    // init after clear state
-                    parser.unorderedGroups.set(key, []);
-                }
-                const groupState = parser.unorderedGroups.get(key);
-                if (typeof groupState?.[idx] === 'undefined') {
-                    // Not accessed yet
-                    groupState[idx] = true;
-                }
-            }
-        };
-        const gate = method.GATE;
-        if (gate) {
-            alt.GATE = () => gate(args);
-        }
-        else {
-            alt.GATE = () => {
-                const trackedAlternatives = parser.unorderedGroups.get(idFunc(orIdx, parser));
-                const allow = !trackedAlternatives?.[idx];
-                return allow;
-            };
-        }
-        return alt;
-    }));
-    const wrapped = wrap(ctx, getGuardCondition(group), alternatives, '*');
-    return (args) => {
-        wrapped(args);
-        if (!ctx.parser.isRecording()) {
-            ctx.parser.unorderedGroups.delete(idFunc(orIdx, ctx.parser));
-        }
-    };
-}
-function buildGroup(ctx, group) {
-    const methods = group.elements.map(e => buildElement(ctx, e));
-    return (args) => methods.forEach(method => method(args));
-}
-function getGuardCondition(element) {
-    if (isGroup(element)) {
-        return element.guardCondition;
-    }
-    return undefined;
-}
-function buildCrossReference(ctx, crossRef, terminal = crossRef.terminal) {
-    if (!terminal) {
-        if (!crossRef.type.ref) {
-            throw new Error('Could not resolve reference to type: ' + crossRef.type.$refText);
-        }
-        const assignment = findNameAssignment(crossRef.type.ref);
-        const assignTerminal = assignment?.terminal;
-        if (!assignTerminal) {
-            throw new Error('Could not find name assignment for type: ' + getTypeName(crossRef.type.ref));
-        }
-        return buildCrossReference(ctx, crossRef, assignTerminal);
-    }
-    else if (isRuleCall(terminal) && isParserRule(terminal.rule.ref)) {
-        // The terminal is a data type rule here. Everything else will result in a validation error.
-        const rule = terminal.rule.ref;
-        const idx = ctx.subrule++;
-        let subrule;
-        return (args) => {
-            subrule ?? (subrule = getRule(ctx, rule));
-            ctx.parser.subrule(idx, subrule, false, crossRef, args);
-        };
-    }
-    else if (isRuleCall(terminal) && isTerminalRule(terminal.rule.ref)) {
-        const idx = ctx.consume++;
-        const terminalRule = getToken(ctx, terminal.rule.ref.name);
-        return () => ctx.parser.consume(idx, terminalRule, crossRef);
-    }
-    else if (isKeyword(terminal)) {
-        const idx = ctx.consume++;
-        const keyword = getToken(ctx, terminal.value);
-        return () => ctx.parser.consume(idx, keyword, crossRef);
-    }
-    else {
-        throw new Error('Could not build cross reference parser');
-    }
-}
-function buildKeyword(ctx, keyword) {
-    const idx = ctx.consume++;
-    const token = ctx.tokens[keyword.value];
-    if (!token) {
-        throw new Error('Could not find token for keyword: ' + keyword.value);
-    }
-    return () => ctx.parser.consume(idx, token, keyword);
-}
-function wrap(ctx, guard, method, cardinality) {
-    const gate = guard && buildPredicate(guard);
-    if (!cardinality) {
-        if (gate) {
-            const idx = ctx.or++;
-            return (args) => ctx.parser.alternatives(idx, [
-                {
-                    ALT: () => method(args),
-                    GATE: () => gate(args)
-                },
-                {
-                    ALT: EMPTY_ALT(),
-                    GATE: () => !gate(args)
-                }
-            ]);
-        }
-        else {
-            return method;
-        }
-    }
-    if (cardinality === '*') {
-        const idx = ctx.many++;
-        return (args) => ctx.parser.many(idx, {
-            DEF: () => method(args),
-            GATE: gate ? () => gate(args) : undefined
-        });
-    }
-    else if (cardinality === '+') {
-        const idx = ctx.many++;
-        if (gate) {
-            const orIdx = ctx.or++;
-            // In the case of a guard condition for the `+` group
-            // We combine it with an empty alternative
-            // If the condition returns true, it needs to parse at least a single iteration
-            // If its false, it is not allowed to parse anything
-            return (args) => ctx.parser.alternatives(orIdx, [
-                {
-                    ALT: () => ctx.parser.atLeastOne(idx, {
-                        DEF: () => method(args)
-                    }),
-                    GATE: () => gate(args)
-                },
-                {
-                    ALT: EMPTY_ALT(),
-                    GATE: () => !gate(args)
-                }
-            ]);
-        }
-        else {
-            return (args) => ctx.parser.atLeastOne(idx, {
-                DEF: () => method(args),
-            });
-        }
-    }
-    else if (cardinality === '?') {
-        const idx = ctx.optional++;
-        return (args) => ctx.parser.optional(idx, {
-            DEF: () => method(args),
-            GATE: gate ? () => gate(args) : undefined
-        });
-    }
-    else {
-        assertUnreachable();
-    }
-}
-function getRule(ctx, element) {
-    const name = getRuleName(ctx, element);
-    const rule = ctx.parser.getRule(name);
-    if (!rule)
-        throw new Error(`Rule "${name}" not found."`);
-    return rule;
-}
-function getRuleName(ctx, element) {
-    if (isAbstractParserRule(element)) {
-        return element.name;
-    }
-    else if (ctx.ruleNames.has(element)) {
-        return ctx.ruleNames.get(element);
-    }
-    else {
-        let item = element;
-        let parent = item.$container;
-        let ruleName = element.$type;
-        while (!isParserRule(parent)) {
-            if (isGroup(parent) || isAlternatives(parent) || isUnorderedGroup(parent)) {
-                const index = parent.elements.indexOf(item);
-                ruleName = index.toString() + ':' + ruleName;
-            }
-            item = parent;
-            parent = parent.$container;
-        }
-        const rule = parent;
-        ruleName = rule.name + ':' + ruleName;
-        ctx.ruleNames.set(element, ruleName);
-        return ruleName;
-    }
-}
-function getToken(ctx, name) {
-    const token = ctx.tokens[name];
-    if (!token)
-        throw new Error(`Token "${name}" not found."`);
-    return token;
-}
-
-export { createParser };

package/dist/node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/parser/token-builder.js

@@ -1,123 +0,0 @@
-'use strict';
-
-require('../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/parser/parser.js');
-var lexer_public = require('../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/scan/lexer_public.js');
-require('../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/scan/tokens_public.js');
-require('../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/grammar/lookahead.js');
-require('../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/errors_public.js');
-require('../../../../../chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/exceptions_public.js');
-var ast = require('../languages/generated/ast.js');
-var astUtils = require('../utils/ast-utils.js');
-var grammarUtils = require('../utils/grammar-utils.js');
-var regexpUtils = require('../utils/regexp-utils.js');
-var stream = require('../utils/stream.js');
-
-/******************************************************************************
- * Copyright 2021 TypeFox GmbH
- * This program and the accompanying materials are made available under the
- * terms of the MIT License, which is available in the project root.
- ******************************************************************************/
-class DefaultTokenBuilder {
-    constructor() {
-        /**
-         * The list of diagnostics stored during the lexing process of a single text.
-         */
-        this.diagnostics = [];
-    }
-    buildTokens(grammar, options) {
-        const reachableRules = stream.stream(grammarUtils.getAllReachableRules(grammar, false));
-        const terminalTokens = this.buildTerminalTokens(reachableRules);
-        const tokens = this.buildKeywordTokens(reachableRules, terminalTokens, options);
-        // Add all terminals tokens to the end in the order they were defined
-        // Chevrotain documentation recommends to add Whitespace-like tokens at the start
-        // However, assuming the lexer is able to optimize the tokens, it should not matter
-        tokens.push(...terminalTokens);
-        // We don't need to add the EOF token explicitly.
-        // It is automatically available at the end of the token stream.
-        return tokens;
-    }
-    // eslint-disable-next-line @typescript-eslint/no-unused-vars
-    flushLexingReport(text) {
-        return { diagnostics: this.popDiagnostics() };
-    }
-    popDiagnostics() {
-        const diagnostics = [...this.diagnostics];
-        this.diagnostics = [];
-        return diagnostics;
-    }
-    buildTerminalTokens(rules) {
-        return rules.filter(ast.isTerminalRule).filter(e => !e.fragment)
-            .map(terminal => this.buildTerminalToken(terminal)).toArray();
-    }
-    buildTerminalToken(terminal) {
-        const regex = grammarUtils.terminalRegex(terminal);
-        const pattern = this.requiresCustomPattern(regex) ? this.regexPatternFunction(regex) : regex;
-        const tokenType = {
-            name: terminal.name,
-            PATTERN: pattern,
-        };
-        if (typeof pattern === 'function') {
-            tokenType.LINE_BREAKS = true;
-        }
-        if (terminal.hidden) {
-            // Only skip tokens that are able to accept whitespace
-            tokenType.GROUP = regexpUtils.isWhitespace(regex) ? lexer_public.Lexer.SKIPPED : 'hidden';
-        }
-        return tokenType;
-    }
-    requiresCustomPattern(regex) {
-        if (regex.flags.includes('u') || regex.flags.includes('s')) {
-            // Unicode and dotall regexes are not supported by Chevrotain.
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-    regexPatternFunction(regex) {
-        const stickyRegex = new RegExp(regex, regex.flags + 'y');
-        return (text, offset) => {
-            stickyRegex.lastIndex = offset;
-            const execResult = stickyRegex.exec(text);
-            return execResult;
-        };
-    }
-    buildKeywordTokens(rules, terminalTokens, options) {
-        return rules
-            // We filter by parser rules, since keywords in terminal rules get transformed into regex and are not actual tokens
-            .filter(ast.isAbstractParserRule)
-            .flatMap(rule => astUtils.streamAllContents(rule).filter(ast.isKeyword))
-            .distinct(e => e.value).toArray()
-            // Sort keywords by descending length
-            .sort((a, b) => b.value.length - a.value.length)
-            .map(keyword => this.buildKeywordToken(keyword, terminalTokens, Boolean(options?.caseInsensitive)));
-    }
-    buildKeywordToken(keyword, terminalTokens, caseInsensitive) {
-        const keywordPattern = this.buildKeywordPattern(keyword, caseInsensitive);
-        const tokenType = {
-            name: keyword.value,
-            PATTERN: keywordPattern,
-            LONGER_ALT: this.findLongerAlt(keyword, terminalTokens)
-        };
-        if (typeof keywordPattern === 'function') {
-            tokenType.LINE_BREAKS = true;
-        }
-        return tokenType;
-    }
-    buildKeywordPattern(keyword, caseInsensitive) {
-        return caseInsensitive ?
-            new RegExp(regexpUtils.escapeRegExp(keyword.value), 'i') :
-            keyword.value;
-    }
-    findLongerAlt(keyword, terminalTokens) {
-        return terminalTokens.reduce((longerAlts, token) => {
-            const pattern = token?.PATTERN;
-            if (pattern?.source && regexpUtils.partialMatches('^' + pattern.source + '$', keyword.value)) {
-                longerAlts.push(token);
-            }
-            return longerAlts;
-        }, []);
-    }
-}
-
-exports.DefaultTokenBuilder = DefaultTokenBuilder;