@vscode/chat-lib 0.1.2 → 0.1.3-1

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/editDistance.d.ts

@@ -0,0 +1,88 @@
+interface Alignment {
+    distance: number;
+    startOffset: number;
+    endOffset: number;
+}
+/**
+ * Computes the best alignment, under edit-distance, of placing `needle` within
+ * `haystack`. These may be strings or arrays.
+ *
+ * In other words, the entirety of `needle` will count towards the distance,
+ * while only the sub-range within `haystack` corresponding to the best match
+ * will be included. This means `editDistance(a, b) !== editDistance(b, a)` in
+ * general.
+ *
+ * If `needle` and `haystack` are strings, the distance is in UTF-16 code units.
+ * For instance, an emoji inserted in `needle` will increase the distance by 2,
+ * while an ASCII character will increase it only by one.
+ *
+ * @param haystack The big string or array within which the needle should match
+ * @param needle The small string or array to match
+ * @param compare An optional comparison operator for the elements of `haystack`
+ * and `needle`. It should return a "cost" for substituting a given element of
+ * `haystack` with a given element of `needle`. If these elements are equal then
+ * `compare` should return 0. The indices of these elements are also given to
+ * compare.
+ *
+ * @returns An alignment of the best match possible, with offsets within
+ * `haystack`.
+ */
+export declare function editDistance<E, T extends string | E[]>(haystack: T, needle: T, compare?: (haystackElem: (typeof haystack)[number], needleElem: (typeof needle)[number], haystackIndex: number, needleIndex: number) => number): Alignment;
+type LexDictionary = Map<string, number>;
+interface LexGenerator {
+    (s: string): Generator<string, void, unknown>;
+}
+export declare function emptyLexDictionary(): LexDictionary;
+export declare function reverseLexDictionary(d: LexDictionary): string[];
+/**
+ * A simple lex generator.
+ * A lexeme is one of the following three:
+ *  1. A sequence of letters, numbers, _ and -
+ *  2. A sequence of spaces
+ *  3. Any other single Unicode code point
+ */
+export declare function lexGeneratorWords(s: string): Generator<string, void, unknown>;
+/**
+ * Convert a string into an array of lexeme ids, as defined by a lexeme dictionary.
+ *
+ * Lexemes not already in the dictionary will be added with a fresh key. Hence,
+ * this function can be called with an `emptyLexDictionary()`.
+ *
+ * @param s The string to convert
+ * @param lexDictionary The dictionary to begin with
+ * @param lexGenerator The generator to use to convert `s` into a stream of
+ * substring lexemes
+ * @param lexFilter Keep only lexemes satisfying this conditional
+ *
+ * @returns Pair containing:
+ *   - an array of (lexeme ids, lexeme starting offset within `s`),
+ *   - the updated dictionary.
+ */
+export declare function lexicalAnalyzer(s: string, d: LexDictionary, lexGenerator: LexGenerator, lexFilter: (lexeme: string) => boolean): [[number, number][], LexDictionary];
+interface LexAlignment {
+    lexDistance: number;
+    startOffset: number;
+    endOffset: number;
+    haystackLexLength: number;
+    needleLexLength: number;
+}
+/**
+ * Computes the best alignment, under edit-distance, of placing the lexemes of
+ * `needle` within those of `haystack`.
+ *
+ * More precisely, we compute the lex tokens of `needle` and `haystack` under
+ * the same dictionary, and then align these by their edit distance using
+ * `editDistance`. We then translate the offsets in the lex-match-alignment back
+ * to character offsets.
+ *
+ * @param haystack The big string within which the needle should match
+ * @param needle The small string to match
+ * @param lexGenerator Generator which chops up a string into lexemes
+ * @param lexFilter Keep only lexemes that return true on this function
+ *
+ * @returns An alignment of the best match possible, with offsets within
+ * `haystack`.
+ */
+export declare function lexEditDistance(haystack: string, needle: string, lexGenerator?: LexGenerator): LexAlignment;
+export {};
+//# sourceMappingURL=editDistance.d.ts.map

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/editDistance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"editDistance.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/editDistance.ts"],"names":[],"mappings":"AAIA,UAAU,SAAS;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,GAAG,CAAC,EAAE,EACrD,QAAQ,EAAE,CAAC,EACX,MAAM,EAAE,CAAC,EACT,OAAO,GAAE,CACR,YAAY,EAAE,CAAC,OAAO,QAAQ,CAAC,CAAC,MAAM,CAAC,EACvC,UAAU,EAAE,CAAC,OAAO,MAAM,CAAC,CAAC,MAAM,CAAC,EACnC,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,KACf,MAAoC,GACvC,SAAS,CAoDX;AAED,KAAK,aAAa,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEzC,UAAU,YAAY;IACrB,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;CAC9C;AAED,wBAAgB,kBAAkB,IAAI,aAAa,CAElD;AAED,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,EAAE,CAM/D;AAED;;;;;;GAMG;AACH,wBAAiB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAsB9E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,eAAe,CAC9B,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,aAAa,EAChB,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,GACpC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,aAAa,CAAC,CAWrC;AAMD,UAAU,YAAY;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,eAAe,CAC9B,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,YAAY,GAAE,YAAgC,GAC5C,YAAY,CAmDd"}

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/editDistance.js

@@ -0,0 +1,245 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.editDistance = editDistance;
+exports.emptyLexDictionary = emptyLexDictionary;
+exports.reverseLexDictionary = reverseLexDictionary;
+exports.lexGeneratorWords = lexGeneratorWords;
+exports.lexicalAnalyzer = lexicalAnalyzer;
+exports.lexEditDistance = lexEditDistance;
+/**
+ * Computes the best alignment, under edit-distance, of placing `needle` within
+ * `haystack`. These may be strings or arrays.
+ *
+ * In other words, the entirety of `needle` will count towards the distance,
+ * while only the sub-range within `haystack` corresponding to the best match
+ * will be included. This means `editDistance(a, b) !== editDistance(b, a)` in
+ * general.
+ *
+ * If `needle` and `haystack` are strings, the distance is in UTF-16 code units.
+ * For instance, an emoji inserted in `needle` will increase the distance by 2,
+ * while an ASCII character will increase it only by one.
+ *
+ * @param haystack The big string or array within which the needle should match
+ * @param needle The small string or array to match
+ * @param compare An optional comparison operator for the elements of `haystack`
+ * and `needle`. It should return a "cost" for substituting a given element of
+ * `haystack` with a given element of `needle`. If these elements are equal then
+ * `compare` should return 0. The indices of these elements are also given to
+ * compare.
+ *
+ * @returns An alignment of the best match possible, with offsets within
+ * `haystack`.
+ */
+function editDistance(haystack, needle, compare = (h, n) => (h === n ? 0 : 1)) {
+    if (needle.length === 0 || haystack.length === 0) {
+        return { distance: needle.length, startOffset: 0, endOffset: 0 };
+    }
+    let curRow = new Array(needle.length + 1).fill(0);
+    let curStart = new Array(needle.length + 1).fill(0);
+    let prevRow = new Array(haystack.length + 1).fill(0);
+    let prevStart = new Array(haystack.length + 1).fill(0);
+    // Initialise the alignment of needle inside haystack
+    let c = needle[0];
+    for (let i = 0; i < haystack.length + 1; i++) {
+        if (i === 0) {
+            curRow[i] = 1;
+        }
+        else {
+            curRow[i] = compare(haystack[i - 1], c, i - 1, 0);
+        }
+        // We record the starting offset as 0 in two distinct cases:
+        //  - At least one char of needle is inserted left of haystack
+        //  - 0th char of needle = or subst. 0'th char of haystack
+        curStart[i] = i > 0 ? i - 1 : 0;
+    }
+    // Iterate over the rest of needle
+    for (let j = 1; j < needle.length; j++) {
+        // Set curRow to prevRow, and reuse the prevRow allocation for this
+        // iteration (its contents will be entirely overwritten).
+        let swap = prevRow;
+        prevRow = curRow;
+        curRow = swap;
+        swap = prevStart;
+        prevStart = curStart;
+        curStart = swap;
+        c = needle[j];
+        curRow[0] = j + 1; // All chars of needle inserted before haystack.
+        // Note: curStart[0] = 0 is invariant
+        for (let i = 1; i < haystack.length + 1; i++) {
+            // What happens to the j'th char of needle
+            const inserted = 1 + prevRow[i]; // inserted after i'th char of haystack
+            const deleted = 1 + curRow[i - 1]; // deleted after i'th char of haystack
+            const substituted = compare(haystack[i - 1], c, i - 1, j) + prevRow[i - 1]; // substituted w. i'th char of haystack
+            curRow[i] = Math.min(deleted, inserted, substituted);
+            if (curRow[i] === substituted) {
+                curStart[i] = prevStart[i - 1];
+            }
+            else if (curRow[i] === inserted) {
+                curStart[i] = prevStart[i];
+            }
+            else {
+                curStart[i] = curStart[i - 1];
+            }
+        }
+    }
+    // Find the best matching end-offset
+    let best = 0;
+    for (let i = 0; i < haystack.length + 1; i++) {
+        if (curRow[i] < curRow[best]) {
+            best = i;
+        }
+    }
+    return { distance: curRow[best], startOffset: curStart[best], endOffset: best };
+}
+function emptyLexDictionary() {
+    return new Map();
+}
+function reverseLexDictionary(d) {
+    const lookup = new Array(d.size);
+    for (const [lexeme, idx] of d) {
+        lookup[idx] = lexeme;
+    }
+    return lookup;
+}
+/**
+ * A simple lex generator.
+ * A lexeme is one of the following three:
+ *  1. A sequence of letters, numbers, _ and -
+ *  2. A sequence of spaces
+ *  3. Any other single Unicode code point
+ */
+function* lexGeneratorWords(s) {
+    let buffer = '';
+    let State;
+    (function (State) {
+        State[State["Word"] = 0] = "Word";
+        State[State["Space"] = 1] = "Space";
+        State[State["Other"] = 2] = "Other";
+    })(State || (State = {}));
+    let state = State.Word;
+    for (const c of s) {
+        let newState;
+        if (/(\p{L}|\p{Nd}|_)/u.test(c)) {
+            newState = State.Word;
+        }
+        else if (c === ' ') {
+            newState = State.Space;
+        }
+        else {
+            newState = State.Other;
+        }
+        if (newState === state && newState !== State.Other) {
+            buffer += c;
+        }
+        else {
+            if (buffer.length > 0) {
+                yield buffer;
+            }
+            buffer = c;
+            state = newState;
+        }
+    }
+    if (buffer.length > 0) {
+        yield buffer;
+    }
+}
+/**
+ * Convert a string into an array of lexeme ids, as defined by a lexeme dictionary.
+ *
+ * Lexemes not already in the dictionary will be added with a fresh key. Hence,
+ * this function can be called with an `emptyLexDictionary()`.
+ *
+ * @param s The string to convert
+ * @param lexDictionary The dictionary to begin with
+ * @param lexGenerator The generator to use to convert `s` into a stream of
+ * substring lexemes
+ * @param lexFilter Keep only lexemes satisfying this conditional
+ *
+ * @returns Pair containing:
+ *   - an array of (lexeme ids, lexeme starting offset within `s`),
+ *   - the updated dictionary.
+ */
+function lexicalAnalyzer(s, d, lexGenerator, lexFilter) {
+    const lexed = [];
+    let offset = 0;
+    for (const lexeme of lexGenerator(s)) {
+        if (lexFilter(lexeme)) {
+            if (!d.has(lexeme)) {
+                d.set(lexeme, d.size);
+            }
+            lexed.push([d.get(lexeme), offset]);
+        }
+        offset += lexeme.length;
+    }
+    return [lexed, d];
+}
+function notSingleSpace(s) {
+    return s !== ' ';
+}
+/**
+ * Computes the best alignment, under edit-distance, of placing the lexemes of
+ * `needle` within those of `haystack`.
+ *
+ * More precisely, we compute the lex tokens of `needle` and `haystack` under
+ * the same dictionary, and then align these by their edit distance using
+ * `editDistance`. We then translate the offsets in the lex-match-alignment back
+ * to character offsets.
+ *
+ * @param haystack The big string within which the needle should match
+ * @param needle The small string to match
+ * @param lexGenerator Generator which chops up a string into lexemes
+ * @param lexFilter Keep only lexemes that return true on this function
+ *
+ * @returns An alignment of the best match possible, with offsets within
+ * `haystack`.
+ */
+function lexEditDistance(haystack, needle, lexGenerator = lexGeneratorWords) {
+    const [haystackLexed, d] = lexicalAnalyzer(haystack, emptyLexDictionary(), lexGenerator, notSingleSpace);
+    const [needleLexed, dBoth] = lexicalAnalyzer(needle, d, lexGenerator, notSingleSpace);
+    // Special case for empty haystack or needle (or either consisting of single space)
+    if (needleLexed.length === 0 || haystackLexed.length === 0) {
+        return {
+            lexDistance: needleLexed.length,
+            startOffset: 0,
+            endOffset: 0,
+            haystackLexLength: haystackLexed.length,
+            needleLexLength: needleLexed.length,
+        };
+    }
+    // Align the lexed strings
+    // Take special care to not add cost if first lexeme of needle is postfix of
+    // lexeme in haystack, or last lexeme of needle is prefix of lexeme in
+    // haystack
+    const lookupId = reverseLexDictionary(dBoth);
+    const needleLexedLength = needleLexed.length;
+    const needleFirst = lookupId[needleLexed[0][0]];
+    const needleLast = lookupId[needleLexed[needleLexedLength - 1][0]];
+    function compare(hLexId, nLexId, hIndex, nIndex) {
+        if (nIndex === 0 || nIndex === needleLexedLength - 1) {
+            const haystackLexeme = lookupId[haystackLexed[hIndex][0]];
+            return (nIndex === 0 && haystackLexeme.endsWith(needleFirst)) ||
+                (nIndex === needleLexedLength - 1 && haystackLexeme.startsWith(needleLast))
+                ? 0
+                : 1;
+        }
+        else {
+            return hLexId === nLexId ? 0 : 1;
+        }
+    }
+    const alignment = editDistance(haystackLexed.map(x => x[0]), needleLexed.map(x => x[0]), compare);
+    // Convert the lexeme offsets in alignment to character offsets
+    const startOffset = haystackLexed[alignment.startOffset][1];
+    let endOffset = alignment.endOffset < haystackLexed.length ? haystackLexed[alignment.endOffset][1] : haystack.length;
+    // Account for a possible filtered-out single-space lexeme at end of match
+    if (endOffset > 0 && haystack[endOffset - 1] === ' ') {
+        --endOffset;
+    }
+    return {
+        lexDistance: alignment.distance,
+        startOffset,
+        endOffset,
+        haystackLexLength: haystackLexed.length,
+        needleLexLength: needleLexed.length,
+    };
+}
+//# sourceMappingURL=editDistance.js.map

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/editDistance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"editDistance.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/editDistance.ts"],"names":[],"mappings":";;AAkCA,oCA6DC;AAQD,gDAEC;AAED,oDAMC;AASD,8CAsBC;AAkBD,0CAgBC;AA+BD,0CAuDC;AA9PD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,SAAgB,YAAY,CAC3B,QAAW,EACX,MAAS,EACT,UAKc,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IAAC,CAAC;IACvH,IAAI,MAAM,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1D,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,IAAI,OAAO,GAAG,IAAI,KAAK,CAAS,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,SAAS,GAAG,IAAI,KAAK,CAAS,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/D,qDAAqD;IACrD,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC;aAC1B,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,CAAC;QAC3D,4DAA4D;QAC5D,8DAA8D;QAC9D,0DAA0D;QAC1D,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,kCAAkC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,mEAAmE;QACnE,yDAAyD;QACzD,IAAI,IAAI,GAAG,OAAO,CAAC;QACnB,OAAO,GAAG,MAAM,CAAC;QACjB,MAAM,GAAG,IAAI,CAAC;QACd,IAAI,GAAG,SAAS,CAAC;QACjB,SAAS,GAAG,QAAQ,CAAC;QACrB,QAAQ,GAAG,IAAI,CAAC;QAEhB,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,gDAAgD;QACnE,qCAAqC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,0CAA0C;YAC1C,MAAM,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,uCAAuC;YACxE,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,sCAAsC;YACzE,MAAM,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,uCAAuC;YACnH,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;YACrD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,WAAW,EAAE,CAAC;gBAC/B,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,CAAC;iBAAM,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACnC,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACP,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,CAAC;QACF,CAAC;IACF,CAAC;IAED,oCAAoC;IACpC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAAC,IAAI,GAAG,CAAC,CAAC;QAAC,CAAC;IAC5C,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AACjF,CAAC;AAQD,SAAgB,kBAAkB;IACjC,OAAO,IAAI,GAAG,EAAE,CAAC;AAClB,CAAC;AAED,SAAgB,oBAAoB,CAAC,CAAgB;IACpD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,KAAK,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IACtB,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,QAAe,CAAC,CAAC,iBAAiB,CAAC,CAAS;IAC3C,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAK,KAIJ;IAJD,WAAK,KAAK;QACT,iCAAI,CAAA;QACJ,mCAAK,CAAA;QACL,mCAAK,CAAA;IACN,CAAC,EAJI,KAAK,KAAL,KAAK,QAIT;IACD,IAAI,KAAK,GAAU,KAAK,CAAC,IAAI,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,QAAe,CAAC;QACpB,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAAC,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC;QAAC,CAAC;aACtD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;QAAC,CAAC;aAC1C,CAAC;YAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;QAAC,CAAC;QAChC,IAAI,QAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,KAAK,CAAC,KAAK,EAAE,CAAC;YACpD,MAAM,IAAI,CAAC,CAAC;QACb,CAAC;aAAM,CAAC;YACP,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAAC,MAAM,MAAM,CAAC;YAAC,CAAC;YACxC,MAAM,GAAG,CAAC,CAAC;YACX,KAAK,GAAG,QAAQ,CAAC;QAClB,CAAC;IACF,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAAC,MAAM,MAAM,CAAC;IAAC,CAAC;AACzC,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,eAAe,CAC9B,CAAS,EACT,CAAgB,EAChB,YAA0B,EAC1B,SAAsC;IAEtC,MAAM,KAAK,GAAG,EAAwB,CAAC;IACvC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACtC,IAAI,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAAC,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YAAC,CAAC;YAC9C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,MAAM,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACnB,CAAC;AAED,SAAS,cAAc,CAAC,CAAS;IAChC,OAAO,CAAC,KAAK,GAAG,CAAC;AAClB,CAAC;AAUD;;;;;;;;;;;;;;;;GAgBG;AACH,SAAgB,eAAe,CAC9B,QAAgB,EAChB,MAAc,EACd,eAA6B,iBAAiB;IAE9C,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC,GAAG,eAAe,CAAC,QAAQ,EAAE,kBAAkB,EAAE,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;IACzG,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;IACtF,mFAAmF;IACnF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5D,OAAO;YACN,WAAW,EAAE,WAAW,CAAC,MAAM;YAC/B,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;YACZ,iBAAiB,EAAE,aAAa,CAAC,MAAM;YACvC,eAAe,EAAE,WAAW,CAAC,MAAM;SACnC,CAAC;IACH,CAAC;IACD,0BAA0B;IAC1B,4EAA4E;IAC5E,sEAAsE;IACtE,WAAW;IACX,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,iBAAiB,GAAG,WAAW,CAAC,MAAM,CAAC;IAC7C,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,QAAQ,CAAC,WAAW,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,SAAS,OAAO,CAAC,MAAc,EAAE,MAAc,EAAE,MAAc,EAAE,MAAc;QAC9E,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,iBAAiB,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,cAAc,GAAG,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,cAAc,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;gBAC5D,CAAC,MAAM,KAAK,iBAAiB,GAAG,CAAC,IAAI,cAAc,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBAC3E,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,CAAC,CAAC;QACN,CAAC;aAAM,CAAC;YACP,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;IACF,CAAC;IACD,MAAM,SAAS,GAAG,YAAY,CAC7B,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC5B,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC1B,OAAO,CACP,CAAC;IACF,+DAA+D;IAC/D,MAAM,WAAW,GAAG,aAAa,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,IAAI,SAAS,GACZ,SAAS,CAAC,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;IACtG,0EAA0E;IAC1E,IAAI,SAAS,GAAG,CAAC,IAAI,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QAAC,EAAE,SAAS,CAAC;IAAC,CAAC;IAEtE,OAAO;QACN,WAAW,EAAE,SAAS,CAAC,QAAQ;QAC/B,WAAW;QACX,SAAS;QACT,iBAAiB,EAAE,aAAa,CAAC,MAAM;QACvC,eAAe,EAAE,WAAW,CAAC,MAAM;KACnC,CAAC;AACH,CAAC"}

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/partialSuggestions.d.ts

@@ -0,0 +1,17 @@
+export declare enum PartialAcceptTriggerKind {
+    Unknown = 0,
+    Word = 1,
+    Line = 2,
+    Suggest = 3
+}
+type CompletionType = 'partial' | 'full';
+export type SuggestionStatus = {
+    compType: CompletionType;
+    acceptedLength: number;
+    acceptedLines: number;
+};
+export declare function computeCompCharLen(suggestionStatus: SuggestionStatus, completionText: string): number;
+export declare function countLines(text: string): number;
+export declare function computeCompletionText(completionText: string, suggestionStatus: SuggestionStatus): string;
+export {};
+//# sourceMappingURL=partialSuggestions.d.ts.map

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/partialSuggestions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"partialSuggestions.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/partialSuggestions.ts"],"names":[],"mappings":"AAMA,oBAAY,wBAAwB;IACnC,OAAO,IAAI;IACX,IAAI,IAAI;IACR,IAAI,IAAI;IACR,OAAO,IAAI;CACX;AAED,KAAK,cAAc,GAAG,SAAS,GAAG,MAAM,CAAC;AAEzC,MAAM,MAAM,gBAAgB,GAAG;IAC9B,QAAQ,EAAE,cAAc,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;CACtB,CAAC;AAEF,wBAAgB,kBAAkB,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM,CAErG;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAI/C;AAED,wBAAgB,qBAAqB,CAAC,cAAc,EAAE,MAAM,EAAE,gBAAgB,EAAE,gBAAgB,GAAG,MAAM,CAKxG"}

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/partialSuggestions.js

@@ -0,0 +1,35 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PartialAcceptTriggerKind = void 0;
+exports.computeCompCharLen = computeCompCharLen;
+exports.countLines = countLines;
+exports.computeCompletionText = computeCompletionText;
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+// Copy of https://github.com/microsoft/vscode/blob/969b5714b4fc54992801dceefc3269ce4e07f8f7/src/vscode-dts/vscode.proposed.inlineCompletionsAdditions.d.ts#L75
+// to avoid dependencies to vscode from lib
+var PartialAcceptTriggerKind;
+(function (PartialAcceptTriggerKind) {
+    PartialAcceptTriggerKind[PartialAcceptTriggerKind["Unknown"] = 0] = "Unknown";
+    PartialAcceptTriggerKind[PartialAcceptTriggerKind["Word"] = 1] = "Word";
+    PartialAcceptTriggerKind[PartialAcceptTriggerKind["Line"] = 2] = "Line";
+    PartialAcceptTriggerKind[PartialAcceptTriggerKind["Suggest"] = 3] = "Suggest";
+})(PartialAcceptTriggerKind || (exports.PartialAcceptTriggerKind = PartialAcceptTriggerKind = {}));
+function computeCompCharLen(suggestionStatus, completionText) {
+    return suggestionStatus.compType === 'partial' ? suggestionStatus.acceptedLength : completionText.length;
+}
+function countLines(text) {
+    if (text.length === 0) {
+        return 0;
+    }
+    return text.split('\n').length;
+}
+function computeCompletionText(completionText, suggestionStatus) {
+    if (suggestionStatus.compType === 'partial') {
+        return completionText.substring(0, suggestionStatus.acceptedLength);
+    }
+    return completionText;
+}
+//# sourceMappingURL=partialSuggestions.js.map

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/partialSuggestions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partialSuggestions.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/partialSuggestions.ts"],"names":[],"mappings":";;;AAqBA,gDAEC;AAED,gCAIC;AAED,sDAKC;AApCD;;;gGAGgG;AAChG,+JAA+J;AAC/J,2CAA2C;AAC3C,IAAY,wBAKX;AALD,WAAY,wBAAwB;IACnC,6EAAW,CAAA;IACX,uEAAQ,CAAA;IACR,uEAAQ,CAAA;IACR,6EAAW,CAAA;AACZ,CAAC,EALW,wBAAwB,wCAAxB,wBAAwB,QAKnC;AAUD,SAAgB,kBAAkB,CAAC,gBAAkC,EAAE,cAAsB;IAC5F,OAAO,gBAAgB,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC;AAC1G,CAAC;AAED,SAAgB,UAAU,CAAC,IAAY;IACtC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAAC,OAAO,CAAC,CAAC;IAAC,CAAC;IAEpC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;AAChC,CAAC;AAED,SAAgB,qBAAqB,CAAC,cAAsB,EAAE,gBAAkC;IAC/F,IAAI,gBAAgB,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC7C,OAAO,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,gBAAgB,CAAC,cAAc,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,cAAc,CAAC;AACvB,CAAC"}

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/suggestions.d.ts

@@ -0,0 +1,15 @@
+import { ServicesAccessor } from '../../../../../../util/vs/platform/instantiation/common/instantiation';
+import { Logger } from '../logger';
+import { APIChoice } from '../openai/openai';
+import { IPosition, TextDocumentContents } from '../textDocument';
+export interface ILines {
+    getLineText(lineIdx: number): string;
+    getLineCount(): number;
+}
+export declare function maybeSnipCompletionImpl(doc: ILines, position: IPosition, completion: string, blockCloseToken: string): string;
+/**
+ * Post-processed a completion choice in the context of the document where the choice is offered.
+ */
+export declare function postProcessChoiceInContext(accessor: ServicesAccessor, document: TextDocumentContents, position: IPosition, choice: APIChoice, isMoreMultiline: boolean, logger: Logger): APIChoice | undefined;
+export declare function checkSuffix(document: TextDocumentContents, position: IPosition, choice: APIChoice): number;
+//# sourceMappingURL=suggestions.d.ts.map

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/suggestions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggestions.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/suggestions.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,gBAAgB,EAAE,MAAM,uEAAuE,CAAC;AAEzG,OAAO,EAAgC,MAAM,EAAE,MAAM,WAAW,CAAC;AACjE,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAE7C,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AA+BlE,MAAM,WAAW,MAAM;IACtB,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC;IACrC,YAAY,IAAI,MAAM,CAAC;CACvB;AAED,wBAAgB,uBAAuB,CACtC,GAAG,EAAE,MAAM,EACX,QAAQ,EAAE,SAAS,EACnB,UAAU,EAAE,MAAM,EAClB,eAAe,EAAE,MAAM,GACrB,MAAM,CA2ER;AAgCD;;GAEG;AACH,wBAAgB,0BAA0B,CACzC,QAAQ,EAAE,gBAAgB,EAC1B,QAAQ,EAAE,oBAAoB,EAC9B,QAAQ,EAAE,SAAS,EACnB,MAAM,EAAE,SAAS,EACjB,eAAe,EAAE,OAAO,EACxB,MAAM,EAAE,MAAM,GACZ,SAAS,GAAG,SAAS,CAuCvB;AAED,wBAAgB,WAAW,CAAC,QAAQ,EAAE,oBAAoB,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG,MAAM,CAwB1G"}

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/suggestions.js

@@ -0,0 +1,180 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+// General utility functions for all kinds of suggestions (Ghost Text, Open Copilot)
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.maybeSnipCompletionImpl = maybeSnipCompletionImpl;
+exports.postProcessChoiceInContext = postProcessChoiceInContext;
+exports.checkSuffix = checkSuffix;
+const parse_1 = require("../../../prompt/src/parse");
+const logger_1 = require("../logger");
+const telemetry_1 = require("../telemetry");
+const anomalyDetection_1 = require("./anomalyDetection");
+/**
+ * To avoid double-closing blocks (#272), maybe snip a trailing block-close token
+ * from the given completion.
+ *
+ * We check whether the completion ends with a block-close token, and the next line
+ * after the cursor starts with that same token at the same indentation. If so,
+ * we snip.
+ */
+function maybeSnipCompletion(accessor, doc, position, completion) {
+    // Default to `}` for block closing token
+    let blockCloseToken = '}';
+    //TODO: This should be properly handled in promptlib (in `getBlockCloseToken`)
+    //but we don't want to change it before Universe.
+    try {
+        blockCloseToken = (0, parse_1.getBlockCloseToken)(doc.detectedLanguageId) ?? '}';
+    }
+    catch (e) {
+        // Ignore errors
+    }
+    return maybeSnipCompletionImpl({ getLineText: lineIdx => doc.lineAt(lineIdx).text, getLineCount: () => doc.lineCount }, position, completion, blockCloseToken);
+}
+function maybeSnipCompletionImpl(doc, position, completion, blockCloseToken) {
+    // if the last lines of the completion are just indented block close tokens (e.g. `\t}\n}`),
+    // and if these lines exactly match the lines of the document after the insertion position (ignoring empty lines in both the document and the completion),
+    // these lines are removed from the completion.
+    // Additionally, the last line of the completion can be a prefix of a line in the model.
+    // Thus, if `\tif (true) {\n\t}` is suggested and the next line of the doc is `\t} else {`, only `if (true) {` will be suggested.
+    const completionLinesInfo = splitByNewLine(completion);
+    const completionLines = completionLinesInfo.lines;
+    if (completionLines.length === 1) {
+        return completion;
+    }
+    for (let completionLineStartIdx = 1; completionLineStartIdx < completionLines.length; completionLineStartIdx++) {
+        let matched = true;
+        let docSkippedEmptyLineCount = 0;
+        let completionSkippedEmptyLineCount = 0;
+        for (let offset = 0; offset + completionLineStartIdx + completionSkippedEmptyLineCount < completionLines.length; offset++) {
+            let docLine;
+            while (true) {
+                const docLineIdx = position.line + 1 + offset + docSkippedEmptyLineCount;
+                docLine = docLineIdx >= doc.getLineCount() ? undefined : doc.getLineText(docLineIdx);
+                if (docLine !== undefined && docLine.trim() === '') {
+                    // Skip empty lines in the document and loop
+                    docSkippedEmptyLineCount++;
+                }
+                else {
+                    break;
+                }
+            }
+            let completionLineIdx;
+            let completionLine;
+            while (true) {
+                completionLineIdx = completionLineStartIdx + offset + completionSkippedEmptyLineCount;
+                completionLine =
+                    completionLineIdx >= completionLines.length ? undefined : completionLines[completionLineIdx];
+                if (completionLine !== undefined && completionLine.trim() === '') {
+                    // Skip empty lines in the completion and loop
+                    completionSkippedEmptyLineCount++;
+                }
+                else {
+                    break;
+                }
+            }
+            const isLastCompletionLine = completionLineIdx === completionLines.length - 1;
+            if (!completionLine ||
+                !(docLine &&
+                    (isLastCompletionLine
+                        ? // For the last line, accept any line that starts with the completion line and vice versa.
+                            // This allows for brackets, braces, parentheses, quotes, identifiers like "end" and "fi",
+                            // heredocs, etc.
+                            docLine.startsWith(completionLine) || completionLine.startsWith(docLine)
+                        : // For other lines, strictly require the block close token, and nothing else
+                            docLine === completionLine && completionLine.trim() === blockCloseToken))) {
+                matched = false;
+                break;
+            }
+        }
+        if (matched) {
+            const completionWithoutClosingBracketLines = completionLines
+                .slice(0, completionLineStartIdx)
+                .join(completionLinesInfo.newLineCharacter);
+            return completionWithoutClosingBracketLines;
+        }
+    }
+    return completion;
+}
+function splitByNewLine(text) {
+    const newLineCharacter = text.includes('\r\n') ? '\r\n' : '\n';
+    return {
+        lines: text.split(newLineCharacter),
+        newLineCharacter,
+    };
+}
+function matchesNextLine(document, position, text, shouldTrim) {
+    let nextLine = '';
+    let lineNo = position.line + 1;
+    const compareText = shouldTrim ? text.trim() : text;
+    while (nextLine === '' && lineNo < document.lineCount) {
+        nextLine = document.lineAt(lineNo).text;
+        if (shouldTrim) {
+            nextLine = nextLine.trim();
+        }
+        if (nextLine === compareText) {
+            return true;
+        }
+        lineNo++;
+    }
+    return false;
+}
+/**
+ * Post-processed a completion choice in the context of the document where the choice is offered.
+ */
+function postProcessChoiceInContext(accessor, document, position, choice, isMoreMultiline, logger) {
+    const logTarget = accessor.get(logger_1.ICompletionsLogTargetService);
+    if ((0, anomalyDetection_1.isRepetitive)(choice.tokens)) {
+        const telemetryData = telemetry_1.TelemetryData.createAndMarkAsIssued();
+        telemetryData.extendWithRequestId(choice.requestId);
+        (0, telemetry_1.telemetry)(accessor, 'repetition.detected', telemetryData, telemetry_1.TelemetryStore.Enhanced);
+        // FIXME: trim request at start of repetitive block? for now we just skip
+        logger.info(logTarget, 'Filtered out repetitive solution');
+        return undefined;
+    }
+    const postProcessedChoice = { ...choice };
+    // Avoid single-line completions that duplicate the next line (#993)
+    if (matchesNextLine(document, position, postProcessedChoice.completionText, !isMoreMultiline)) {
+        const baseTelemetryData = telemetry_1.TelemetryData.createAndMarkAsIssued();
+        baseTelemetryData.extendWithRequestId(choice.requestId);
+        (0, telemetry_1.telemetry)(accessor, 'completion.alreadyInDocument', baseTelemetryData);
+        (0, telemetry_1.telemetry)(accessor, 'completion.alreadyInDocument', baseTelemetryData.extendedBy({
+            completionTextJson: JSON.stringify(postProcessedChoice.completionText),
+        }), telemetry_1.TelemetryStore.Enhanced);
+        logger.info(logTarget, 'Filtered out solution matching next line');
+        return undefined;
+    }
+    // Avoid double-closing blocks (#272)
+    postProcessedChoice.completionText = maybeSnipCompletion(accessor, document, position, postProcessedChoice.completionText);
+    return postProcessedChoice.completionText ? postProcessedChoice : undefined;
+}
+function checkSuffix(document, position, choice) {
+    const currentLine = document.lineAt(position.line);
+    const restOfLine = currentLine.text.substring(position.character);
+    if (restOfLine.length > 0) {
+        if (choice.completionText.indexOf(restOfLine) !== -1) {
+            //If current suggestion contains rest of the line as substring
+            //then we will include it in our suggestion range
+            return restOfLine.length;
+        }
+        else {
+            let lastIndex = -1;
+            let suffixLength = 0;
+            for (const c of restOfLine) {
+                const idx = choice.completionText.indexOf(c, lastIndex + 1);
+                if (idx > lastIndex) {
+                    suffixLength++;
+                    lastIndex = idx;
+                }
+                else {
+                    break;
+                }
+            }
+            return suffixLength;
+        }
+    }
+    return 0;
+}
+//# sourceMappingURL=suggestions.js.map

package/dist/src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/suggestions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"suggestions.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/suggestions/suggestions.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAChG,oFAAoF;;AA2CpF,0DAgFC;AAmCD,gEA8CC;AAED,kCAwBC;AAnOD,qDAA+D;AAC/D,sCAAiE;AAEjE,4CAAwE;AAExE,yDAAkD;AAElD;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAAC,QAA0B,EAAE,GAAyB,EAAE,QAAmB,EAAE,UAAkB;IAC1H,yCAAyC;IACzC,IAAI,eAAe,GAAG,GAAG,CAAC;IAE1B,8EAA8E;IAC9E,iDAAiD;IACjD,IAAI,CAAC;QACJ,eAAe,GAAG,IAAA,0BAAkB,EAAC,GAAG,CAAC,kBAAkB,CAAC,IAAI,GAAG,CAAC;IACrE,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACZ,gBAAgB;IACjB,CAAC;IAED,OAAO,uBAAuB,CAC7B,EAAE,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,SAAS,EAAE,EACvF,QAAQ,EACR,UAAU,EACV,eAAe,CACf,CAAC;AACH,CAAC;AAOD,SAAgB,uBAAuB,CACtC,GAAW,EACX,QAAmB,EACnB,UAAkB,EAClB,eAAuB;IAEvB,4FAA4F;IAC5F,0JAA0J;IAC1J,+CAA+C;IAC/C,wFAAwF;IACxF,iIAAiI;IAEjI,MAAM,mBAAmB,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;IACvD,MAAM,eAAe,GAAG,mBAAmB,CAAC,KAAK,CAAC;IAClD,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,UAAU,CAAC;IACnB,CAAC;IAED,KAAK,IAAI,sBAAsB,GAAG,CAAC,EAAE,sBAAsB,GAAG,eAAe,CAAC,MAAM,EAAE,sBAAsB,EAAE,EAAE,CAAC;QAChH,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,wBAAwB,GAAG,CAAC,CAAC;QACjC,IAAI,+BAA+B,GAAG,CAAC,CAAC;QACxC,KACC,IAAI,MAAM,GAAG,CAAC,EACd,MAAM,GAAG,sBAAsB,GAAG,+BAA+B,GAAG,eAAe,CAAC,MAAM,EAC1F,MAAM,EAAE,EACP,CAAC;YACF,IAAI,OAA2B,CAAC;YAChC,OAAO,IAAI,EAAE,CAAC;gBACb,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,GAAG,CAAC,GAAG,MAAM,GAAG,wBAAwB,CAAC;gBACzE,OAAO,GAAG,UAAU,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBACrF,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;oBACpD,4CAA4C;oBAC5C,wBAAwB,EAAE,CAAC;gBAC5B,CAAC;qBAAM,CAAC;oBACP,MAAM;gBACP,CAAC;YACF,CAAC;YAED,IAAI,iBAAqC,CAAC;YAC1C,IAAI,cAAkC,CAAC;YACvC,OAAO,IAAI,EAAE,CAAC;gBACb,iBAAiB,GAAG,sBAAsB,GAAG,MAAM,GAAG,+BAA+B,CAAC;gBACtF,cAAc;oBACb,iBAAiB,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,iBAAiB,CAAC,CAAC;gBAC9F,IAAI,cAAc,KAAK,SAAS,IAAI,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;oBAClE,8CAA8C;oBAC9C,+BAA+B,EAAE,CAAC;gBACnC,CAAC;qBAAM,CAAC;oBACP,MAAM;gBACP,CAAC;YACF,CAAC;YAED,MAAM,oBAAoB,GAAG,iBAAiB,KAAK,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9E,IACC,CAAC,cAAc;gBACf,CAAC,CACA,OAAO;oBACP,CAAC,oBAAoB;wBACpB,CAAC,CAAC,0FAA0F;4BAC5F,0FAA0F;4BAC1F,iBAAiB;4BACjB,OAAO,CAAC,UAAU,CAAC,cAAc,CAAC,IAAI,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC;wBACxE,CAAC,CAAC,4EAA4E;4BAC9E,OAAO,KAAK,cAAc,IAAI,cAAc,CAAC,IAAI,EAAE,KAAK,eAAe,CAAC,CACzE,EACA,CAAC;gBACF,OAAO,GAAG,KAAK,CAAC;gBAChB,MAAM;YACP,CAAC;QACF,CAAC;QACD,IAAI,OAAO,EAAE,CAAC;YACb,MAAM,oCAAoC,GAAG,eAAe;iBAC1D,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC;iBAChC,IAAI,CAAC,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;YAC7C,OAAO,oCAAoC,CAAC;QAC7C,CAAC;IACF,CAAC;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,SAAS,cAAc,CAAC,IAAY;IACnC,MAAM,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,OAAO;QACN,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC;QACnC,gBAAgB;KAChB,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CACvB,QAA8B,EAC9B,QAAmB,EACnB,IAAY,EACZ,UAAmB;IAEnB,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,MAAM,GAAW,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;IACvC,MAAM,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACpD,OAAO,QAAQ,KAAK,EAAE,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QACvD,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;QACxC,IAAI,UAAU,EAAE,CAAC;YAChB,QAAQ,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC5B,CAAC;QACD,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC;QACb,CAAC;QACD,MAAM,EAAE,CAAC;IACV,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,0BAA0B,CACzC,QAA0B,EAC1B,QAA8B,EAC9B,QAAmB,EACnB,MAAiB,EACjB,eAAwB,EACxB,MAAc;IAEd,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,qCAA4B,CAAC,CAAC;IAC7D,IAAI,IAAA,+BAAY,EAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACjC,MAAM,aAAa,GAAG,yBAAa,CAAC,qBAAqB,EAAE,CAAC;QAC5D,aAAa,CAAC,mBAAmB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACpD,IAAA,qBAAS,EAAC,QAAQ,EAAE,qBAAqB,EAAE,aAAa,EAAE,0BAAc,CAAC,QAAQ,CAAC,CAAC;QACnF,yEAAyE;QACzE,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,kCAAkC,CAAC,CAAC;QAC3D,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,MAAM,mBAAmB,GAAG,EAAE,GAAG,MAAM,EAAE,CAAC;IAE1C,oEAAoE;IACpE,IAAI,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,mBAAmB,CAAC,cAAc,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC;QAC/F,MAAM,iBAAiB,GAAG,yBAAa,CAAC,qBAAqB,EAAE,CAAC;QAChE,iBAAiB,CAAC,mBAAmB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACxD,IAAA,qBAAS,EAAC,QAAQ,EAAE,8BAA8B,EAAE,iBAAiB,CAAC,CAAC;QACvE,IAAA,qBAAS,EACR,QAAQ,EACR,8BAA8B,EAC9B,iBAAiB,CAAC,UAAU,CAAC;YAC5B,kBAAkB,EAAE,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC,cAAc,CAAC;SACtE,CAAC,EACF,0BAAc,CAAC,QAAQ,CACvB,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,0CAA0C,CAAC,CAAC;QACnE,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,qCAAqC;IACrC,mBAAmB,CAAC,cAAc,GAAG,mBAAmB,CACvD,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,mBAAmB,CAAC,cAAc,CAClC,CAAC;IAEF,OAAO,mBAAmB,CAAC,cAAc,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC;AAC7E,CAAC;AAED,SAAgB,WAAW,CAAC,QAA8B,EAAE,QAAmB,EAAE,MAAiB;IACjG,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACtD,8DAA8D;YAC9D,iDAAiD;YACjD,OAAO,UAAU,CAAC,MAAM,CAAC;QAC1B,CAAC;aAAM,CAAC;YACP,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;YACnB,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;gBAC5D,IAAI,GAAG,GAAG,SAAS,EAAE,CAAC;oBACrB,YAAY,EAAE,CAAC;oBACf,SAAS,GAAG,GAAG,CAAC;gBACjB,CAAC;qBAAM,CAAC;oBACP,MAAM;gBACP,CAAC;YACF,CAAC;YACD,OAAO,YAAY,CAAC;QACrB,CAAC;IACF,CAAC;IACD,OAAO,CAAC,CAAC;AACV,CAAC"}