@vscode/chat-lib 0.1.2 → 0.1.3-1

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

@@ -0,0 +1,84 @@
+"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.virtualNode = virtualNode;
+exports.lineNode = lineNode;
+exports.blankNode = blankNode;
+exports.topNode = topNode;
+exports.isBlank = isBlank;
+exports.isLine = isLine;
+exports.isVirtual = isVirtual;
+exports.isTop = isTop;
+exports.cutTreeAfterLine = cutTreeAfterLine;
+exports.duplicateTree = duplicateTree;
+/** Construct a virtual node */
+function virtualNode(indentation, subs, label) {
+    return { type: 'virtual', indentation, subs, label };
+}
+/** Construct a line node */
+function lineNode(indentation, lineNumber, sourceLine, subs, label) {
+    if (sourceLine === '') {
+        throw new Error('Cannot create a line node with an empty source line');
+    }
+    return { type: 'line', indentation, lineNumber, sourceLine, subs, label };
+}
+/** Return a blank node */
+function blankNode(line) {
+    return { type: 'blank', lineNumber: line, subs: [] };
+}
+/** Return a node representing the top node */
+function topNode(subs) {
+    return {
+        type: 'top',
+        indentation: -1,
+        subs: subs ?? [],
+    };
+}
+function isBlank(tree) {
+    return tree.type === 'blank';
+}
+function isLine(tree) {
+    return tree.type === 'line';
+}
+function isVirtual(tree) {
+    return tree.type === 'virtual';
+}
+function isTop(tree) {
+    return tree.type === 'top';
+}
+/**
+ * Return the tree which consists of everything up to the line node with the
+ * given number. All later siblings of that line node, recursively, are removed.
+ *
+ * This function does not assume the line numbers appear contiguously, but will
+ * return anything before the numbered line, whether its line number is greater
+ * or not.
+ *
+ * This is destructive and modifies the tree.
+ */
+function cutTreeAfterLine(tree, lineNumber) {
+    function cut(tree) {
+        if (!isVirtual(tree) && !isTop(tree) && tree.lineNumber === lineNumber) {
+            tree.subs = [];
+            return true;
+        }
+        for (let i = 0; i < tree.subs.length; i++) {
+            if (cut(tree.subs[i])) {
+                tree.subs = tree.subs.slice(0, i + 1);
+                return true;
+            }
+        }
+        return false;
+    }
+    cut(tree);
+}
+/**
+ * Return a deep duplicate of the tree -- this will only work if the labels can be stringified to parseable JSON.
+ */
+function duplicateTree(tree) {
+    return JSON.parse(JSON.stringify(tree));
+}
+//# sourceMappingURL=classes.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"classes.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/indentation/classes.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AA2ChG,kCAEC;AAGD,4BAWC;AAGD,8BAEC;AAGD,0BAMC;AAED,0BAEC;AAED,wBAEC;AAED,8BAEC;AAED,sBAEC;AAYD,4CAeC;AAUD,sCAEC;AAtFD,+BAA+B;AAC/B,SAAgB,WAAW,CAAI,WAAmB,EAAE,IAA6B,EAAE,KAAS;IAC3F,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACtD,CAAC;AAED,4BAA4B;AAC5B,SAAgB,QAAQ,CACvB,WAAmB,EACnB,UAAkB,EAClB,UAAkB,EAClB,IAA6B,EAC7B,KAAS;IAET,IAAI,UAAU,KAAK,EAAE,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC3E,CAAC;AAED,0BAA0B;AAC1B,SAAgB,SAAS,CAAC,IAAY;IACrC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACtD,CAAC;AAED,8CAA8C;AAC9C,SAAgB,OAAO,CAAI,IAA8B;IACxD,OAAO;QACN,IAAI,EAAE,KAAK;QACX,WAAW,EAAE,CAAC,CAAC;QACf,IAAI,EAAE,IAAI,IAAI,EAAE;KAChB,CAAC;AACH,CAAC;AAED,SAAgB,OAAO,CAAI,IAAwB;IAClD,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC;AAC9B,CAAC;AAED,SAAgB,MAAM,CAAI,IAAwB;IACjD,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC;AAC7B,CAAC;AAED,SAAgB,SAAS,CAAI,IAAwB;IACpD,OAAO,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC;AAChC,CAAC;AAED,SAAgB,KAAK,CAAI,IAAwB;IAChD,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC;AAC5B,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,gBAAgB,CAAC,IAA8B,EAAE,UAAkB;IAClF,SAAS,GAAG,CAAC,IAA8B;QAC1C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;YACxE,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;QACb,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtC,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,CAAC;AACX,CAAC;AAOD;;GAEG;AACH,SAAgB,aAAa,CAAuB,IAAwB;IAC3E,OAA2B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7D,CAAC"}

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

@@ -0,0 +1,51 @@
+import { IndentationSubTree, IndentationTree, TopNode } from './classes';
+/**
+ * Clear all labels (and their types) from the tree.
+ * This will modify the tree in place, or return a retyped tree.
+ */
+export declare function clearLabels<L>(tree: IndentationTree<L>): IndentationTree<never>;
+/** clear labels if condition is true */
+export declare function clearLabelsIf<L, S>(tree: IndentationTree<L | S>, condition: (arg: L | S) => arg is S): IndentationTree<L>;
+export declare function mapLabels<L1, L2>(tree: IndentationSubTree<L1>, map: (arg: L1) => L2 | undefined): IndentationSubTree<L2>;
+export declare function mapLabels<L1, L2>(tree: TopNode<L1>, map: (arg: L1) => L2 | undefined): TopNode<L2>;
+export declare function mapLabels<L1, L2>(tree: IndentationTree<L1>, map: (arg: L1) => L2 | undefined): IndentationTree<L2>;
+/**
+ * Renumber the line numbers of the tree contiguously from 0 and up.
+ */
+export declare function resetLineNumbers<L>(tree: IndentationTree<L>): void;
+/**
+ * Visit the tree with a function that is called on each node.
+ *
+ * If direction is topDown, then parents are visited before their children.
+ * If direction is bottomUp, children are visited in order before their parents,
+ * so that leaf nodes are visited first.
+ */
+export declare function visitTree<L>(tree: IndentationTree<L>, visitor: (tree: IndentationTree<L>) => void, direction: 'topDown' | 'bottomUp'): void;
+/**
+ * Visit the tree with a function that is called on each node --
+ * if it returns false, children are not visited (in case of topDown),
+ * or the parent is not visited anymore (in case of bottomUp).
+ *
+ * If direction is topDown, then parents are visited before their children.
+ * If direction is bottomUp, children are visited in order before their parents,
+ * so that leaf nodes are visited first.
+ */
+export declare function visitTreeConditionally<L>(tree: IndentationTree<L>, visitor: (tree: IndentationTree<L>) => boolean, direction: 'topDown' | 'bottomUp'): void;
+/**
+ * Fold an accumulator function over the tree.
+ *
+ * If direction is topDown, then parents are visited before their children.
+ * If direction is bottomUp, children are visited in order before their parents,
+ * so that leaf nodes are visited first.
+ */
+export declare function foldTree<T, L>(tree: IndentationTree<L>, init: T, accumulator: (tree: IndentationTree<L>, acc: T) => T, direction: 'topDown' | 'bottomUp'): T;
+export type Rebuilder<L> = (tree: IndentationTree<L>) => IndentationTree<L> | undefined;
+/**
+ * Rebuild the tree from the bottom up by applying a function to each node.
+ * The visitor function takes a node whose children have already been rebuilt,
+ * and returns a new node to replace it (or undefined if it should be deleted).
+ * Optionally, a function can be provided to skip nodes that should just be kept
+ * without visiting them or their sub-nodes.
+ */
+export declare function rebuildTree<L>(tree: IndentationTree<L>, visitor: Rebuilder<L>, skip?: (tree: IndentationTree<L>) => boolean): IndentationTree<L>;
+//# sourceMappingURL=manipulation.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"manipulation.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/indentation/manipulation.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,OAAO,EAA6B,MAAM,WAAW,CAAC;AAEpG;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAS/E;AAED,wCAAwC;AACxC,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EACjC,IAAI,EAAE,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5B,SAAS,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GACjC,eAAe,CAAC,CAAC,CAAC,CASpB;AAED,wBAAgB,SAAS,CAAC,EAAE,EAAE,EAAE,EAC/B,IAAI,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAC5B,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,SAAS,GAC9B,kBAAkB,CAAC,EAAE,CAAC,CAAC;AAC1B,wBAAgB,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,SAAS,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;AACpG,wBAAgB,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,eAAe,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,GAAG,SAAS,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;AAyBpH;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,IAAI,CASlE;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAC1B,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EACxB,OAAO,EAAE,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,IAAI,EAC3C,SAAS,EAAE,SAAS,GAAG,UAAU,GAC/B,IAAI,CAaN;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EACvC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EACxB,OAAO,EAAE,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,OAAO,EAC9C,SAAS,EAAE,SAAS,GAAG,UAAU,GAC/B,IAAI,CAkBN;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAC5B,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EACxB,IAAI,EAAE,CAAC,EACP,WAAW,EAAE,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,EACpD,SAAS,EAAE,SAAS,GAAG,UAAU,GAC/B,CAAC,CAOH;AAED,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AACxF;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC5B,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EACxB,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,EACrB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,OAAO,GAC1C,eAAe,CAAC,CAAC,CAAC,CAgBpB"}

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

@@ -0,0 +1,159 @@
+"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.clearLabels = clearLabels;
+exports.clearLabelsIf = clearLabelsIf;
+exports.mapLabels = mapLabels;
+exports.resetLineNumbers = resetLineNumbers;
+exports.visitTree = visitTree;
+exports.visitTreeConditionally = visitTreeConditionally;
+exports.foldTree = foldTree;
+exports.rebuildTree = rebuildTree;
+const classes_1 = require("./classes");
+/**
+ * Clear all labels (and their types) from the tree.
+ * This will modify the tree in place, or return a retyped tree.
+ */
+function clearLabels(tree) {
+    visitTree(tree, (tree) => {
+        tree.label = undefined;
+    }, 'bottomUp');
+    return tree;
+}
+/** clear labels if condition is true */
+function clearLabelsIf(tree, condition) {
+    visitTree(tree, (tree) => {
+        tree.label = tree.label ? (condition(tree.label) ? undefined : tree.label) : undefined;
+    }, 'bottomUp');
+    return tree;
+}
+/**
+ * Apply a type changing function to all labels.
+ * This will return a new, retyped tree.
+ * (For applying a type keeping function to a tree
+ * that modifies it in place, use `visitTree`.)
+ */
+function mapLabels(tree, map) {
+    switch (tree.type) {
+        case 'line':
+        case 'virtual': {
+            const newSubs = tree.subs.map(sub => mapLabels(sub, map));
+            return { ...tree, subs: newSubs, label: tree.label ? map(tree.label) : undefined };
+        }
+        case 'blank':
+            return { ...tree, label: tree.label ? map(tree.label) : undefined };
+        case 'top':
+            return {
+                ...tree,
+                subs: tree.subs.map(sub => mapLabels(sub, map)),
+                label: tree.label ? map(tree.label) : undefined,
+            };
+    }
+}
+/**
+ * Renumber the line numbers of the tree contiguously from 0 and up.
+ */
+function resetLineNumbers(tree) {
+    let lineNumber = 0;
+    function visitor(tree) {
+        if (!(0, classes_1.isVirtual)(tree) && !(0, classes_1.isTop)(tree)) {
+            tree.lineNumber = lineNumber;
+            lineNumber++;
+        }
+    }
+    visitTree(tree, visitor, 'topDown');
+}
+/**
+ * Visit the tree with a function that is called on each node.
+ *
+ * If direction is topDown, then parents are visited before their children.
+ * If direction is bottomUp, children are visited in order before their parents,
+ * so that leaf nodes are visited first.
+ */
+function visitTree(tree, visitor, direction) {
+    function _visit(tree) {
+        if (direction === 'topDown') {
+            visitor(tree);
+        }
+        tree.subs.forEach(subtree => {
+            _visit(subtree);
+        });
+        if (direction === 'bottomUp') {
+            visitor(tree);
+        }
+    }
+    _visit(tree);
+}
+/**
+ * Visit the tree with a function that is called on each node --
+ * if it returns false, children are not visited (in case of topDown),
+ * or the parent is not visited anymore (in case of bottomUp).
+ *
+ * If direction is topDown, then parents are visited before their children.
+ * If direction is bottomUp, children are visited in order before their parents,
+ * so that leaf nodes are visited first.
+ */
+function visitTreeConditionally(tree, visitor, direction) {
+    // IDEA: rewrite visitTree to reuse this code
+    function _visit(tree) {
+        if (direction === 'topDown') {
+            if (!visitor(tree)) {
+                return false;
+            }
+        }
+        let shouldContinue = true;
+        tree.subs.forEach(subtree => {
+            shouldContinue = shouldContinue && _visit(subtree);
+        });
+        if (direction === 'bottomUp') {
+            shouldContinue = shouldContinue && visitor(tree);
+        }
+        return shouldContinue;
+    }
+    _visit(tree);
+}
+/**
+ * Fold an accumulator function over the tree.
+ *
+ * If direction is topDown, then parents are visited before their children.
+ * If direction is bottomUp, children are visited in order before their parents,
+ * so that leaf nodes are visited first.
+ */
+function foldTree(tree, init, accumulator, direction) {
+    let acc = init;
+    function visitor(tree) {
+        acc = accumulator(tree, acc);
+    }
+    visitTree(tree, visitor, direction);
+    return acc;
+}
+/**
+ * Rebuild the tree from the bottom up by applying a function to each node.
+ * The visitor function takes a node whose children have already been rebuilt,
+ * and returns a new node to replace it (or undefined if it should be deleted).
+ * Optionally, a function can be provided to skip nodes that should just be kept
+ * without visiting them or their sub-nodes.
+ */
+function rebuildTree(tree, visitor, skip) {
+    const rebuild = (tree) => {
+        if (skip !== undefined && skip(tree)) {
+            return tree;
+        }
+        else {
+            const newSubs = tree.subs.map(rebuild).filter(sub => sub !== undefined);
+            tree.subs = newSubs;
+            return visitor(tree);
+        }
+    };
+    const rebuilt = rebuild(tree);
+    if (rebuilt !== undefined) {
+        return rebuilt;
+    }
+    else {
+        return (0, classes_1.topNode)();
+    }
+}
+//# sourceMappingURL=manipulation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"manipulation.js","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/indentation/manipulation.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAQhG,kCASC;AAGD,sCAYC;AAcD,8BAgBC;AAKD,4CASC;AASD,8BAiBC;AAWD,wDAsBC;AASD,4BAYC;AAUD,kCAoBC;AAxLD,uCAAoG;AAEpG;;;GAGG;AACH,SAAgB,WAAW,CAAI,IAAwB;IACtD,SAAS,CACR,IAAI,EACJ,CAAC,IAAwB,EAAE,EAAE;QAC5B,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;IACxB,CAAC,EACD,UAAU,CACV,CAAC;IACF,OAAO,IAA8B,CAAC;AACvC,CAAC;AAED,wCAAwC;AACxC,SAAgB,aAAa,CAC5B,IAA4B,EAC5B,SAAmC;IAEnC,SAAS,CACR,IAAI,EACJ,CAAC,IAA4B,EAAE,EAAE;QAChC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxF,CAAC,EACD,UAAU,CACV,CAAC;IACF,OAAO,IAA0B,CAAC;AACnC,CAAC;AAQD;;;;;GAKG;AACH,SAAgB,SAAS,CAAS,IAAyB,EAAE,GAAgC;IAC5F,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,MAAM,CAAC;QACZ,KAAK,SAAS,CAAC,CAAC,CAAC;YAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC1D,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACpF,CAAC;QACD,KAAK,OAAO;YACX,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACrE,KAAK,KAAK;YACT,OAAO;gBACN,GAAG,IAAI;gBACP,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC/C,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;aAC/C,CAAC;IACJ,CAAC;AACF,CAAC;AAED;;GAEG;AACH,SAAgB,gBAAgB,CAAI,IAAwB;IAC3D,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,SAAS,OAAO,CAAC,IAAwB;QACxC,IAAI,CAAC,IAAA,mBAAS,EAAC,IAAI,CAAC,IAAI,CAAC,IAAA,eAAK,EAAC,IAAI,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7B,UAAU,EAAE,CAAC;QACd,CAAC;IACF,CAAC;IACD,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CACxB,IAAwB,EACxB,OAA2C,EAC3C,SAAiC;IAEjC,SAAS,MAAM,CAAC,IAAwB;QACvC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,CAAC;QACf,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC3B,MAAM,CAAC,OAAO,CAAC,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,CAAC;QACf,CAAC;IACF,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,sBAAsB,CACrC,IAAwB,EACxB,OAA8C,EAC9C,SAAiC;IAEjC,6CAA6C;IAC7C,SAAS,MAAM,CAAC,IAAwB;QACvC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,OAAO,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QACD,IAAI,cAAc,GAAG,IAAI,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC3B,cAAc,GAAG,cAAc,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YAC9B,cAAc,GAAG,cAAc,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,cAAc,CAAC;IACvB,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,QAAQ,CACvB,IAAwB,EACxB,IAAO,EACP,WAAoD,EACpD,SAAiC;IAEjC,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,SAAS,OAAO,CAAC,IAAwB;QACxC,GAAG,GAAG,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACpC,OAAO,GAAG,CAAC;AACZ,CAAC;AAGD;;;;;;GAMG;AACH,SAAgB,WAAW,CAC1B,IAAwB,EACxB,OAAqB,EACrB,IAA4C;IAE5C,MAAM,OAAO,GAAiB,CAAC,IAAwB,EAAE,EAAE;QAC1D,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,OAAO,IAAI,CAAC;QACb,CAAC;aAAM,CAAC;YACP,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,SAAS,CAA4B,CAAC;YACnG,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACF,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,OAAO,CAAC;IAChB,CAAC;SAAM,CAAC;QACP,OAAO,IAAA,iBAAO,GAAE,CAAC;IAClB,CAAC;AACF,CAAC"}

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

@@ -0,0 +1,67 @@
+import { IndentationTree } from './classes';
+/**
+ * Perform a raw indentation-tree parse of a string. This is completely
+ * language-agnostic and the returned tree is unlabeled.
+ *
+ *  - Blank lines pertain to the top-most node that they may, as restricted
+ *    by next non-blank line. So e.g.
+ *
+ *         E
+ *           e1
+ *             e2
+ *
+ *           e3
+ *
+ *     Then e1.subs = [e2], and E.subs = [ e1, blank, e3 ].
+ *
+ */
+export declare function parseRaw(source: string): IndentationTree<never>;
+type LineMatcher = (sourceLine: string) => boolean;
+export interface LabelRule<L> {
+    matches: LineMatcher;
+    label: L | undefined;
+}
+/** Labels the line elements of the tree in-place according to rules */
+export declare function labelLines<L>(tree: IndentationTree<L>, labelRules: LabelRule<L>[]): void;
+/**
+ * For each virtual node, if the node has only one non-blank sub, then label
+ * the virtual node as that sub.
+ */
+export declare function labelVirtualInherited<L>(tree: IndentationTree<L>): void;
+/**
+ * Function to convert a mapped object to a list of rules.
+ * This allows some type magic for extracting a label type from a mapping of rules.
+ */
+export declare function buildLabelRules<L extends {
+    [key: string]: RegExp | LineMatcher;
+}>(ruleMap: L): LabelRule<keyof L>[];
+/**
+ * Fills the opener and closer indentation spec
+ * 1. Openers alone in a line whose older sibling is a line are moved to be the first of that sibling's children,
+ *    and their children integrated as subsequent children of their new parent.
+ * 2. Closers following an older sibling (maybe with blanks in between) are moved to be the last of that sibling.
+ * 3. If the closer in 2 has children themselves, their older siblings are wrapped in a virtual node
+ */
+export declare function combineClosersAndOpeners<L>(tree: IndentationTree<L | 'opener' | 'closer'>): IndentationTree<L | 'opener' | 'closer'>;
+/**
+ * If there are more than 1 consecutive sibling separated from others by delimiters,
+ * combine them into a virtual node.
+ * The possibly several consecutive delimiters will be put with the preceding siblings into the virtual node.
+ * Note that offside groupings should be done before this.
+ */
+export declare function groupBlocks<L>(tree: IndentationTree<L>, isDelimiter?: (node: IndentationTree<L>) => boolean, label?: L): IndentationTree<L>;
+/**
+ * Remove unlabeled virtual nodes which either:
+ *  - Have one or no children
+ *  - Are the only child of their parent
+ * In either case, it is replaced by their children.
+ */
+export declare function flattenVirtual<L>(tree: IndentationTree<L>): IndentationTree<L>;
+/**
+ * Register a language-specific parser for a language.
+ * This should normally be called in index.ts.
+ */
+export declare function registerLanguageSpecificParser(language: string, parser: (raw: IndentationTree<never>) => IndentationTree<string>): void;
+export declare function parseTree(source: string, languageId?: string): IndentationTree<string>;
+export {};
+//# sourceMappingURL=parsing.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"parsing.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/_internal/extension/completions-core/vscode-node/prompt/src/indentation/parsing.ts"],"names":[],"mappings":"AAKA,OAAO,EAGN,eAAe,EAUf,MAAM,WAAW,CAAC;AAGnB;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAiD/D;AAED,KAAK,WAAW,GAAG,CAAC,UAAU,EAAE,MAAM,KAAK,OAAO,CAAC;AACnD,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,OAAO,EAAE,WAAW,CAAC;IACrB,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC;CACrB;AAED,uEAAuE;AACvE,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAUxF;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,IAAI,CAUvE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,SAAS;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,WAAW,CAAA;CAAE,EAAE,OAAO,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAanH;AAED;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CAAC,CAAC,EACzC,IAAI,EAAE,eAAe,CAAC,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAC5C,eAAe,CAAC,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAgE1C;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC5B,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EACxB,WAAW,GAAE,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,OAAiB,EAC5D,KAAK,CAAC,EAAE,CAAC,GACP,eAAe,CAAC,CAAC,CAAC,CA6CpB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAe9E;AAeD;;;GAGG;AACH,wBAAgB,8BAA8B,CAC7C,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,CAAC,GAAG,EAAE,eAAe,CAAC,KAAK,CAAC,KAAK,eAAe,CAAC,MAAM,CAAC,GAC9D,IAAI,CAEN;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAUtF"}