@vscode/chat-lib 0.1.2-0 → 0.1.2

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

@@ -1 +0,0 @@
-{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/helpers/cache.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAGhG;;;GAGG;AACH,MAAa,WAAW;IAIvB,cAAc;IACd,YAAY,IAAI,GAAG,EAAE;QAJb,aAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;QAKlC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACvB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QACnB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,mCAAmC;YACnC,2DAA2D;YAC3D,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjD,8CAA8C;YAC9C,kCAAkC;YAClC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC;YAClD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,GAAM;QACT,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACrC,+CAA+C;YAC/C,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAM,CAAC,CAAC;YAC/B,OAAO,KAAM,CAAC;QACf,CAAC;QAED,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,MAAM,CAAC,GAAM;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,IAAI;QACH,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;IACtC,CAAC;IAED,MAAM;QACL,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC;IACxC,CAAC;IAED,OAAO;QACN,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;IACzC,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAED,GAAG,CAAC,GAAM;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,CAAC,UAAsD,EAAE,OAAiB;QAChF,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACrD,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACvB,OAAO,aAAa,CAAC;IACtB,CAAC;IAED,IAAI,CAAC,GAAM;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;CACD;AAxFD,kCAwFC"}

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

@@ -1,10 +0,0 @@
-export declare function asyncIterableMap<TSource, TDest>(source: AsyncIterable<TSource>, selector: (x: TSource) => Promise<TDest> | TDest): AsyncIterable<TDest>;
-export declare function asyncIterableFilter<TSource>(source: AsyncIterable<TSource>, predicate: (x: TSource) => Promise<boolean> | boolean): AsyncIterable<TSource>;
-export declare function asyncIterableMapFilter<TSource, TDest>(source: AsyncIterable<TSource>, selector: (x: TSource) => Promise<TDest | undefined> | TDest | undefined): AsyncIterable<TDest>;
-export declare function asyncIterableFromArray<TSource>(source: TSource[]): AsyncIterable<TSource, void, unknown>;
-export declare function asyncIterableToArray<TSource>(source: AsyncIterable<TSource>): Promise<TSource[]>;
-export declare function asyncIterableConcat<TSource>(...sources: AsyncIterable<TSource>[]): AsyncIterable<TSource>;
-export declare function asyncIterableCount<TSource>(source: AsyncIterable<TSource>): Promise<number>;
-export declare function iterableMap<TSource, TDest>(source: Iterable<TSource>, selector: (x: TSource) => TDest): Iterable<TDest>;
-export declare function iterableMapFilter<TSource, TDest>(source: Iterable<TSource>, selector: (x: TSource) => TDest | undefined): Iterable<TDest>;
-//# sourceMappingURL=iterableHelpers.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"iterableHelpers.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/helpers/iterableHelpers.ts"],"names":[],"mappings":"AAKA,wBAAuB,gBAAgB,CAAC,OAAO,EAAE,KAAK,EACrD,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,EAC9B,QAAQ,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAC9C,aAAa,CAAC,KAAK,CAAC,CAItB;AAED,wBAAuB,mBAAmB,CAAC,OAAO,EACjD,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,EAC9B,SAAS,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO,GACnD,aAAa,CAAC,OAAO,CAAC,CAMxB;AAED,wBAAuB,sBAAsB,CAAC,OAAO,EAAE,KAAK,EAC3D,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,EAC9B,QAAQ,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,OAAO,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,KAAK,GAAG,SAAS,GACtE,aAAa,CAAC,KAAK,CAAC,CAOtB;AAED,wBAAuB,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAI/G;AAED,wBAAsB,oBAAoB,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAMtG;AAED,wBAAuB,mBAAmB,CAAC,OAAO,EAAE,GAAG,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAIhH;AAED,wBAAsB,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAMjG;AAED,wBAAiB,WAAW,CAAC,OAAO,EAAE,KAAK,EAC1C,MAAM,EAAE,QAAQ,CAAC,OAAO,CAAC,EACzB,QAAQ,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,KAAK,GAC7B,QAAQ,CAAC,KAAK,CAAC,CAIjB;AAED,wBAAiB,iBAAiB,CAAC,OAAO,EAAE,KAAK,EAChD,MAAM,EAAE,QAAQ,CAAC,OAAO,CAAC,EACzB,QAAQ,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK,KAAK,GAAG,SAAS,GACzC,QAAQ,CAAC,KAAK,CAAC,CAOjB"}

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

@@ -1,73 +0,0 @@
-"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.asyncIterableMap = asyncIterableMap;
-exports.asyncIterableFilter = asyncIterableFilter;
-exports.asyncIterableMapFilter = asyncIterableMapFilter;
-exports.asyncIterableFromArray = asyncIterableFromArray;
-exports.asyncIterableToArray = asyncIterableToArray;
-exports.asyncIterableConcat = asyncIterableConcat;
-exports.asyncIterableCount = asyncIterableCount;
-exports.iterableMap = iterableMap;
-exports.iterableMapFilter = iterableMapFilter;
-async function* asyncIterableMap(source, selector) {
-    for await (const item of source) {
-        yield selector(item);
-    }
-}
-async function* asyncIterableFilter(source, predicate) {
-    for await (const item of source) {
-        if (await predicate(item)) {
-            yield item;
-        }
-    }
-}
-async function* asyncIterableMapFilter(source, selector) {
-    for await (const item of source) {
-        const result = await selector(item);
-        if (result !== undefined) {
-            yield result;
-        }
-    }
-}
-async function* asyncIterableFromArray(source) {
-    for (const item of source) {
-        yield Promise.resolve(item);
-    }
-}
-async function asyncIterableToArray(source) {
-    const result = [];
-    for await (const item of source) {
-        result.push(item);
-    }
-    return result;
-}
-async function* asyncIterableConcat(...sources) {
-    for (const source of sources) {
-        yield* source;
-    }
-}
-async function asyncIterableCount(source) {
-    let count = 0;
-    for await (const _ of source) {
-        count++;
-    }
-    return count;
-}
-function* iterableMap(source, selector) {
-    for (const item of source) {
-        yield selector(item);
-    }
-}
-function* iterableMapFilter(source, selector) {
-    for (const item of source) {
-        const result = selector(item);
-        if (result !== undefined) {
-            yield result;
-        }
-    }
-}
-//# sourceMappingURL=iterableHelpers.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"iterableHelpers.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/helpers/iterableHelpers.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAEhG,4CAOC;AAED,kDASC;AAED,wDAUC;AAED,wDAIC;AAED,oDAMC;AAED,kDAIC;AAED,gDAMC;AAED,kCAOC;AAED,8CAUC;AA/EM,KAAK,SAAS,CAAC,CAAC,gBAAgB,CACtC,MAA8B,EAC9B,QAAgD;IAEhD,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACjC,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;AACF,CAAC;AAEM,KAAK,SAAS,CAAC,CAAC,mBAAmB,CACzC,MAA8B,EAC9B,SAAqD;IAErD,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,MAAM,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC;QACZ,CAAC;IACF,CAAC;AACF,CAAC;AAEM,KAAK,SAAS,CAAC,CAAC,sBAAsB,CAC5C,MAA8B,EAC9B,QAAwE;IAExE,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,MAAM,CAAC;QACd,CAAC;IACF,CAAC;AACF,CAAC;AAEM,KAAK,SAAS,CAAC,CAAC,sBAAsB,CAAU,MAAiB;IACvE,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;AACF,CAAC;AAEM,KAAK,UAAU,oBAAoB,CAAU,MAA8B;IACjF,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAEM,KAAK,SAAS,CAAC,CAAC,mBAAmB,CAAU,GAAG,OAAiC;IACvF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC9B,KAAK,CAAC,CAAC,MAAM,CAAC;IACf,CAAC;AACF,CAAC;AAEM,KAAK,UAAU,kBAAkB,CAAU,MAA8B;IAC/E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QAC9B,KAAK,EAAE,CAAC;IACT,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,QAAe,CAAC,CAAC,WAAW,CAC3B,MAAyB,EACzB,QAA+B;IAE/B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;AACF,CAAC;AAED,QAAe,CAAC,CAAC,iBAAiB,CACjC,MAAyB,EACzB,QAA2C;IAE3C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,MAAM,CAAC;QACd,CAAC;IACF,CAAC;AACF,CAAC"}

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

@@ -1,59 +0,0 @@
-/** A data structure for efficiently finding all values that are indexed by a key
- * that is a prefix of a given key, using a radix trie representation.
- *
- * An overarching goal of the implementation is to minimize storing and handling
- * the full keys since in the case of completions, the keys are the full text of
- * the document before the cursor which can be large.
- */
-export declare class LRURadixTrie<T> {
-    private readonly maxSize;
-    /** Singular, empty root node for the the trie. */
-    private readonly root;
-    /** Set of all leaf nodes with values, tracked for evicting LRU values. */
-    private readonly leafNodes;
-    constructor(maxSize: number);
-    /**
-     * Traverses the trie to insert a new value. If an existing exact match is
-     * found the value is added to a list of values at that node. Otherwise a
-     * new node is created.
-     *
-     * As a side effect, the least recently used node is evicted if the max size
-     * is exceeded.
-     */
-    set(key: string, value: T): void;
-    /** Traverses the trie and returns all values whose keys are a prefix of the
-     * given key. Returns them in order of longest prefix first.
-     */
-    findAll(key: string): Array<{
-        remainingKey: string;
-        value: T;
-    }>;
-    /** Removes the value at a given key if any from the trie. */
-    delete(key: string): void;
-    /** Traverses the trie to find the node with the closest prefix to a given key. */
-    private findClosestNode;
-    /** Deletes a node from the trie and resolves relationships with surrounding nodes.
-     * - If the node has no children, remove it from its parent.
-     * - If the node has one child, replace it with its child in the parent,
-     *   concatenating the edges together.
-     * - If the node has multiple children, the node is left in place as an
-     *   intermediary node.
-     * - In all cases, the value at the node is removed and the node is removed
-     *   from the flatNodes set of leaf nodes.
-     */
-    private deleteNode;
-    /** Walks the trie to find and evict the least recently used node. This is
-     * intentionally optimized for read performance over write performance.
-     */
-    private evictLeastRecentlyUsed;
-    /** Iterate through the set of leaf nodes to find the least recently used.
-     *
-     * Note, this could be done more efficiently with a heap or even just
-     * keeping the list sorted. Currently, this is mirroring the LRUCacheMap
-     * implementation to optimize for read performance over write performance.
-     * Though this may be worth revisiting since both reading and writing are on
-     * the critical path for completions.
-     */
-    private findLeastRecentlyUsed;
-}
-//# sourceMappingURL=radix.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"radix.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/helpers/radix.ts"],"names":[],"mappings":"AAKA;;;;;;GAMG;AACH,qBAAa,YAAY,CAAC,CAAC;IAOd,OAAO,CAAC,QAAQ,CAAC,OAAO;IANpC,kDAAkD;IAClD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAyB;IAE9C,0EAA0E;IAC1E,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAmC;gBAEhC,OAAO,EAAE,MAAM;IAE5C;;;;;;;OAOG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAqChC;;OAEG;IACH,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,YAAY,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC;IAQ/D,6DAA6D;IAC7D,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAQzB,kFAAkF;IAClF,OAAO,CAAC,eAAe;IAmBvB;;;;;;;;OAQG;IACH,OAAO,CAAC,UAAU;IAgClB;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAK9B;;;;;;;OAOG;IACH,OAAO,CAAC,qBAAqB;CAS7B"}

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

@@ -1,228 +0,0 @@
-"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.LRURadixTrie = void 0;
-/** A data structure for efficiently finding all values that are indexed by a key
- * that is a prefix of a given key, using a radix trie representation.
- *
- * An overarching goal of the implementation is to minimize storing and handling
- * the full keys since in the case of completions, the keys are the full text of
- * the document before the cursor which can be large.
- */
-class LRURadixTrie {
-    constructor(maxSize) {
-        this.maxSize = maxSize;
-        /** Singular, empty root node for the the trie. */
-        this.root = new LRURadixNode();
-        /** Set of all leaf nodes with values, tracked for evicting LRU values. */
-        this.leafNodes = new Set();
-    }
-    /**
-     * Traverses the trie to insert a new value. If an existing exact match is
-     * found the value is added to a list of values at that node. Otherwise a
-     * new node is created.
-     *
-     * As a side effect, the least recently used node is evicted if the max size
-     * is exceeded.
-     */
-    set(key, value) {
-        let { node, remainingKey } = this.findClosestNode(key);
-        // If no exact match, add a new node under the closest node.
-        if (remainingKey.length > 0) {
-            // Check if there is a child node with an edge that is a prefix of
-            // the remaining key.
-            for (const [edge, child] of node.children) {
-                if (edge.startsWith(remainingKey)) {
-                    // Split the edge by adding a new intermediate node.
-                    const commonPrefix = edge.slice(0, remainingKey.length);
-                    const intermediate = new LRURadixNode();
-                    node.removeChild(edge);
-                    node.addChild(commonPrefix, intermediate);
-                    intermediate.addChild(edge.slice(commonPrefix.length), child);
-                    node = intermediate;
-                    remainingKey = remainingKey.slice(commonPrefix.length);
-                    break;
-                }
-            }
-            if (remainingKey.length > 0) {
-                // Add a new node with the remaining key.
-                const newNode = new LRURadixNode();
-                node.addChild(remainingKey, newNode);
-                node = newNode;
-            }
-        }
-        // Set value on the node
-        node.value = value;
-        // Ensure the node which may be new or newly with a value is in the
-        // leafNode set.
-        this.leafNodes.add(node);
-        // Evict least recently used node if max size is exceeded.
-        if (this.leafNodes.size > this.maxSize) {
-            this.evictLeastRecentlyUsed();
-        }
-    }
-    /** Traverses the trie and returns all values whose keys are a prefix of the
-     * given key. Returns them in order of longest prefix first.
-     */
-    findAll(key) {
-        return this.findClosestNode(key)
-            .stack.map(({ node, remainingKey }) => node.value !== undefined ? { remainingKey, value: node.value } : undefined)
-            .filter(x => x !== undefined);
-    }
-    /** Removes the value at a given key if any from the trie. */
-    delete(key) {
-        const { node, remainingKey } = this.findClosestNode(key);
-        // If no exact match is found, do nothing.
-        if (remainingKey.length > 0) {
-            return;
-        }
-        // Exact match found, remove the value.
-        this.deleteNode(node);
-    }
-    /** Traverses the trie to find the node with the closest prefix to a given key. */
-    findClosestNode(key) {
-        let hasNext = true;
-        let node = this.root;
-        const stack = [{ node, remainingKey: key }];
-        while (key.length > 0 && hasNext) {
-            hasNext = false;
-            for (const [edge, child] of node.children) {
-                if (key.startsWith(edge)) {
-                    key = key.slice(edge.length);
-                    stack.unshift({ node: child, remainingKey: key });
-                    node = child;
-                    hasNext = true;
-                    break;
-                }
-            }
-        }
-        return { node, remainingKey: key, stack };
-    }
-    /** Deletes a node from the trie and resolves relationships with surrounding nodes.
-     * - If the node has no children, remove it from its parent.
-     * - If the node has one child, replace it with its child in the parent,
-     *   concatenating the edges together.
-     * - If the node has multiple children, the node is left in place as an
-     *   intermediary node.
-     * - In all cases, the value at the node is removed and the node is removed
-     *   from the flatNodes set of leaf nodes.
-     */
-    deleteNode(node) {
-        node.value = undefined;
-        this.leafNodes.delete(node);
-        // If the node has no parent, it is the root. Done.
-        if (node.parent === undefined) {
-            return;
-        }
-        // If more than one child, keep the node as an intermediary node. Done.
-        if (node.childCount > 1) {
-            return;
-        }
-        const { node: parent, edge } = node.parent;
-        // If exactly one child, replace the node with the child in the parent.
-        if (node.childCount === 1) {
-            const [childEdge, childNode] = Array.from(node.children)[0];
-            node.removeChild(childEdge);
-            parent.removeChild(edge);
-            parent.addChild(edge + childEdge, childNode);
-            return;
-        }
-        // If the node has no children, remove it from the parent.
-        parent.removeChild(edge);
-        // If the parent node is the root, no further action is needed.
-        if (parent.parent === undefined) {
-            return;
-        }
-        const grandparent = parent.parent;
-        // If the parent node has only one child remaining and no value, merge
-        // the parent and remaining child together.
-        if (parent.value === undefined && parent.childCount === 1) {
-            const [childEdge, childNode] = Array.from(parent.children)[0];
-            const newEdge = grandparent.edge + childEdge;
-            parent.removeChild(childEdge);
-            grandparent.node.removeChild(grandparent.edge);
-            grandparent.node.addChild(newEdge, childNode);
-        }
-    }
-    /** Walks the trie to find and evict the least recently used node. This is
-     * intentionally optimized for read performance over write performance.
-     */
-    evictLeastRecentlyUsed() {
-        const node = this.findLeastRecentlyUsed();
-        if (node) {
-            this.deleteNode(node);
-        }
-    }
-    /** Iterate through the set of leaf nodes to find the least recently used.
-     *
-     * Note, this could be done more efficiently with a heap or even just
-     * keeping the list sorted. Currently, this is mirroring the LRUCacheMap
-     * implementation to optimize for read performance over write performance.
-     * Though this may be worth revisiting since both reading and writing are on
-     * the critical path for completions.
-     */
-    findLeastRecentlyUsed() {
-        let least;
-        for (const node of this.leafNodes) {
-            if (least === undefined || node.touched < least.touched) {
-                least = node;
-            }
-        }
-        return least;
-    }
-}
-exports.LRURadixTrie = LRURadixTrie;
-/** Internal node representation in a LRURadixTrie.
- * - Optionally has a value to represent a leaf node.
- * - Contains a list of child nodes, not mutually exclusive with having value.
- * - If not a root, has a parent edge for traversal up the trie.
- * - Maintains state on most recent access time for LRU eviction.
- */
-class LRURadixNode {
-    constructor() {
-        this._children = new Map();
-        this._touched = performance.now();
-    }
-    /** Iterator for the children of this node. */
-    get children() {
-        return this._children.entries();
-    }
-    /** The number of children of this node. */
-    get childCount() {
-        return this._children.size;
-    }
-    /** Adds a child node to this node and sets its parent reference. */
-    addChild(edge, child) {
-        this._children.set(edge, child);
-        child.parent = { node: this, edge };
-    }
-    /** Removes a child node from this node and clears its parent reference. */
-    removeChild(edge) {
-        const child = this._children.get(edge);
-        if (child) {
-            child.parent = undefined;
-        }
-        this._children.delete(edge);
-    }
-    /** Reads the value and updates the touched timestamp. */
-    get value() {
-        this.touch();
-        return this._value;
-    }
-    /** Sets value and updates the touched timestamp. */
-    set value(value) {
-        this.touch();
-        this._value = value;
-    }
-    /** The last time (ms from process start) this node's value was accessed. */
-    get touched() {
-        return this._touched;
-    }
-    touch() {
-        this._touched = performance.now();
-    }
-}
-//# sourceMappingURL=radix.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"radix.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/helpers/radix.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG;;;;;;GAMG;AACH,MAAa,YAAY;IAOxB,YAA6B,OAAe;QAAf,YAAO,GAAP,OAAO,CAAQ;QAN5C,kDAAkD;QACjC,SAAI,GAAG,IAAI,YAAY,EAAK,CAAC;QAE9C,0EAA0E;QACzD,cAAS,GAAyB,IAAI,GAAG,EAAE,CAAC;IAEb,CAAC;IAEjD;;;;;;;OAOG;IACH,GAAG,CAAC,GAAW,EAAE,KAAQ;QACxB,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACvD,4DAA4D;QAC5D,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,kEAAkE;YAClE,qBAAqB;YACrB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3C,IAAI,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;oBACnC,oDAAoD;oBACpD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;oBACxD,MAAM,YAAY,GAAG,IAAI,YAAY,EAAK,CAAC;oBAC3C,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;oBAC1C,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;oBAC9D,IAAI,GAAG,YAAY,CAAC;oBACpB,YAAY,GAAG,YAAY,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;oBACvD,MAAM;gBACP,CAAC;YACF,CAAC;YACD,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,yCAAyC;gBACzC,MAAM,OAAO,GAAG,IAAI,YAAY,EAAK,CAAC;gBACtC,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;gBACrC,IAAI,GAAG,OAAO,CAAC;YAChB,CAAC;QACF,CAAC;QACD,wBAAwB;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,mEAAmE;QACnE,gBAAgB;QAChB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,0DAA0D;QAC1D,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAC/B,CAAC;IACF,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,GAAW;QAClB,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;aAC9B,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,CACrC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAC1E;aACA,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IAChC,CAAC;IAED,6DAA6D;IAC7D,MAAM,CAAC,GAAW;QACjB,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACzD,0CAA0C;QAC1C,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAAC,OAAO;QAAC,CAAC;QACxC,uCAAuC;QACvC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAED,kFAAkF;IAC1E,eAAe,CAAC,GAAW;QAClC,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,IAAI,GAAoB,IAAI,CAAC,IAAI,CAAC;QACtC,MAAM,KAAK,GAAsD,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QAC/F,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3C,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1B,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC7B,KAAK,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;oBAClD,IAAI,GAAG,KAAK,CAAC;oBACb,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACP,CAAC;YACF,CAAC;QACF,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;IAC3C,CAAC;IAED;;;;;;;;OAQG;IACK,UAAU,CAAC,IAAqB;QACvC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5B,mDAAmD;QACnD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAAC,OAAO;QAAC,CAAC;QAC1C,uEAAuE;QACvE,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAAC,OAAO;QAAC,CAAC;QACpC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3C,uEAAuE;QACvE,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5D,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YAC5B,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACzB,MAAM,CAAC,QAAQ,CAAC,IAAI,GAAG,SAAS,EAAE,SAAS,CAAC,CAAC;YAC7C,OAAO;QACR,CAAC;QACD,0DAA0D;QAC1D,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACzB,+DAA+D;QAC/D,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAAC,OAAO;QAAC,CAAC;QAC5C,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;QAClC,sEAAsE;QACtE,2CAA2C;QAC3C,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAC3D,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,GAAG,SAAS,CAAC;YAC7C,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YAC9B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC/C,CAAC;IACF,CAAC;IAED;;OAEG;IACK,sBAAsB;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC1C,IAAI,IAAI,EAAE,CAAC;YAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC;IACrC,CAAC;IAED;;;;;;;OAOG;IACK,qBAAqB;QAC5B,IAAI,KAAkC,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;gBACzD,KAAK,GAAG,IAAI,CAAC;YACd,CAAC;QACF,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;CACD;AAhKD,oCAgKC;AAED;;;;;GAKG;AACH,MAAM,YAAY;IAAlB;QACkB,cAAS,GAAiC,IAAI,GAAG,EAAE,CAAC;QAC7D,aAAQ,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAiDtC,CAAC;IA3CA,8CAA8C;IAC9C,IAAI,QAAQ;QACX,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;IACjC,CAAC;IAED,2CAA2C;IAC3C,IAAI,UAAU;QACb,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED,oEAAoE;IACpE,QAAQ,CAAC,IAAY,EAAE,KAAsB;QAC5C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChC,KAAK,CAAC,MAAM,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACrC,CAAC;IAED,2EAA2E;IAC3E,WAAW,CAAC,IAAY;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,KAAK,EAAE,CAAC;YAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;QAAC,CAAC;QACxC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,yDAAyD;IACzD,IAAI,KAAK;QACR,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,oDAAoD;IACpD,IAAI,KAAK,CAAC,KAAoB;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,4EAA4E;IAC5E,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAEO,KAAK;QACZ,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IACnC,CAAC;CACD"}

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

@@ -1,12 +0,0 @@
-import { CancellationToken, Position } from 'vscode-languageserver-protocol';
-import { ServicesAccessor } from '../../../../../util/vs/platform/instantiation/common/instantiation';
-import { CopilotCompletion } from './ghostText/copilotCompletion';
-import { GetGhostTextOptions } from './ghostText/ghostText';
-import { ITextEditorOptions } from './ghostText/normalizeIndent';
-import { ITextDocument } from './textDocument';
-type GetInlineCompletionsOptions = Partial<GetGhostTextOptions> & {
-    formattingOptions?: ITextEditorOptions;
-};
-export declare function getInlineCompletions(accessor: ServicesAccessor, textDocument: ITextDocument, position: Position, token?: CancellationToken, options?: Exclude<Partial<GetInlineCompletionsOptions>, 'promptOnly'>): Promise<CopilotCompletion[] | undefined>;
-export {};
-//# sourceMappingURL=inlineCompletion.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"inlineCompletion.d.ts","sourceRoot":"","sources":["../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/inlineCompletion.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,iBAAiB,EAAE,QAAQ,EAAS,MAAM,gCAAgC,CAAC;AACpF,OAAO,EAAyB,gBAAgB,EAAE,MAAM,oEAAoE,CAAC;AAE7H,OAAO,EAAmC,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AACnG,OAAO,EAAgB,mBAAmB,EAAc,MAAM,uBAAuB,CAAC;AAEtF,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAIjE,OAAO,EAAE,aAAa,EAAwB,MAAM,gBAAgB,CAAC;AAErE,KAAK,2BAA2B,GAAG,OAAO,CAAC,mBAAmB,CAAC,GAAG;IACjE,iBAAiB,CAAC,EAAE,kBAAkB,CAAC;CACvC,CAAC;AAsEF,wBAAsB,oBAAoB,CACzC,QAAQ,EAAE,gBAAgB,EAC1B,YAAY,EAAE,aAAa,EAC3B,QAAQ,EAAE,QAAQ,EAClB,KAAK,CAAC,EAAE,iBAAiB,EACzB,OAAO,GAAE,OAAO,CAAC,OAAO,CAAC,2BAA2B,CAAC,EAAE,YAAY,CAAM,GACvE,OAAO,CAAC,iBAAiB,EAAE,GAAG,SAAS,CAAC,CAM1C"}

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

@@ -1,87 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getInlineCompletions = getInlineCompletions;
-/*---------------------------------------------------------------------------------------------
- *  Copyright (c) Microsoft Corporation. All rights reserved.
- *  Licensed under the MIT License. See License.txt in the project root for license information.
- *--------------------------------------------------------------------------------------------*/
-const vscode_languageserver_protocol_1 = require("vscode-languageserver-protocol");
-const instantiation_1 = require("../../../../../util/vs/platform/instantiation/common/instantiation");
-const completionState_1 = require("./completionState");
-const copilotCompletion_1 = require("./ghostText/copilotCompletion");
-const ghostText_1 = require("./ghostText/ghostText");
-const last_1 = require("./ghostText/last");
-const speculativeRequestCache_1 = require("./ghostText/speculativeRequestCache");
-const telemetry_1 = require("./ghostText/telemetry");
-const logger_1 = require("./logger");
-async function getInlineCompletionsResult(accessor, completionState, token, options = {}) {
-    const instantiationService = accessor.get(instantiation_1.IInstantiationService);
-    const speculativeRequestCache = accessor.get(speculativeRequestCache_1.ICompletionsSpeculativeRequestCache);
-    let lineLengthIncrease = 0;
-    // The golang.go extension (and quite possibly others) uses snippets for function completions, which collapse down
-    // to look like empty function calls (e.g., `foo()`) in selectedCompletionInfo.text.  Injecting that directly into
-    // the prompt produces low quality completions, so don't.
-    if (options.selectedCompletionInfo?.text && !options.selectedCompletionInfo.text.includes(')')) {
-        completionState = completionState.addSelectedCompletionInfo(options.selectedCompletionInfo);
-        lineLengthIncrease = completionState.position.character - options.selectedCompletionInfo.range.end.character;
-    }
-    const result = await instantiationService.invokeFunction(ghostText_1.getGhostText, completionState, token, options);
-    if (result.type !== 'success') {
-        return result;
-    }
-    const [resultArray, resultType] = result.value;
-    if (token?.isCancellationRequested) {
-        return {
-            type: 'canceled',
-            reason: 'after getGhostText',
-            telemetryData: { telemetryBlob: result.telemetryBlob },
-        };
-    }
-    const index = instantiationService.invokeFunction(last_1.setLastShown, completionState.textDocument, completionState.position, resultType);
-    const completions = (0, copilotCompletion_1.completionsFromGhostTextResults)(resultArray, resultType, completionState.textDocument, completionState.position, options.formattingOptions, index);
-    if (completions.length === 0) {
-        // This is a backstop, most/all cases of an empty completions list should be caught earlier
-        // TODO: figure out how this accounts for 7% of ghostText.empty when it looks unreachable
-        return { type: 'empty', reason: 'no completions in final result', telemetryData: result.telemetryData };
-    }
-    // Speculatively request a new completion including the newly returned completion in the document
-    if (resultType !== ghostText_1.ResultType.TypingAsSuggested) {
-        completionState = completionState.applyEdits([
-            {
-                newText: completions[0].insertText,
-                range: completions[0].range,
-            },
-        ]);
-        // Cache speculative request to be triggered when telemetryShown is called
-        const specOpts = { isSpeculative: true, opportunityId: options.opportunityId };
-        const fn = () => instantiationService.invokeFunction(ghostText_1.getGhostText, completionState, undefined, specOpts);
-        speculativeRequestCache.set(completions[0].clientCompletionId, fn);
-    }
-    const value = completions.map(completion => {
-        const { start, end } = completion.range;
-        const range = vscode_languageserver_protocol_1.Range.create(start, vscode_languageserver_protocol_1.Position.create(end.line, end.character - lineLengthIncrease));
-        return { ...completion, range };
-    });
-    return { ...result, value };
-}
-async function getInlineCompletions(accessor, textDocument, position, token, options = {}) {
-    const instantiationService = accessor.get(instantiation_1.IInstantiationService);
-    logCompletionLocation(accessor.get(logger_1.ICompletionsLogTargetService), textDocument, position);
-    const result = await getInlineCompletionsResult(accessor, (0, completionState_1.createCompletionState)(textDocument, position), token, options);
-    return instantiationService.invokeFunction(telemetry_1.handleGhostTextResultTelemetry, result);
-}
-function logCompletionLocation(logTarget, textDocument, position) {
-    const prefix = textDocument.getText({
-        start: { line: Math.max(position.line - 1, 0), character: 0 },
-        end: position,
-    });
-    const suffix = textDocument.getText({
-        start: position,
-        end: {
-            line: Math.min(position.line + 2, textDocument.lineCount - 1),
-            character: textDocument.lineCount - 1 > position.line ? 0 : position.character,
-        },
-    });
-    telemetry_1.logger.debug(logTarget, `Requesting for ${textDocument.uri} at ${position.line}:${position.character}`, `between ${JSON.stringify(prefix)} and ${JSON.stringify(suffix)}.`);
-}
-//# sourceMappingURL=inlineCompletion.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"inlineCompletion.js","sourceRoot":"","sources":["../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/inlineCompletion.ts"],"names":[],"mappings":";;AAwFA,oDAYC;AApGD;;;gGAGgG;AAChG,mFAAoF;AACpF,sGAA6H;AAC7H,uDAA2E;AAC3E,qEAAmG;AACnG,qDAAsF;AACtF,2CAAgD;AAEhD,iFAA0F;AAC1F,qDAA6G;AAC7G,qCAAwD;AAOxD,KAAK,UAAU,0BAA0B,CACxC,QAA0B,EAC1B,eAAgC,EAChC,KAAyB,EACzB,UAAuC,EAAE;IAEzC,MAAM,oBAAoB,GAAG,QAAQ,CAAC,GAAG,CAAC,qCAAqB,CAAC,CAAC;IACjE,MAAM,uBAAuB,GAAG,QAAQ,CAAC,GAAG,CAAC,6DAAmC,CAAC,CAAC;IAClF,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,kHAAkH;IAClH,kHAAkH;IAClH,yDAAyD;IACzD,IAAI,OAAO,CAAC,sBAAsB,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAChG,eAAe,GAAG,eAAe,CAAC,yBAAyB,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC;QAC5F,kBAAkB,GAAG,eAAe,CAAC,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,sBAAsB,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;IAC9G,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,oBAAoB,CAAC,cAAc,CAAC,wBAAY,EAAE,eAAe,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACxG,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAAC,OAAO,MAAM,CAAC;IAAC,CAAC;IACjD,MAAM,CAAC,WAAW,EAAE,UAAU,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;IAE/C,IAAI,KAAK,EAAE,uBAAuB,EAAE,CAAC;QACpC,OAAO;YACN,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,oBAAoB;YAC5B,aAAa,EAAE,EAAE,aAAa,EAAE,MAAM,CAAC,aAAa,EAAE;SACtD,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,oBAAoB,CAAC,cAAc,CAAC,mBAAY,EAAE,eAAe,CAAC,YAAY,EAAE,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAEpI,MAAM,WAAW,GAAG,IAAA,mDAA+B,EAClD,WAAW,EACX,UAAU,EACV,eAAe,CAAC,YAAY,EAC5B,eAAe,CAAC,QAAQ,EACxB,OAAO,CAAC,iBAAiB,EACzB,KAAK,CACL,CAAC;IACF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,2FAA2F;QAC3F,yFAAyF;QACzF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,gCAAgC,EAAE,aAAa,EAAE,MAAM,CAAC,aAAa,EAAE,CAAC;IACzG,CAAC;IAED,iGAAiG;IACjG,IAAI,UAAU,KAAK,sBAAU,CAAC,iBAAiB,EAAE,CAAC;QACjD,eAAe,GAAG,eAAe,CAAC,UAAU,CAAC;YAC5C;gBACC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU;gBAClC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK;aAC3B;SACD,CAAC,CAAC;QAEH,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC;QAC/E,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC,oBAAoB,CAAC,cAAc,CAAC,wBAAY,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACzG,uBAAuB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;QAC1C,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC;QACxC,MAAM,KAAK,GAAG,sCAAK,CAAC,MAAM,CAAC,KAAK,EAAE,yCAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,SAAS,GAAG,kBAAkB,CAAC,CAAC,CAAC;QACjG,OAAO,EAAE,GAAG,UAAU,EAAE,KAAK,EAAE,CAAC;IACjC,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC;AAEM,KAAK,UAAU,oBAAoB,CACzC,QAA0B,EAC1B,YAA2B,EAC3B,QAAkB,EAClB,KAAyB,EACzB,UAAuE,EAAE;IAEzE,MAAM,oBAAoB,GAAG,QAAQ,CAAC,GAAG,CAAC,qCAAqB,CAAC,CAAC;IACjE,qBAAqB,CAAC,QAAQ,CAAC,GAAG,CAAC,qCAA4B,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IAE1F,MAAM,MAAM,GAAG,MAAM,0BAA0B,CAAC,QAAQ,EAAE,IAAA,uCAAqB,EAAC,YAAY,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IACzH,OAAO,oBAAoB,CAAC,cAAc,CAAC,0CAA8B,EAAE,MAAM,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,qBAAqB,CAAC,SAAuC,EAAE,YAAkC,EAAE,QAAkB;IAC7H,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC;QACnC,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE;QAC7D,GAAG,EAAE,QAAQ;KACb,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC;QACnC,KAAK,EAAE,QAAQ;QACf,GAAG,EAAE;YACJ,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC;YAC7D,SAAS,EAAE,YAAY,CAAC,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS;SAC9E;KACD,CAAC,CAAC;IAEH,kBAAM,CAAC,KAAK,CACX,SAAS,EACT,kBAAkB,YAAY,CAAC,GAAG,OAAO,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,SAAS,EAAE,EAC9E,WAAW,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAClE,CAAC;AACH,CAAC"}

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

@@ -1,7 +0,0 @@
-export declare const knownLanguages: {
-    [language: string]: {
-        extensions: string[];
-        filenames?: string[];
-    };
-};
-//# sourceMappingURL=generatedLanguages.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"generatedLanguages.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/lib/src/language/generatedLanguages.ts"],"names":[],"mappings":"AAOA,eAAO,MAAM,cAAc,EAAE;IAAE,CAAC,QAAQ,EAAE,MAAM,GAAG;QAAE,UAAU,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,CAAA;CAquBhG,CAAC"}