@windrun-huaiin/third-ui 13.1.4 → 13.1.5

package/dist/node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/utils/collections.js

@@ -1,200 +0,0 @@
-'use strict';
-
-var stream = require('./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.
- ******************************************************************************/
-/**
- * A multimap is a variation of a Map that has potentially multiple values for every key.
- */
-class MultiMap {
-    constructor(elements) {
-        this.map = new Map();
-        if (elements) {
-            for (const [key, value] of elements) {
-                this.add(key, value);
-            }
-        }
-    }
-    /**
-     * The total number of values in the multimap.
-     */
-    get size() {
-        return stream.Reduction.sum(stream.stream(this.map.values()).map(a => a.length));
-    }
-    /**
-     * Clear all entries in the multimap.
-     */
-    clear() {
-        this.map.clear();
-    }
-    /**
-     * Operates differently depending on whether a `value` is given:
-     *  * With a value, this method deletes the specific key / value pair from the multimap.
-     *  * Without a value, all values associated with the given key are deleted.
-     *
-     * @returns `true` if a value existed and has been removed, or `false` if the specified
-     *     key / value does not exist.
-     */
-    delete(key, value) {
-        if (value === undefined) {
-            return this.map.delete(key);
-        }
-        else {
-            const values = this.map.get(key);
-            if (values) {
-                const index = values.indexOf(value);
-                if (index >= 0) {
-                    if (values.length === 1) {
-                        this.map.delete(key);
-                    }
-                    else {
-                        values.splice(index, 1);
-                    }
-                    return true;
-                }
-            }
-            return false;
-        }
-    }
-    /**
-     * Returns an array of all values associated with the given key. If no value exists,
-     * an empty array is returned.
-     *
-     * _Note:_ The returned array is assumed not to be modified. Use the `set` method to add a
-     * value and `delete` to remove a value from the multimap.
-     */
-    get(key) {
-        return this.map.get(key) ?? [];
-    }
-    /**
-     * Returns a stream of all values associated with the given key. If no value exists,
-     * {@link EMPTY_STREAM} is returned.
-     */
-    getStream(key) {
-        const values = this.map.get(key);
-        return values ? stream.stream(values) : stream.EMPTY_STREAM;
-    }
-    /**
-     * Operates differently depending on whether a `value` is given:
-     *  * With a value, this method returns `true` if the specific key / value pair is present in the multimap.
-     *  * Without a value, this method returns `true` if the given key is present in the multimap.
-     */
-    has(key, value) {
-        if (value === undefined) {
-            return this.map.has(key);
-        }
-        else {
-            const values = this.map.get(key);
-            if (values) {
-                return values.indexOf(value) >= 0;
-            }
-            return false;
-        }
-    }
-    /**
-     * Add the given key / value pair to the multimap.
-     */
-    add(key, value) {
-        if (this.map.has(key)) {
-            this.map.get(key).push(value);
-        }
-        else {
-            this.map.set(key, [value]);
-        }
-        return this;
-    }
-    /**
-     * Add the given set of key / value pairs to the multimap.
-     */
-    addAll(key, values) {
-        if (this.map.has(key)) {
-            this.map.get(key).push(...values);
-        }
-        else {
-            this.map.set(key, Array.from(values));
-        }
-        return this;
-    }
-    /**
-     * Invokes the given callback function for every key / value pair in the multimap.
-     */
-    forEach(callbackfn) {
-        this.map.forEach((array, key) => array.forEach(value => callbackfn(value, key, this)));
-    }
-    /**
-     * Returns an iterator of key, value pairs for every entry in the map.
-     */
-    [Symbol.iterator]() {
-        return this.entries().iterator();
-    }
-    /**
-     * Returns a stream of key, value pairs for every entry in the map.
-     */
-    entries() {
-        return stream.stream(this.map.entries())
-            .flatMap(([key, array]) => array.map(value => [key, value]));
-    }
-    /**
-     * Returns a stream of keys in the map.
-     */
-    keys() {
-        return stream.stream(this.map.keys());
-    }
-    /**
-     * Returns a stream of values in the map.
-     */
-    values() {
-        return stream.stream(this.map.values()).flat();
-    }
-    /**
-     * Returns a stream of key, value set pairs for every key in the map.
-     */
-    entriesGroupedByKey() {
-        return stream.stream(this.map.entries());
-    }
-}
-class BiMap {
-    get size() {
-        return this.map.size;
-    }
-    constructor(elements) {
-        this.map = new Map();
-        this.inverse = new Map();
-        if (elements) {
-            for (const [key, value] of elements) {
-                this.set(key, value);
-            }
-        }
-    }
-    clear() {
-        this.map.clear();
-        this.inverse.clear();
-    }
-    set(key, value) {
-        this.map.set(key, value);
-        this.inverse.set(value, key);
-        return this;
-    }
-    get(key) {
-        return this.map.get(key);
-    }
-    getKey(value) {
-        return this.inverse.get(value);
-    }
-    delete(key) {
-        const value = this.map.get(key);
-        if (value !== undefined) {
-            this.map.delete(key);
-            this.inverse.delete(value);
-            return true;
-        }
-        return false;
-    }
-}
-
-exports.BiMap = BiMap;
-exports.MultiMap = MultiMap;

package/dist/node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/utils/collections.mjs

@@ -1,197 +0,0 @@
-import { Reduction, stream, EMPTY_STREAM } from './stream.mjs';
-
-/******************************************************************************
- * 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.
- ******************************************************************************/
-/**
- * A multimap is a variation of a Map that has potentially multiple values for every key.
- */
-class MultiMap {
-    constructor(elements) {
-        this.map = new Map();
-        if (elements) {
-            for (const [key, value] of elements) {
-                this.add(key, value);
-            }
-        }
-    }
-    /**
-     * The total number of values in the multimap.
-     */
-    get size() {
-        return Reduction.sum(stream(this.map.values()).map(a => a.length));
-    }
-    /**
-     * Clear all entries in the multimap.
-     */
-    clear() {
-        this.map.clear();
-    }
-    /**
-     * Operates differently depending on whether a `value` is given:
-     *  * With a value, this method deletes the specific key / value pair from the multimap.
-     *  * Without a value, all values associated with the given key are deleted.
-     *
-     * @returns `true` if a value existed and has been removed, or `false` if the specified
-     *     key / value does not exist.
-     */
-    delete(key, value) {
-        if (value === undefined) {
-            return this.map.delete(key);
-        }
-        else {
-            const values = this.map.get(key);
-            if (values) {
-                const index = values.indexOf(value);
-                if (index >= 0) {
-                    if (values.length === 1) {
-                        this.map.delete(key);
-                    }
-                    else {
-                        values.splice(index, 1);
-                    }
-                    return true;
-                }
-            }
-            return false;
-        }
-    }
-    /**
-     * Returns an array of all values associated with the given key. If no value exists,
-     * an empty array is returned.
-     *
-     * _Note:_ The returned array is assumed not to be modified. Use the `set` method to add a
-     * value and `delete` to remove a value from the multimap.
-     */
-    get(key) {
-        return this.map.get(key) ?? [];
-    }
-    /**
-     * Returns a stream of all values associated with the given key. If no value exists,
-     * {@link EMPTY_STREAM} is returned.
-     */
-    getStream(key) {
-        const values = this.map.get(key);
-        return values ? stream(values) : EMPTY_STREAM;
-    }
-    /**
-     * Operates differently depending on whether a `value` is given:
-     *  * With a value, this method returns `true` if the specific key / value pair is present in the multimap.
-     *  * Without a value, this method returns `true` if the given key is present in the multimap.
-     */
-    has(key, value) {
-        if (value === undefined) {
-            return this.map.has(key);
-        }
-        else {
-            const values = this.map.get(key);
-            if (values) {
-                return values.indexOf(value) >= 0;
-            }
-            return false;
-        }
-    }
-    /**
-     * Add the given key / value pair to the multimap.
-     */
-    add(key, value) {
-        if (this.map.has(key)) {
-            this.map.get(key).push(value);
-        }
-        else {
-            this.map.set(key, [value]);
-        }
-        return this;
-    }
-    /**
-     * Add the given set of key / value pairs to the multimap.
-     */
-    addAll(key, values) {
-        if (this.map.has(key)) {
-            this.map.get(key).push(...values);
-        }
-        else {
-            this.map.set(key, Array.from(values));
-        }
-        return this;
-    }
-    /**
-     * Invokes the given callback function for every key / value pair in the multimap.
-     */
-    forEach(callbackfn) {
-        this.map.forEach((array, key) => array.forEach(value => callbackfn(value, key, this)));
-    }
-    /**
-     * Returns an iterator of key, value pairs for every entry in the map.
-     */
-    [Symbol.iterator]() {
-        return this.entries().iterator();
-    }
-    /**
-     * Returns a stream of key, value pairs for every entry in the map.
-     */
-    entries() {
-        return stream(this.map.entries())
-            .flatMap(([key, array]) => array.map(value => [key, value]));
-    }
-    /**
-     * Returns a stream of keys in the map.
-     */
-    keys() {
-        return stream(this.map.keys());
-    }
-    /**
-     * Returns a stream of values in the map.
-     */
-    values() {
-        return stream(this.map.values()).flat();
-    }
-    /**
-     * Returns a stream of key, value set pairs for every key in the map.
-     */
-    entriesGroupedByKey() {
-        return stream(this.map.entries());
-    }
-}
-class BiMap {
-    get size() {
-        return this.map.size;
-    }
-    constructor(elements) {
-        this.map = new Map();
-        this.inverse = new Map();
-        if (elements) {
-            for (const [key, value] of elements) {
-                this.set(key, value);
-            }
-        }
-    }
-    clear() {
-        this.map.clear();
-        this.inverse.clear();
-    }
-    set(key, value) {
-        this.map.set(key, value);
-        this.inverse.set(value, key);
-        return this;
-    }
-    get(key) {
-        return this.map.get(key);
-    }
-    getKey(value) {
-        return this.inverse.get(value);
-    }
-    delete(key) {
-        const value = this.map.get(key);
-        if (value !== undefined) {
-            this.map.delete(key);
-            this.inverse.delete(value);
-            return true;
-        }
-        return false;
-    }
-}
-
-export { BiMap, MultiMap };

package/dist/node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/utils/cst-utils.js

@@ -1,149 +0,0 @@
-'use strict';
-
-var syntaxTree = require('../syntax-tree.js');
-var stream = require('./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.
- ******************************************************************************/
-/**
- * Create a stream of all CST nodes that are directly and indirectly contained in the given root node,
- * including the root node itself.
- */
-function streamCst(node) {
-    return new stream.TreeStreamImpl(node, element => {
-        if (syntaxTree.isCompositeCstNode(element)) {
-            return element.content;
-        }
-        else {
-            return [];
-        }
-    }, { includeRoot: true });
-}
-/**
- * Determines whether the specified cst node is a child of the specified parent node.
- */
-function isChildNode(child, parent) {
-    while (child.container) {
-        child = child.container;
-        if (child === parent) {
-            return true;
-        }
-    }
-    return false;
-}
-function tokenToRange(token) {
-    // Chevrotain uses 1-based indices everywhere
-    // So we subtract 1 from every value to align with the LSP
-    return {
-        start: {
-            character: token.startColumn - 1,
-            line: token.startLine - 1
-        },
-        end: {
-            character: token.endColumn, // endColumn uses the correct index
-            line: token.endLine - 1
-        }
-    };
-}
-function toDocumentSegment(node) {
-    if (!node) {
-        return undefined;
-    }
-    const { offset, end, range } = node;
-    return {
-        range,
-        offset,
-        end,
-        length: end - offset
-    };
-}
-exports.RangeComparison = void 0;
-(function (RangeComparison) {
-    RangeComparison[RangeComparison["Before"] = 0] = "Before";
-    RangeComparison[RangeComparison["After"] = 1] = "After";
-    RangeComparison[RangeComparison["OverlapFront"] = 2] = "OverlapFront";
-    RangeComparison[RangeComparison["OverlapBack"] = 3] = "OverlapBack";
-    RangeComparison[RangeComparison["Inside"] = 4] = "Inside";
-    RangeComparison[RangeComparison["Outside"] = 5] = "Outside";
-})(exports.RangeComparison || (exports.RangeComparison = {}));
-function compareRange(range, to) {
-    if (range.end.line < to.start.line || (range.end.line === to.start.line && range.end.character <= to.start.character)) {
-        return exports.RangeComparison.Before;
-    }
-    else if (range.start.line > to.end.line || (range.start.line === to.end.line && range.start.character >= to.end.character)) {
-        return exports.RangeComparison.After;
-    }
-    const startInside = range.start.line > to.start.line || (range.start.line === to.start.line && range.start.character >= to.start.character);
-    const endInside = range.end.line < to.end.line || (range.end.line === to.end.line && range.end.character <= to.end.character);
-    if (startInside && endInside) {
-        return exports.RangeComparison.Inside;
-    }
-    else if (startInside) {
-        return exports.RangeComparison.OverlapBack;
-    }
-    else if (endInside) {
-        return exports.RangeComparison.OverlapFront;
-    }
-    else {
-        return exports.RangeComparison.Outside;
-    }
-}
-function inRange(range, to) {
-    const comparison = compareRange(range, to);
-    return comparison > exports.RangeComparison.After;
-}
-// The \p{L} regex matches any unicode letter character, i.e. characters from non-english alphabets
-// Together with \w it matches any kind of character which can commonly appear in IDs
-const DefaultNameRegexp = /^[\w\p{L}]$/u;
-function findCommentNode(cstNode, commentNames) {
-    if (cstNode) {
-        const previous = getPreviousNode(cstNode, true);
-        if (previous && isCommentNode(previous, commentNames)) {
-            return previous;
-        }
-        if (syntaxTree.isRootCstNode(cstNode)) {
-            // Go from the first non-hidden node through all nodes in reverse order
-            // We do this to find the comment node which directly precedes the root node
-            const endIndex = cstNode.content.findIndex(e => !e.hidden);
-            for (let i = endIndex - 1; i >= 0; i--) {
-                const child = cstNode.content[i];
-                if (isCommentNode(child, commentNames)) {
-                    return child;
-                }
-            }
-        }
-    }
-    return undefined;
-}
-function isCommentNode(cstNode, commentNames) {
-    return syntaxTree.isLeafCstNode(cstNode) && commentNames.includes(cstNode.tokenType.name);
-}
-function getPreviousNode(node, hidden = true) {
-    while (node.container) {
-        const parent = node.container;
-        let index = parent.content.indexOf(node);
-        while (index > 0) {
-            index--;
-            const previous = parent.content[index];
-            if (hidden || !previous.hidden) {
-                return previous;
-            }
-        }
-        node = parent;
-    }
-    return undefined;
-}
-
-exports.DefaultNameRegexp = DefaultNameRegexp;
-exports.compareRange = compareRange;
-exports.findCommentNode = findCommentNode;
-exports.getPreviousNode = getPreviousNode;
-exports.inRange = inRange;
-exports.isChildNode = isChildNode;
-exports.isCommentNode = isCommentNode;
-exports.streamCst = streamCst;
-exports.toDocumentSegment = toDocumentSegment;
-exports.tokenToRange = tokenToRange;

package/dist/node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/utils/cst-utils.mjs

@@ -1,138 +0,0 @@
-import { isCompositeCstNode, isRootCstNode, isLeafCstNode } from '../syntax-tree.mjs';
-import { TreeStreamImpl } from './stream.mjs';
-
-/******************************************************************************
- * 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.
- ******************************************************************************/
-/**
- * Create a stream of all CST nodes that are directly and indirectly contained in the given root node,
- * including the root node itself.
- */
-function streamCst(node) {
-    return new TreeStreamImpl(node, element => {
-        if (isCompositeCstNode(element)) {
-            return element.content;
-        }
-        else {
-            return [];
-        }
-    }, { includeRoot: true });
-}
-/**
- * Determines whether the specified cst node is a child of the specified parent node.
- */
-function isChildNode(child, parent) {
-    while (child.container) {
-        child = child.container;
-        if (child === parent) {
-            return true;
-        }
-    }
-    return false;
-}
-function tokenToRange(token) {
-    // Chevrotain uses 1-based indices everywhere
-    // So we subtract 1 from every value to align with the LSP
-    return {
-        start: {
-            character: token.startColumn - 1,
-            line: token.startLine - 1
-        },
-        end: {
-            character: token.endColumn, // endColumn uses the correct index
-            line: token.endLine - 1
-        }
-    };
-}
-function toDocumentSegment(node) {
-    if (!node) {
-        return undefined;
-    }
-    const { offset, end, range } = node;
-    return {
-        range,
-        offset,
-        end,
-        length: end - offset
-    };
-}
-var RangeComparison;
-(function (RangeComparison) {
-    RangeComparison[RangeComparison["Before"] = 0] = "Before";
-    RangeComparison[RangeComparison["After"] = 1] = "After";
-    RangeComparison[RangeComparison["OverlapFront"] = 2] = "OverlapFront";
-    RangeComparison[RangeComparison["OverlapBack"] = 3] = "OverlapBack";
-    RangeComparison[RangeComparison["Inside"] = 4] = "Inside";
-    RangeComparison[RangeComparison["Outside"] = 5] = "Outside";
-})(RangeComparison || (RangeComparison = {}));
-function compareRange(range, to) {
-    if (range.end.line < to.start.line || (range.end.line === to.start.line && range.end.character <= to.start.character)) {
-        return RangeComparison.Before;
-    }
-    else if (range.start.line > to.end.line || (range.start.line === to.end.line && range.start.character >= to.end.character)) {
-        return RangeComparison.After;
-    }
-    const startInside = range.start.line > to.start.line || (range.start.line === to.start.line && range.start.character >= to.start.character);
-    const endInside = range.end.line < to.end.line || (range.end.line === to.end.line && range.end.character <= to.end.character);
-    if (startInside && endInside) {
-        return RangeComparison.Inside;
-    }
-    else if (startInside) {
-        return RangeComparison.OverlapBack;
-    }
-    else if (endInside) {
-        return RangeComparison.OverlapFront;
-    }
-    else {
-        return RangeComparison.Outside;
-    }
-}
-function inRange(range, to) {
-    const comparison = compareRange(range, to);
-    return comparison > RangeComparison.After;
-}
-// The \p{L} regex matches any unicode letter character, i.e. characters from non-english alphabets
-// Together with \w it matches any kind of character which can commonly appear in IDs
-const DefaultNameRegexp = /^[\w\p{L}]$/u;
-function findCommentNode(cstNode, commentNames) {
-    if (cstNode) {
-        const previous = getPreviousNode(cstNode, true);
-        if (previous && isCommentNode(previous, commentNames)) {
-            return previous;
-        }
-        if (isRootCstNode(cstNode)) {
-            // Go from the first non-hidden node through all nodes in reverse order
-            // We do this to find the comment node which directly precedes the root node
-            const endIndex = cstNode.content.findIndex(e => !e.hidden);
-            for (let i = endIndex - 1; i >= 0; i--) {
-                const child = cstNode.content[i];
-                if (isCommentNode(child, commentNames)) {
-                    return child;
-                }
-            }
-        }
-    }
-    return undefined;
-}
-function isCommentNode(cstNode, commentNames) {
-    return isLeafCstNode(cstNode) && commentNames.includes(cstNode.tokenType.name);
-}
-function getPreviousNode(node, hidden = true) {
-    while (node.container) {
-        const parent = node.container;
-        let index = parent.content.indexOf(node);
-        while (index > 0) {
-            index--;
-            const previous = parent.content[index];
-            if (hidden || !previous.hidden) {
-                return previous;
-            }
-        }
-        node = parent;
-    }
-    return undefined;
-}
-
-export { DefaultNameRegexp, RangeComparison, compareRange, findCommentNode, getPreviousNode, inRange, isChildNode, isCommentNode, streamCst, toDocumentSegment, tokenToRange };

package/dist/node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/utils/disposable.js

@@ -1,16 +0,0 @@
-'use strict';
-
-/******************************************************************************
- * 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.
- ******************************************************************************/
-exports.Disposable = void 0;
-(function (Disposable) {
-    function create(callback) {
-        return {
-            dispose: async () => await callback()
-        };
-    }
-    Disposable.create = create;
-})(exports.Disposable || (exports.Disposable = {}));