@vscode/chat-lib 0.1.2 → 0.1.3-1

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/subsetMatching.js

@@ -0,0 +1,135 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BlockTokenSubsetMatcher = void 0;
+const parse_1 = require("../parse");
+const cursorContext_1 = require("./cursorContext");
+const selectRelevance_1 = require("./selectRelevance");
+const windowDelineations_1 = require("./windowDelineations");
+/**
+ * Implements an evolution of the FixedWindowSizeJaccardMatcher that is different in two ways.
+ * 1. The source tokens window is the enclosing class member, as determined by Tree-Sitter.
+ * 2. The scoring algorithm is a unidirectional set membership check (count of items from A that exist in B)
+ *    rather than a set difference.
+ */
+class BlockTokenSubsetMatcher extends selectRelevance_1.WindowedMatcher {
+    constructor(referenceDoc, windowLength) {
+        super(referenceDoc);
+        this.windowLength = windowLength;
+    }
+    static { this.FACTORY = (windowLength) => {
+        return {
+            to: (referenceDoc) => new BlockTokenSubsetMatcher(referenceDoc, windowLength),
+        };
+    }; }
+    id() {
+        return 'fixed:' + this.windowLength;
+    }
+    getWindowsDelineations(lines) {
+        return (0, windowDelineations_1.getBasicWindowDelineations)(this.windowLength, lines);
+    }
+    _getCursorContextInfo(referenceDoc) {
+        return (0, cursorContext_1.getCursorContext)(referenceDoc, {
+            maxLineCount: this.windowLength,
+        });
+    }
+    get referenceTokens() {
+        return this.createReferenceTokensForLanguage();
+    }
+    async createReferenceTokensForLanguage() {
+        if (this.referenceTokensCache) {
+            return this.referenceTokensCache;
+        }
+        // Syntax aware reference tokens uses tree-sitter based parsing to identify the bounds of the current
+        // method and extracts tokens from just that span for use as the reference set.
+        this.referenceTokensCache = BlockTokenSubsetMatcher.syntaxAwareSupportsLanguage(this.referenceDoc.languageId)
+            ? await this.syntaxAwareReferenceTokens()
+            : await super.referenceTokens;
+        return this.referenceTokensCache;
+    }
+    async syntaxAwareReferenceTokens() {
+        // See if there is an enclosing class or type member.
+        const start = (await this.getEnclosingMemberStart(this.referenceDoc.source, this.referenceDoc.offset))
+            ?.startIndex;
+        const end = this.referenceDoc.offset;
+        // If not, fallback to the 60-line chunk behavior.
+        const text = start
+            ? this.referenceDoc.source.slice(start, end)
+            : (0, cursorContext_1.getCursorContext)(this.referenceDoc, {
+                maxLineCount: this.windowLength,
+            }).context;
+        // Extract the tokens.
+        return this.tokenizer.tokenize(text);
+    }
+    static syntaxAwareSupportsLanguage(languageId) {
+        switch (languageId) {
+            case 'csharp':
+                return true;
+            default:
+                return false;
+        }
+    }
+    similarityScore(a, b) {
+        return computeScore(a, b);
+    }
+    async getEnclosingMemberStart(text, offset) {
+        let tree;
+        try {
+            tree = await (0, parse_1.parseTreeSitter)(this.referenceDoc.languageId, text);
+            let nodeAtPos = tree.rootNode.namedDescendantForIndex(offset);
+            while (nodeAtPos) {
+                // For now, hard code for C#.
+                if (BlockTokenSubsetMatcher.isMember(nodeAtPos) || BlockTokenSubsetMatcher.isBlock(nodeAtPos)) {
+                    break;
+                }
+                nodeAtPos = nodeAtPos.parent ?? undefined;
+            }
+            return nodeAtPos;
+        }
+        finally {
+            tree?.delete();
+        }
+    }
+    static isMember(node) {
+        // For now, hard code for C#.
+        switch (node?.type) {
+            case 'method_declaration':
+            case 'property_declaration':
+            case 'field_declaration':
+            case 'constructor_declaration':
+                return true;
+            default:
+                return false;
+        }
+    }
+    static isBlock(node) {
+        // For now, hard code for C#.
+        switch (node?.type) {
+            case 'class_declaration':
+            case 'struct_declaration':
+            case 'record_declaration':
+            case 'enum_declaration':
+            case 'interface_declaration':
+                return true;
+            default:
+                return false;
+        }
+    }
+}
+exports.BlockTokenSubsetMatcher = BlockTokenSubsetMatcher;
+/**
+ * Count the number of unique tokens from B that are also in A.
+ */
+function computeScore(a, b) {
+    const subsetOverlap = new Set();
+    b.forEach(x => {
+        if (a.has(x)) {
+            subsetOverlap.add(x);
+        }
+    });
+    return subsetOverlap.size;
+}
+//# sourceMappingURL=subsetMatching.js.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/subsetMatching.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subsetMatching.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/subsetMatching.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,oCAA2C;AAE3C,mDAAsE;AACtE,uDAAoD;AACpD,6DAAkE;AAGlE;;;;;GAKG;AACH,MAAa,uBAAwB,SAAQ,iCAAe;IAG3D,YAAoB,YAAoC,EAAE,YAAoB;QAC7E,KAAK,CAAC,YAAY,CAAC,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IAClC,CAAC;aAEM,YAAO,GAAG,CAAC,YAAoB,EAAE,EAAE;QACzC,OAAO;YACN,EAAE,EAAE,CAAC,YAAoC,EAAE,EAAE,CAAC,IAAI,uBAAuB,CAAC,YAAY,EAAE,YAAY,CAAC;SACrG,CAAC;IACH,CAAC,CAAC;IAEQ,EAAE;QACX,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACrC,CAAC;IAES,sBAAsB,CAAC,KAAe;QAC/C,OAAO,IAAA,+CAA0B,EAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAC7D,CAAC;IAES,qBAAqB,CAAC,YAAoC;QACnE,OAAO,IAAA,gCAAgB,EAAC,YAAY,EAAE;YACrC,YAAY,EAAE,IAAI,CAAC,YAAY;SAC/B,CAAC,CAAC;IACJ,CAAC;IAED,IAAa,eAAe;QAC3B,OAAO,IAAI,CAAC,gCAAgC,EAAE,CAAC;IAChD,CAAC;IAEO,KAAK,CAAC,gCAAgC;QAC7C,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,oBAAoB,CAAC;QAClC,CAAC;QAED,qGAAqG;QACrG,+EAA+E;QAC/E,IAAI,CAAC,oBAAoB,GAAG,uBAAuB,CAAC,2BAA2B,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAC5G,CAAC,CAAC,MAAM,IAAI,CAAC,0BAA0B,EAAE;YACzC,CAAC,CAAC,MAAM,KAAK,CAAC,eAAe,CAAC;QAE/B,OAAO,IAAI,CAAC,oBAAoB,CAAC;IAClC,CAAC;IAEO,KAAK,CAAC,0BAA0B;QACvC,qDAAqD;QACrD,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACrG,EAAE,UAAU,CAAC;QACd,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QAErC,kDAAkD;QAClD,MAAM,IAAI,GAAG,KAAK;YACjB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC;YAC5C,CAAC,CAAC,IAAA,gCAAgB,EAAC,IAAI,CAAC,YAAY,EAAE;gBACrC,YAAY,EAAE,IAAI,CAAC,YAAY;aAC/B,CAAC,CAAC,OAAO,CAAC;QAEZ,sBAAsB;QACtB,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAEO,MAAM,CAAC,2BAA2B,CAAC,UAAkB;QAC5D,QAAQ,UAAU,EAAE,CAAC;YACpB,KAAK,QAAQ;gBACZ,OAAO,IAAI,CAAC;YACb;gBACC,OAAO,KAAK,CAAC;QACf,CAAC;IACF,CAAC;IAES,eAAe,CAAC,CAAc,EAAE,CAAc;QACvD,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,CAAC,uBAAuB,CAAC,IAAY,EAAE,MAAc;QACzD,IAAI,IAA6B,CAAC;QAElC,IAAI,CAAC;YACJ,IAAI,GAAG,MAAM,IAAA,uBAAe,EAAC,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAEjE,IAAI,SAAS,GAAkC,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;YAE7F,OAAO,SAAS,EAAE,CAAC;gBAClB,6BAA6B;gBAC7B,IAAI,uBAAuB,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,uBAAuB,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC/F,MAAM;gBACP,CAAC;gBAED,SAAS,GAAG,SAAS,CAAC,MAAM,IAAI,SAAS,CAAC;YAC3C,CAAC;YAED,OAAO,SAAS,CAAC;QAClB,CAAC;gBAAS,CAAC;YACV,IAAI,EAAE,MAAM,EAAE,CAAC;QAChB,CAAC;IACF,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,IAAmC;QAClD,6BAA6B;QAC7B,QAAQ,IAAI,EAAE,IAAI,EAAE,CAAC;YACpB,KAAK,oBAAoB,CAAC;YAC1B,KAAK,sBAAsB,CAAC;YAC5B,KAAK,mBAAmB,CAAC;YACzB,KAAK,yBAAyB;gBAC7B,OAAO,IAAI,CAAC;YACb;gBACC,OAAO,KAAK,CAAC;QACf,CAAC;IACF,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,IAAmC;QACjD,6BAA6B;QAC7B,QAAQ,IAAI,EAAE,IAAI,EAAE,CAAC;YACpB,KAAK,mBAAmB,CAAC;YACzB,KAAK,oBAAoB,CAAC;YAC1B,KAAK,oBAAoB,CAAC;YAC1B,KAAK,kBAAkB,CAAC;YACxB,KAAK,uBAAuB;gBAC3B,OAAO,IAAI,CAAC;YACb;gBACC,OAAO,KAAK,CAAC;QACf,CAAC;IACF,CAAC;;AA5HF,0DA6HC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,CAAc,EAAE,CAAc;IACnD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;IAEhC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACd,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,OAAO,aAAa,CAAC,IAAI,CAAC;AAC3B,CAAC"}

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/windowDelineations.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Returns a list of (startline, endline) pairs representing fixed size windows
+ *
+ * @param windowLength length of fixed size window
+ * @param lines lines to extract fixed size windows from
+ * @returns list of (startline, endline) pairs
+ */
+export declare function getBasicWindowDelineations(windowLength: number, lines: string[]): [number, number][];
+/**
+ * Calculate all windows like with the following properties:
+ * - they are all of length <= maxLength
+ * - they are all of length >= minLength
+ *   - except if they are followed by enough blank lines to reach length >= minLength
+ * - they are a contiguous subsequence from [parentline, child1, child2, ..., childn]
+ * - which neither starts nor ends with a blank line
+ * Note that windows of the form "parent with all its children" could
+ * appear in different ways with that definition,
+ * e.g. as "childi" of its parent, and as "parent, child1, ..., childn" where the parent is itself.
+ * Nevertheless, it will only be listed once.
+ * @param lines
+ */
+export declare function getIndentationWindowsDelineations(lines: string[], languageId: string, minLength: number, maxLength: number): [number, number][];
+//# sourceMappingURL=windowDelineations.d.ts.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/windowDelineations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"windowDelineations.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/windowDelineations.ts"],"names":[],"mappings":"AASA;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAcpG;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,iCAAiC,CAChD,KAAK,EAAE,MAAM,EAAE,EACf,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,GACf,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CA8FpB"}

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/windowDelineations.js

@@ -0,0 +1,132 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getBasicWindowDelineations = getBasicWindowDelineations;
+exports.getIndentationWindowsDelineations = getIndentationWindowsDelineations;
+const manipulation_1 = require("../indentation/manipulation");
+const parsing_1 = require("../indentation/parsing");
+/**
+ * Returns a list of (startline, endline) pairs representing fixed size windows
+ *
+ * @param windowLength length of fixed size window
+ * @param lines lines to extract fixed size windows from
+ * @returns list of (startline, endline) pairs
+ */
+function getBasicWindowDelineations(windowLength, lines) {
+    const windows = [];
+    const length = lines.length;
+    if (length === 0) {
+        return [];
+    }
+    if (length < windowLength) {
+        // if not long enough to reach a single window length, return full document
+        return [[0, length]];
+    }
+    for (let startLine = 0; startLine < length - windowLength + 1; startLine++) {
+        windows.push([startLine, startLine + windowLength]);
+    }
+    return windows;
+}
+/**
+ * Calculate all windows like with the following properties:
+ * - they are all of length <= maxLength
+ * - they are all of length >= minLength
+ *   - except if they are followed by enough blank lines to reach length >= minLength
+ * - they are a contiguous subsequence from [parentline, child1, child2, ..., childn]
+ * - which neither starts nor ends with a blank line
+ * Note that windows of the form "parent with all its children" could
+ * appear in different ways with that definition,
+ * e.g. as "childi" of its parent, and as "parent, child1, ..., childn" where the parent is itself.
+ * Nevertheless, it will only be listed once.
+ * @param lines
+ */
+function getIndentationWindowsDelineations(lines, languageId, minLength, maxLength) {
+    // Deal with degenerate cases
+    if (lines.length < minLength || maxLength === 0) {
+        return [];
+    }
+    const windows = [];
+    // Todo: add groupBlocks here as well
+    const labeledTree = (0, manipulation_1.clearLabels)((0, parsing_1.parseTree)(lines.join('\n'), languageId));
+    (0, manipulation_1.visitTree)(labeledTree, node => {
+        if (node.type === 'blank') {
+            node.label = { totalLength: 1, firstLineAfter: node.lineNumber + 1 };
+            return;
+        }
+        // Statistics to gather on the way, to be consumed by parents
+        let totalLength = node.type === 'line' ? 1 : 0;
+        let firstLineAfter = node.type === 'line' ? node.lineNumber + 1 : NaN;
+        // we consider intervals [a, b] which correspond to including children number a (-1 means parent) through b exclusive.
+        // the window start and end lines are computed here, such that startLine (inclusive) to endLine (exclusive) covers the window
+        function getStartLine(a) {
+            return a === -1
+                ? firstLineAfter - totalLength
+                : node.subs[a].label.firstLineAfter - node.subs[a].label.totalLength;
+        }
+        function getEndLine(b, startLine) {
+            return b === 0 ? startLine + 1 : node.subs[b - 1].label.firstLineAfter;
+        }
+        // iteratively go through candidates for [a, b[:
+        // if from a to including b would be too long, add the window a to b exclusive and increase a as far as necessary, otherwise increase b
+        // a = -1 will mean: include the parent
+        let a = node.type === 'line' ? -1 : 0; // if the parent is a line, consider using it
+        let lengthFromAToBInclusive = node.type === 'line' ? 1 : 0; // if so, the length is 1, otherwise 0
+        let lastBThatWasntABlank = 0;
+        for (let b = 0; b < node.subs.length; b++) {
+            // don't let the window start with blank lines
+            while (a >= 0 && a < node.subs.length && node.subs[a].type === 'blank') {
+                lengthFromAToBInclusive -= node.subs[a].label.totalLength;
+                a++;
+            }
+            if (node.subs[b].type !== 'blank') {
+                lastBThatWasntABlank = b;
+            }
+            // add subs[b] to the window
+            firstLineAfter = node.subs[b].label.firstLineAfter;
+            totalLength += node.subs[b].label.totalLength;
+            lengthFromAToBInclusive += node.subs[b].label.totalLength;
+            if (lengthFromAToBInclusive > maxLength) {
+                const startLine = getStartLine(a);
+                const endLine = getEndLine(b, startLine);
+                const endLineTrimmedForBlanks = lastBThatWasntABlank === b ? endLine : getEndLine(lastBThatWasntABlank, startLine);
+                // for the test, note that blanks count for getting us over the minLength:
+                if (minLength <= endLine - startLine) {
+                    windows.push([startLine, endLineTrimmedForBlanks]);
+                }
+                while (lengthFromAToBInclusive > maxLength) {
+                    // remove subs[a] from the window
+                    lengthFromAToBInclusive -=
+                        a === -1
+                            ? node.type === 'line'
+                                ? 1
+                                : // this cannot happen: if not a line, we start with a = 0 unless it's a line
+                                    0
+                            : node.subs[a].label.totalLength;
+                    a++;
+                }
+            }
+        }
+        // if there's anything left to add (a < b), do it
+        if (a < node.subs.length) {
+            const startLine = getStartLine(a);
+            const endLine = firstLineAfter;
+            const endLineTrimmedForBlanks = a === -1 ? endLine : node.subs[lastBThatWasntABlank].label.firstLineAfter;
+            // note: even if fillUpWindowWithPartOfNextNeighbor is true,
+            // there is no next similar file here, so nothing to extend the window to
+            if (minLength <= endLine - startLine) {
+                windows.push([startLine, endLineTrimmedForBlanks]);
+            }
+            // Set the node's label
+        }
+        node.label = { totalLength, firstLineAfter };
+    }, 'bottomUp');
+    // windows is an array of [start, end] pairs,
+    // but some may appear twice, and should be removed
+    return windows
+        .sort((a, b) => a[0] - b[0] || a[1] - b[1])
+        .filter((a, i, arr) => i === 0 || a[0] !== arr[i - 1][0] || a[1] !== arr[i - 1][1]);
+}
+//# sourceMappingURL=windowDelineations.js.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/windowDelineations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"windowDelineations.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/snippetInclusion/windowDelineations.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAahG,gEAcC;AAeD,8EAmGC;AA1ID,8DAAqE;AACrE,oDAAmD;AAEnD;;;;;;GAMG;AACH,SAAgB,0BAA0B,CAAC,YAAoB,EAAE,KAAe;IAC/E,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,EAAE,CAAC;IACX,CAAC;IACD,IAAI,MAAM,GAAG,YAAY,EAAE,CAAC;QAC3B,2EAA2E;QAC3E,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,MAAM,GAAG,YAAY,GAAG,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;QAC5E,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,iCAAiC,CAChD,KAAe,EACf,UAAkB,EAClB,SAAiB,EACjB,SAAiB;IAEjB,6BAA6B;IAC7B,IAAI,KAAK,CAAC,MAAM,GAAG,SAAS,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACjD,OAAO,EAAE,CAAC;IACX,CAAC;IAED,MAAM,OAAO,GAAuB,EAAE,CAAC;IAGvC,qCAAqC;IACrC,MAAM,WAAW,GAAG,IAAA,0BAAW,EAAC,IAAA,mBAAS,EAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAA+B,CAAC;IACvG,IAAA,wBAAS,EACR,WAAW,EACX,IAAI,CAAC,EAAE;QACN,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YACrE,OAAO;QACR,CAAC;QACD,6DAA6D;QAC7D,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,cAAc,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACtE,sHAAsH;QACtH,6HAA6H;QAC7H,SAAS,YAAY,CAAC,CAAS;YAC9B,OAAO,CAAC,KAAK,CAAC,CAAC;gBACd,CAAC,CAAC,cAAc,GAAG,WAAW;gBAC9B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,WAAW,CAAC;QACzE,CAAC;QACD,SAAS,UAAU,CAAC,CAAS,EAAE,SAAiB;YAC/C,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAM,CAAC,cAAc,CAAC;QACzE,CAAC;QACD,gDAAgD;QAChD,uIAAuI;QACvI,uCAAuC;QACvC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,6CAA6C;QACpF,IAAI,uBAAuB,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,sCAAsC;QAClG,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,8CAA8C;YAC9C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBACxE,uBAAuB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,WAAW,CAAC;gBAC3D,CAAC,EAAE,CAAC;YACL,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBACnC,oBAAoB,GAAG,CAAC,CAAC;YAC1B,CAAC;YACD,4BAA4B;YAC5B,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,cAAc,CAAC;YACpD,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,WAAW,CAAC;YAC/C,uBAAuB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,WAAW,CAAC;YAC3D,IAAI,uBAAuB,GAAG,SAAS,EAAE,CAAC;gBACzC,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBACzC,MAAM,uBAAuB,GAC5B,oBAAoB,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,oBAAoB,EAAE,SAAS,CAAC,CAAC;gBACpF,0EAA0E;gBAC1E,IAAI,SAAS,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;oBACtC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,uBAAuB,CAAC,CAAC,CAAC;gBACpD,CAAC;gBACD,OAAO,uBAAuB,GAAG,SAAS,EAAE,CAAC;oBAC5C,iCAAiC;oBACjC,uBAAuB;wBACtB,CAAC,KAAK,CAAC,CAAC;4BACP,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM;gCACrB,CAAC,CAAC,CAAC;gCACH,CAAC,CAAC,4EAA4E;oCAC9E,CAAC;4BACF,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC,WAAW,CAAC;oBACpC,CAAC,EAAE,CAAC;gBACL,CAAC;YACF,CAAC;QACF,CAAC;QACD,iDAAiD;QACjD,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,OAAO,GAAG,cAAc,CAAC;YAC/B,MAAM,uBAAuB,GAC5B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,KAAM,CAAC,cAAc,CAAC;YAC5E,4DAA4D;YAC5D,yEAAyE;YACzE,IAAI,SAAS,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;gBACtC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,uBAAuB,CAAC,CAAC,CAAC;YACpD,CAAC;YACD,uBAAuB;QACxB,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,WAAW,EAAE,cAAc,EAAE,CAAC;IAC9C,CAAC,EACD,UAAU,CACV,CAAC;IACF,6CAA6C;IAC7C,mDAAmD;IACnD,OAAO,OAAO;SACZ,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC1C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtF,CAAC"}

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/suffixMatchCriteria.d.ts

@@ -0,0 +1,6 @@
+interface ScoredSuffix {
+    score: number;
+}
+export declare function findEditDistanceScore(a: number[], b: number[]): ScoredSuffix;
+export {};
+//# sourceMappingURL=suffixMatchCriteria.d.ts.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/suffixMatchCriteria.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"suffixMatchCriteria.d.ts","sourceRoot":"","sources":["../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/suffixMatchCriteria.ts"],"names":[],"mappings":"AAIA,UAAU,YAAY;IACrB,KAAK,EAAE,MAAM,CAAC;CACd;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,YAAY,CAyB5E"}

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/suffixMatchCriteria.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findEditDistanceScore = findEditDistanceScore;
+function findEditDistanceScore(a, b) {
+    if (a.length === 0 || b.length === 0) {
+        return { score: a.length + b.length };
+    }
+    const matrix = Array.from({ length: a.length }).map(() => Array.from({ length: b.length }).map(() => 0));
+    for (let i = 0; i < a.length; i++) {
+        matrix[i][0] = i;
+    }
+    for (let i = 0; i < b.length; i++) {
+        matrix[0][i] = i;
+    }
+    for (let j = 0; j < b.length; j++) {
+        for (let i = 0; i < a.length; i++) {
+            matrix[i][j] = Math.min((i === 0 ? j : matrix[i - 1][j]) + 1, (j === 0 ? i : matrix[i][j - 1]) + 1, (i === 0 || j === 0 ? Math.max(i, j) : matrix[i - 1][j - 1]) + (a[i] === b[j] ? 0 : 1));
+        }
+    }
+    return { score: matrix[a.length - 1][b.length - 1] };
+}
+//# sourceMappingURL=suffixMatchCriteria.js.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/suffixMatchCriteria.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"suffixMatchCriteria.js","sourceRoot":"","sources":["../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/suffixMatchCriteria.ts"],"names":[],"mappings":";;AAQA,sDAyBC;AAzBD,SAAgB,qBAAqB,CAAC,CAAW,EAAE,CAAW;IAC7D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;IACvC,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACtB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EACpC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EACpC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACtF,CAAC;QACH,CAAC;IACF,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;AACtD,CAAC"}

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/index.d.ts

@@ -0,0 +1,2 @@
+export * from './tokenizer';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/index.ts"],"names":[],"mappings":"AAKA,cAAc,aAAa,CAAC"}

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/index.js

@@ -0,0 +1,22 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./tokenizer"), exports);
+//# sourceMappingURL=index.js.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/index.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;;;;;;;;;;;;;;AAEhG,8CAA4B"}

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/tokenizer.d.ts

@@ -0,0 +1,116 @@
+import { TikTokenizer } from '@microsoft/tiktokenizer';
+export declare enum TokenizerName {
+    cl100k = "cl100k_base",
+    o200k = "o200k_base",
+    mock = "mock"
+}
+export declare function getTokenizer(name?: TokenizerName): Tokenizer;
+export interface Tokenizer {
+    /**
+     * Return the length of `text` in number of tokens.
+     *
+     * @param text - The input text
+     * @returns
+     */
+    tokenLength(text: string): number;
+    /**
+     * Returns the tokens created from tokenizing `text`.
+     * @param text The text to tokenize
+     */
+    tokenize(text: string): number[];
+    /**
+     * Returns the string representation of the tokens in `tokens`, given in integer
+     * representation.
+     *
+     * This is the functional inverse of `tokenize`.
+     */
+    detokenize(tokens: number[]): string;
+    /**
+     * Returns the tokenization of the input string as a list of strings.
+     *
+     * The concatenation of the output of this function is equal to the input.
+     */
+    tokenizeStrings(text: string): string[];
+    /**
+     * Return a suffix of `text` which is `n` tokens long.
+     * If `text` is at most `n` tokens, return `text`.
+     *
+     * Note: This implementation does not attempt to return
+     * the longest possible suffix, only *some* suffix of at
+     * most `n` tokens.
+     *
+     * @param text - The text from which to take
+     * @param n - How many tokens to take
+     * @returns A suffix of `text`, as a `{ text: string, tokens: number[] }`.
+     */
+    takeLastTokens(text: string, n: number): {
+        text: string;
+        tokens: number[];
+    };
+    /**
+     * Return a prefix of `text` which is `n` tokens long.
+     * If `text` is at most `n` tokens, return `text`.
+     *
+     * Note: This implementation does not attempt to return
+     * the longest possible prefix, only *some* prefix of at
+     * most `n` tokens.
+     *
+     * @param text - The text from which to take
+     * @param n - How many tokens to take
+     * @returns A prefix of `text`, as a `{ text: string, tokens: number[] }`.
+     */
+    takeFirstTokens(text: string, n: number): {
+        text: string;
+        tokens: number[];
+    };
+    /**
+     * Return the longest suffix of `text` of complete lines and is at most
+     * `n` tokens long.
+     * @param text - The text from which to take
+     * @param n - How many tokens to take
+     */
+    takeLastLinesTokens(text: string, n: number): string;
+}
+export declare class TTokenizer implements Tokenizer {
+    private readonly _tokenizer;
+    constructor(_tokenizer: TikTokenizer);
+    static create(encoder: TokenizerName): Promise<TTokenizer>;
+    tokenize(text: string): number[];
+    detokenize(tokens: number[]): string;
+    tokenLength(text: string): number;
+    tokenizeStrings(text: string): string[];
+    takeLastTokens(text: string, n: number): {
+        text: string;
+        tokens: number[];
+    };
+    takeFirstTokens(text: string, n: number): {
+        text: string;
+        tokens: number[];
+    };
+    takeLastLinesTokens(text: string, n: number): string;
+}
+/** A best effort tokenizer computing the length of the text by dividing the
+ * number of characters by estimated constants near the number 4.
+ * It is not a real tokenizer. */
+export declare class ApproximateTokenizer implements Tokenizer {
+    private languageId?;
+    tokenizerName: TokenizerName;
+    constructor(tokenizerName?: TokenizerName, languageId?: string | undefined);
+    tokenize(text: string): number[];
+    detokenize(tokens: number[]): string;
+    tokenizeStrings(text: string): string[];
+    private getEffectiveTokenLength;
+    tokenLength(text: string): number;
+    takeLastTokens(text: string, n: number): {
+        text: string;
+        tokens: number[];
+    };
+    takeFirstTokens(text: string, n: number): {
+        text: string;
+        tokens: number[];
+    };
+    takeLastLinesTokens(text: string, n: number): string;
+}
+/** Load tokenizers on start. Export promise for to be awaited by initialization. */
+export declare const initializeTokenizers: Promise<void>;
+//# sourceMappingURL=tokenizer.d.ts.map

package/dist/src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/tokenizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenizer.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/tokenization/tokenizer.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,YAAY,EAAiE,MAAM,yBAAyB,CAAC;AAKtH,oBAAY,aAAa;IACxB,MAAM,gBAAgB;IACtB,KAAK,eAAe;IACpB,IAAI,SAAS;CACb;AAID,wBAAgB,YAAY,CAAC,IAAI,GAAE,aAAmC,GAAG,SAAS,CAQjF;AAED,MAAM,WAAW,SAAS;IACzB;;;;;OAKG;IACH,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IAElC;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAEjC;;;;;OAKG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IAErC;;;;OAIG;IACH,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAExC;;;;;;;;;;;OAWG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAE5E;;;;;;;;;;;OAWG;IACH,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAE7E;;;;;OAKG;IACH,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACrD;AAED,qBAAa,UAAW,YAAW,SAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,UAAU;gBAAV,UAAU,EAAE,YAAY;WAExC,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,UAAU,CAAC;IAiBhE,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAIhC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAIpC,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAIjC,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAKvC,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAyB3E,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAiC5E,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;CASpD;AAuFD;;iCAEiC;AACjC,qBAAa,oBAAqB,YAAW,SAAS;IAKpD,OAAO,CAAC,UAAU,CAAC;IAJpB,aAAa,EAAE,aAAa,CAAC;gBAG5B,aAAa,GAAE,aAAmC,EAC1C,UAAU,CAAC,EAAE,MAAM,YAAA;IAK5B,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAUhC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAgBpC,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAKvC,OAAO,CAAC,uBAAuB;IAY/B,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAIjC,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAO3E,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAO5E,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;CASpD;AAWD,oFAAoF;AACpF,eAAO,MAAM,oBAAoB,eAG7B,CAAC"}