@inkeep/agents-cli 0.63.3 → 0.64.2

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/patch/create.js

@@ -1,142 +0,0 @@
-import { diffLines } from "../diff/line.js";
-
-//#region ../node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/patch/create.js
-const INCLUDE_HEADERS = {
-	includeIndex: true,
-	includeUnderline: true,
-	includeFileHeaders: true
-};
-function structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {
-	let optionsObj;
-	if (!options) optionsObj = {};
-	else if (typeof options === "function") optionsObj = { callback: options };
-	else optionsObj = options;
-	if (typeof optionsObj.context === "undefined") optionsObj.context = 4;
-	const context = optionsObj.context;
-	if (optionsObj.newlineIsToken) throw new Error("newlineIsToken may not be used with patch-generation functions, only with diffing functions");
-	if (!optionsObj.callback) return diffLinesResultToPatch(diffLines(oldStr, newStr, optionsObj));
-	else {
-		const { callback } = optionsObj;
-		diffLines(oldStr, newStr, Object.assign(Object.assign({}, optionsObj), { callback: (diff) => {
-			callback(diffLinesResultToPatch(diff));
-		} }));
-	}
-	function diffLinesResultToPatch(diff) {
-		if (!diff) return;
-		diff.push({
-			value: "",
-			lines: []
-		});
-		function contextLines(lines) {
-			return lines.map(function(entry) {
-				return " " + entry;
-			});
-		}
-		const hunks = [];
-		let oldRangeStart = 0, newRangeStart = 0, curRange = [], oldLine = 1, newLine = 1;
-		for (let i = 0; i < diff.length; i++) {
-			const current = diff[i], lines = current.lines || splitLines(current.value);
-			current.lines = lines;
-			if (current.added || current.removed) {
-				if (!oldRangeStart) {
-					const prev = diff[i - 1];
-					oldRangeStart = oldLine;
-					newRangeStart = newLine;
-					if (prev) {
-						curRange = context > 0 ? contextLines(prev.lines.slice(-context)) : [];
-						oldRangeStart -= curRange.length;
-						newRangeStart -= curRange.length;
-					}
-				}
-				for (const line of lines) curRange.push((current.added ? "+" : "-") + line);
-				if (current.added) newLine += lines.length;
-				else oldLine += lines.length;
-			} else {
-				if (oldRangeStart) if (lines.length <= context * 2 && i < diff.length - 2) for (const line of contextLines(lines)) curRange.push(line);
-				else {
-					const contextSize = Math.min(lines.length, context);
-					for (const line of contextLines(lines.slice(0, contextSize))) curRange.push(line);
-					const hunk = {
-						oldStart: oldRangeStart,
-						oldLines: oldLine - oldRangeStart + contextSize,
-						newStart: newRangeStart,
-						newLines: newLine - newRangeStart + contextSize,
-						lines: curRange
-					};
-					hunks.push(hunk);
-					oldRangeStart = 0;
-					newRangeStart = 0;
-					curRange = [];
-				}
-				oldLine += lines.length;
-				newLine += lines.length;
-			}
-		}
-		for (const hunk of hunks) for (let i = 0; i < hunk.lines.length; i++) if (hunk.lines[i].endsWith("\n")) hunk.lines[i] = hunk.lines[i].slice(0, -1);
-		else {
-			hunk.lines.splice(i + 1, 0, "\");
-			i++;
-		}
-		return {
-			oldFileName,
-			newFileName,
-			oldHeader,
-			newHeader,
-			hunks
-		};
-	}
-}
-/**
-* creates a unified diff patch.
-* @param patch either a single structured patch object (as returned by `structuredPatch`) or an array of them (as returned by `parsePatch`)
-*/
-function formatPatch(patch, headerOptions) {
-	if (!headerOptions) headerOptions = INCLUDE_HEADERS;
-	if (Array.isArray(patch)) {
-		if (patch.length > 1 && !headerOptions.includeFileHeaders) throw new Error("Cannot omit file headers on a multi-file patch. (The result would be unparseable; how would a tool trying to apply the patch know which changes are to which file?)");
-		return patch.map((p) => formatPatch(p, headerOptions)).join("\n");
-	}
-	const ret = [];
-	if (headerOptions.includeIndex && patch.oldFileName == patch.newFileName) ret.push("Index: " + patch.oldFileName);
-	if (headerOptions.includeUnderline) ret.push("===================================================================");
-	if (headerOptions.includeFileHeaders) {
-		ret.push("--- " + patch.oldFileName + (typeof patch.oldHeader === "undefined" ? "" : "	" + patch.oldHeader));
-		ret.push("+++ " + patch.newFileName + (typeof patch.newHeader === "undefined" ? "" : "	" + patch.newHeader));
-	}
-	for (let i = 0; i < patch.hunks.length; i++) {
-		const hunk = patch.hunks[i];
-		if (hunk.oldLines === 0) hunk.oldStart -= 1;
-		if (hunk.newLines === 0) hunk.newStart -= 1;
-		ret.push("@@ -" + hunk.oldStart + "," + hunk.oldLines + " +" + hunk.newStart + "," + hunk.newLines + " @@");
-		for (const line of hunk.lines) ret.push(line);
-	}
-	return ret.join("\n") + "\n";
-}
-function createTwoFilesPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {
-	if (typeof options === "function") options = { callback: options };
-	if (!(options === null || options === void 0 ? void 0 : options.callback)) {
-		const patchObj = structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options);
-		if (!patchObj) return;
-		return formatPatch(patchObj, options === null || options === void 0 ? void 0 : options.headerOptions);
-	} else {
-		const { callback } = options;
-		structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, Object.assign(Object.assign({}, options), { callback: (patchObj) => {
-			if (!patchObj) callback(void 0);
-			else callback(formatPatch(patchObj, options.headerOptions));
-		} }));
-	}
-}
-/**
-* Split `text` into an array of lines, including the trailing newline character (where present)
-*/
-function splitLines(text) {
-	const hasTrailingNl = text.endsWith("\n");
-	const result = text.split("\n").map((line) => line + "\n");
-	if (hasTrailingNl) result.pop();
-	else result.push(result.pop().slice(0, -1));
-	return result;
-}
-
-//#endregion
-export { INCLUDE_HEADERS, createTwoFilesPatch, formatPatch, structuredPatch };
-//# sourceMappingURL=create.js.map

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/patch/create.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"create.js","names":[],"sources":["../../../../../../../../../node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/patch/create.js"],"sourcesContent":["import { diffLines } from '../diff/line.js';\nexport const INCLUDE_HEADERS = {\n    includeIndex: true,\n    includeUnderline: true,\n    includeFileHeaders: true\n};\nexport const FILE_HEADERS_ONLY = {\n    includeIndex: false,\n    includeUnderline: false,\n    includeFileHeaders: true\n};\nexport const OMIT_HEADERS = {\n    includeIndex: false,\n    includeUnderline: false,\n    includeFileHeaders: false\n};\nexport function structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {\n    let optionsObj;\n    if (!options) {\n        optionsObj = {};\n    }\n    else if (typeof options === 'function') {\n        optionsObj = { callback: options };\n    }\n    else {\n        optionsObj = options;\n    }\n    if (typeof optionsObj.context === 'undefined') {\n        optionsObj.context = 4;\n    }\n    // We copy this into its own variable to placate TypeScript, which thinks\n    // optionsObj.context might be undefined in the callbacks below.\n    const context = optionsObj.context;\n    // @ts-expect-error (runtime check for something that is correctly a static type error)\n    if (optionsObj.newlineIsToken) {\n        throw new Error('newlineIsToken may not be used with patch-generation functions, only with diffing functions');\n    }\n    if (!optionsObj.callback) {\n        return diffLinesResultToPatch(diffLines(oldStr, newStr, optionsObj));\n    }\n    else {\n        const { callback } = optionsObj;\n        diffLines(oldStr, newStr, Object.assign(Object.assign({}, optionsObj), { callback: (diff) => {\n                const patch = diffLinesResultToPatch(diff);\n                // TypeScript is unhappy without the cast because it does not understand that `patch` may\n                // be undefined here only if `callback` is StructuredPatchCallbackAbortable:\n                callback(patch);\n            } }));\n    }\n    function diffLinesResultToPatch(diff) {\n        // STEP 1: Build up the patch with no \"\\" lines and with the arrays\n        //         of lines containing trailing newline characters. We'll tidy up later...\n        if (!diff) {\n            return;\n        }\n        diff.push({ value: '', lines: [] }); // Append an empty value to make cleanup easier\n        function contextLines(lines) {\n            return lines.map(function (entry) { return ' ' + entry; });\n        }\n        const hunks = [];\n        let oldRangeStart = 0, newRangeStart = 0, curRange = [], oldLine = 1, newLine = 1;\n        for (let i = 0; i < diff.length; i++) {\n            const current = diff[i], lines = current.lines || splitLines(current.value);\n            current.lines = lines;\n            if (current.added || current.removed) {\n                // If we have previous context, start with that\n                if (!oldRangeStart) {\n                    const prev = diff[i - 1];\n                    oldRangeStart = oldLine;\n                    newRangeStart = newLine;\n                    if (prev) {\n                        curRange = context > 0 ? contextLines(prev.lines.slice(-context)) : [];\n                        oldRangeStart -= curRange.length;\n                        newRangeStart -= curRange.length;\n                    }\n                }\n                // Output our changes\n                for (const line of lines) {\n                    curRange.push((current.added ? '+' : '-') + line);\n                }\n                // Track the updated file position\n                if (current.added) {\n                    newLine += lines.length;\n                }\n                else {\n                    oldLine += lines.length;\n                }\n            }\n            else {\n                // Identical context lines. Track line changes\n                if (oldRangeStart) {\n                    // Close out any changes that have been output (or join overlapping)\n                    if (lines.length <= context * 2 && i < diff.length - 2) {\n                        // Overlapping\n                        for (const line of contextLines(lines)) {\n                            curRange.push(line);\n                        }\n                    }\n                    else {\n                        // end the range and output\n                        const contextSize = Math.min(lines.length, context);\n                        for (const line of contextLines(lines.slice(0, contextSize))) {\n                            curRange.push(line);\n                        }\n                        const hunk = {\n                            oldStart: oldRangeStart,\n                            oldLines: (oldLine - oldRangeStart + contextSize),\n                            newStart: newRangeStart,\n                            newLines: (newLine - newRangeStart + contextSize),\n                            lines: curRange\n                        };\n                        hunks.push(hunk);\n                        oldRangeStart = 0;\n                        newRangeStart = 0;\n                        curRange = [];\n                    }\n                }\n                oldLine += lines.length;\n                newLine += lines.length;\n            }\n        }\n        // Step 2: eliminate the trailing `\\n` from each line of each hunk, and, where needed, add\n        //         \"\\".\n        for (const hunk of hunks) {\n            for (let i = 0; i < hunk.lines.length; i++) {\n                if (hunk.lines[i].endsWith('\\n')) {\n                    hunk.lines[i] = hunk.lines[i].slice(0, -1);\n                }\n                else {\n                    hunk.lines.splice(i + 1, 0, '\\\');\n                    i++; // Skip the line we just added, then continue iterating\n                }\n            }\n        }\n        return {\n            oldFileName: oldFileName, newFileName: newFileName,\n            oldHeader: oldHeader, newHeader: newHeader,\n            hunks: hunks\n        };\n    }\n}\n/**\n * creates a unified diff patch.\n * @param patch either a single structured patch object (as returned by `structuredPatch`) or an array of them (as returned by `parsePatch`)\n */\nexport function formatPatch(patch, headerOptions) {\n    if (!headerOptions) {\n        headerOptions = INCLUDE_HEADERS;\n    }\n    if (Array.isArray(patch)) {\n        if (patch.length > 1 && !headerOptions.includeFileHeaders) {\n            throw new Error('Cannot omit file headers on a multi-file patch. '\n                + '(The result would be unparseable; how would a tool trying to apply '\n                + 'the patch know which changes are to which file?)');\n        }\n        return patch.map(p => formatPatch(p, headerOptions)).join('\\n');\n    }\n    const ret = [];\n    if (headerOptions.includeIndex && patch.oldFileName == patch.newFileName) {\n        ret.push('Index: ' + patch.oldFileName);\n    }\n    if (headerOptions.includeUnderline) {\n        ret.push('===================================================================');\n    }\n    if (headerOptions.includeFileHeaders) {\n        ret.push('--- ' + patch.oldFileName + (typeof patch.oldHeader === 'undefined' ? '' : '\\t' + patch.oldHeader));\n        ret.push('+++ ' + patch.newFileName + (typeof patch.newHeader === 'undefined' ? '' : '\\t' + patch.newHeader));\n    }\n    for (let i = 0; i < patch.hunks.length; i++) {\n        const hunk = patch.hunks[i];\n        // Unified Diff Format quirk: If the chunk size is 0,\n        // the first number is one lower than one would expect.\n        // https://www.artima.com/weblogs/viewpost.jsp?thread=164293\n        if (hunk.oldLines === 0) {\n            hunk.oldStart -= 1;\n        }\n        if (hunk.newLines === 0) {\n            hunk.newStart -= 1;\n        }\n        ret.push('@@ -' + hunk.oldStart + ',' + hunk.oldLines\n            + ' +' + hunk.newStart + ',' + hunk.newLines\n            + ' @@');\n        for (const line of hunk.lines) {\n            ret.push(line);\n        }\n    }\n    return ret.join('\\n') + '\\n';\n}\nexport function createTwoFilesPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options) {\n    if (typeof options === 'function') {\n        options = { callback: options };\n    }\n    if (!(options === null || options === void 0 ? void 0 : options.callback)) {\n        const patchObj = structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, options);\n        if (!patchObj) {\n            return;\n        }\n        return formatPatch(patchObj, options === null || options === void 0 ? void 0 : options.headerOptions);\n    }\n    else {\n        const { callback } = options;\n        structuredPatch(oldFileName, newFileName, oldStr, newStr, oldHeader, newHeader, Object.assign(Object.assign({}, options), { callback: patchObj => {\n                if (!patchObj) {\n                    callback(undefined);\n                }\n                else {\n                    callback(formatPatch(patchObj, options.headerOptions));\n                }\n            } }));\n    }\n}\nexport function createPatch(fileName, oldStr, newStr, oldHeader, newHeader, options) {\n    return createTwoFilesPatch(fileName, fileName, oldStr, newStr, oldHeader, newHeader, options);\n}\n/**\n * Split `text` into an array of lines, including the trailing newline character (where present)\n */\nfunction splitLines(text) {\n    const hasTrailingNl = text.endsWith('\\n');\n    const result = text.split('\\n').map(line => line + '\\n');\n    if (hasTrailingNl) {\n        result.pop();\n    }\n    else {\n        result.push(result.pop().slice(0, -1));\n    }\n    return result;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;AACA,MAAa,kBAAkB;CAC3B,cAAc;CACd,kBAAkB;CAClB,oBAAoB;CACvB;AAWD,SAAgB,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,SAAS;CACrG,IAAI;AACJ,KAAI,CAAC,QACD,cAAa,EAAE;UAEV,OAAO,YAAY,WACxB,cAAa,EAAE,UAAU,SAAS;KAGlC,cAAa;AAEjB,KAAI,OAAO,WAAW,YAAY,YAC9B,YAAW,UAAU;CAIzB,MAAM,UAAU,WAAW;AAE3B,KAAI,WAAW,eACX,OAAM,IAAI,MAAM,8FAA8F;AAElH,KAAI,CAAC,WAAW,SACZ,QAAO,uBAAuB,UAAU,QAAQ,QAAQ,WAAW,CAAC;MAEnE;EACD,MAAM,EAAE,aAAa;AACrB,YAAU,QAAQ,QAAQ,OAAO,OAAO,OAAO,OAAO,EAAE,EAAE,WAAW,EAAE,EAAE,WAAW,SAAS;AAIrF,YAHc,uBAAuB,KAAK,CAG3B;KAChB,CAAC,CAAC;;CAEb,SAAS,uBAAuB,MAAM;AAGlC,MAAI,CAAC,KACD;AAEJ,OAAK,KAAK;GAAE,OAAO;GAAI,OAAO,EAAE;GAAE,CAAC;EACnC,SAAS,aAAa,OAAO;AACzB,UAAO,MAAM,IAAI,SAAU,OAAO;AAAE,WAAO,MAAM;KAAS;;EAE9D,MAAM,QAAQ,EAAE;EAChB,IAAI,gBAAgB,GAAG,gBAAgB,GAAG,WAAW,EAAE,EAAE,UAAU,GAAG,UAAU;AAChF,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GAClC,MAAM,UAAU,KAAK,IAAI,QAAQ,QAAQ,SAAS,WAAW,QAAQ,MAAM;AAC3E,WAAQ,QAAQ;AAChB,OAAI,QAAQ,SAAS,QAAQ,SAAS;AAElC,QAAI,CAAC,eAAe;KAChB,MAAM,OAAO,KAAK,IAAI;AACtB,qBAAgB;AAChB,qBAAgB;AAChB,SAAI,MAAM;AACN,iBAAW,UAAU,IAAI,aAAa,KAAK,MAAM,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE;AACtE,uBAAiB,SAAS;AAC1B,uBAAiB,SAAS;;;AAIlC,SAAK,MAAM,QAAQ,MACf,UAAS,MAAM,QAAQ,QAAQ,MAAM,OAAO,KAAK;AAGrD,QAAI,QAAQ,MACR,YAAW,MAAM;QAGjB,YAAW,MAAM;UAGpB;AAED,QAAI,cAEA,KAAI,MAAM,UAAU,UAAU,KAAK,IAAI,KAAK,SAAS,EAEjD,MAAK,MAAM,QAAQ,aAAa,MAAM,CAClC,UAAS,KAAK,KAAK;SAGtB;KAED,MAAM,cAAc,KAAK,IAAI,MAAM,QAAQ,QAAQ;AACnD,UAAK,MAAM,QAAQ,aAAa,MAAM,MAAM,GAAG,YAAY,CAAC,CACxD,UAAS,KAAK,KAAK;KAEvB,MAAM,OAAO;MACT,UAAU;MACV,UAAW,UAAU,gBAAgB;MACrC,UAAU;MACV,UAAW,UAAU,gBAAgB;MACrC,OAAO;MACV;AACD,WAAM,KAAK,KAAK;AAChB,qBAAgB;AAChB,qBAAgB;AAChB,gBAAW,EAAE;;AAGrB,eAAW,MAAM;AACjB,eAAW,MAAM;;;AAKzB,OAAK,MAAM,QAAQ,MACf,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,IACnC,KAAI,KAAK,MAAM,GAAG,SAAS,KAAK,CAC5B,MAAK,MAAM,KAAK,KAAK,MAAM,GAAG,MAAM,GAAG,GAAG;OAEzC;AACD,QAAK,MAAM,OAAO,IAAI,GAAG,GAAG,+BAA+B;AAC3D;;AAIZ,SAAO;GACU;GAA0B;GAC5B;GAAsB;GAC1B;GACV;;;;;;;AAOT,SAAgB,YAAY,OAAO,eAAe;AAC9C,KAAI,CAAC,cACD,iBAAgB;AAEpB,KAAI,MAAM,QAAQ,MAAM,EAAE;AACtB,MAAI,MAAM,SAAS,KAAK,CAAC,cAAc,mBACnC,OAAM,IAAI,MAAM,sKAEyC;AAE7D,SAAO,MAAM,KAAI,MAAK,YAAY,GAAG,cAAc,CAAC,CAAC,KAAK,KAAK;;CAEnE,MAAM,MAAM,EAAE;AACd,KAAI,cAAc,gBAAgB,MAAM,eAAe,MAAM,YACzD,KAAI,KAAK,YAAY,MAAM,YAAY;AAE3C,KAAI,cAAc,iBACd,KAAI,KAAK,sEAAsE;AAEnF,KAAI,cAAc,oBAAoB;AAClC,MAAI,KAAK,SAAS,MAAM,eAAe,OAAO,MAAM,cAAc,cAAc,KAAK,MAAO,MAAM,WAAW;AAC7G,MAAI,KAAK,SAAS,MAAM,eAAe,OAAO,MAAM,cAAc,cAAc,KAAK,MAAO,MAAM,WAAW;;AAEjH,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,MAAM,QAAQ,KAAK;EACzC,MAAM,OAAO,MAAM,MAAM;AAIzB,MAAI,KAAK,aAAa,EAClB,MAAK,YAAY;AAErB,MAAI,KAAK,aAAa,EAClB,MAAK,YAAY;AAErB,MAAI,KAAK,SAAS,KAAK,WAAW,MAAM,KAAK,WACvC,OAAO,KAAK,WAAW,MAAM,KAAK,WAClC,MAAM;AACZ,OAAK,MAAM,QAAQ,KAAK,MACpB,KAAI,KAAK,KAAK;;AAGtB,QAAO,IAAI,KAAK,KAAK,GAAG;;AAE5B,SAAgB,oBAAoB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,SAAS;AACzG,KAAI,OAAO,YAAY,WACnB,WAAU,EAAE,UAAU,SAAS;AAEnC,KAAI,EAAE,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,WAAW;EACvE,MAAM,WAAW,gBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,QAAQ;AACzG,MAAI,CAAC,SACD;AAEJ,SAAO,YAAY,UAAU,YAAY,QAAQ,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,cAAc;QAEpG;EACD,MAAM,EAAE,aAAa;AACrB,kBAAgB,aAAa,aAAa,QAAQ,QAAQ,WAAW,WAAW,OAAO,OAAO,OAAO,OAAO,EAAE,EAAE,QAAQ,EAAE,EAAE,WAAU,aAAY;AAC1I,OAAI,CAAC,SACD,UAAS,OAAU;OAGnB,UAAS,YAAY,UAAU,QAAQ,cAAc,CAAC;KAE3D,CAAC,CAAC;;;;;;AASjB,SAAS,WAAW,MAAM;CACtB,MAAM,gBAAgB,KAAK,SAAS,KAAK;CACzC,MAAM,SAAS,KAAK,MAAM,KAAK,CAAC,KAAI,SAAQ,OAAO,KAAK;AACxD,KAAI,cACA,QAAO,KAAK;KAGZ,QAAO,KAAK,OAAO,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC;AAE1C,QAAO"}

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/util/string.js

@@ -1,64 +0,0 @@
-//#region ../node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/util/string.js
-function longestCommonPrefix(str1, str2) {
-	let i;
-	for (i = 0; i < str1.length && i < str2.length; i++) if (str1[i] != str2[i]) return str1.slice(0, i);
-	return str1.slice(0, i);
-}
-function longestCommonSuffix(str1, str2) {
-	let i;
-	if (!str1 || !str2 || str1[str1.length - 1] != str2[str2.length - 1]) return "";
-	for (i = 0; i < str1.length && i < str2.length; i++) if (str1[str1.length - (i + 1)] != str2[str2.length - (i + 1)]) return str1.slice(-i);
-	return str1.slice(-i);
-}
-function replacePrefix(string, oldPrefix, newPrefix) {
-	if (string.slice(0, oldPrefix.length) != oldPrefix) throw Error(`string ${JSON.stringify(string)} doesn't start with prefix ${JSON.stringify(oldPrefix)}; this is a bug`);
-	return newPrefix + string.slice(oldPrefix.length);
-}
-function replaceSuffix(string, oldSuffix, newSuffix) {
-	if (!oldSuffix) return string + newSuffix;
-	if (string.slice(-oldSuffix.length) != oldSuffix) throw Error(`string ${JSON.stringify(string)} doesn't end with suffix ${JSON.stringify(oldSuffix)}; this is a bug`);
-	return string.slice(0, -oldSuffix.length) + newSuffix;
-}
-function removePrefix(string, oldPrefix) {
-	return replacePrefix(string, oldPrefix, "");
-}
-function removeSuffix(string, oldSuffix) {
-	return replaceSuffix(string, oldSuffix, "");
-}
-function maximumOverlap(string1, string2) {
-	return string2.slice(0, overlapCount(string1, string2));
-}
-function overlapCount(a, b) {
-	let startA = 0;
-	if (a.length > b.length) startA = a.length - b.length;
-	let endB = b.length;
-	if (a.length < b.length) endB = a.length;
-	const map = Array(endB);
-	let k = 0;
-	map[0] = 0;
-	for (let j = 1; j < endB; j++) {
-		if (b[j] == b[k]) map[j] = map[k];
-		else map[j] = k;
-		while (k > 0 && b[j] != b[k]) k = map[k];
-		if (b[j] == b[k]) k++;
-	}
-	k = 0;
-	for (let i = startA; i < a.length; i++) {
-		while (k > 0 && a[i] != b[k]) k = map[k];
-		if (a[i] == b[k]) k++;
-	}
-	return k;
-}
-function trailingWs(string) {
-	let i;
-	for (i = string.length - 1; i >= 0; i--) if (!string[i].match(/\s/)) break;
-	return string.substring(i + 1);
-}
-function leadingWs(string) {
-	const match = string.match(/^\s*/);
-	return match ? match[0] : "";
-}
-
-//#endregion
-export { leadingWs, longestCommonPrefix, longestCommonSuffix, maximumOverlap, removePrefix, removeSuffix, replacePrefix, replaceSuffix, trailingWs };
-//# sourceMappingURL=string.js.map

package/dist/node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/util/string.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"string.js","names":[],"sources":["../../../../../../../../../node_modules/.pnpm/diff@8.0.3/node_modules/diff/libesm/util/string.js"],"sourcesContent":["export function longestCommonPrefix(str1, str2) {\n    let i;\n    for (i = 0; i < str1.length && i < str2.length; i++) {\n        if (str1[i] != str2[i]) {\n            return str1.slice(0, i);\n        }\n    }\n    return str1.slice(0, i);\n}\nexport function longestCommonSuffix(str1, str2) {\n    let i;\n    // Unlike longestCommonPrefix, we need a special case to handle all scenarios\n    // where we return the empty string since str1.slice(-0) will return the\n    // entire string.\n    if (!str1 || !str2 || str1[str1.length - 1] != str2[str2.length - 1]) {\n        return '';\n    }\n    for (i = 0; i < str1.length && i < str2.length; i++) {\n        if (str1[str1.length - (i + 1)] != str2[str2.length - (i + 1)]) {\n            return str1.slice(-i);\n        }\n    }\n    return str1.slice(-i);\n}\nexport function replacePrefix(string, oldPrefix, newPrefix) {\n    if (string.slice(0, oldPrefix.length) != oldPrefix) {\n        throw Error(`string ${JSON.stringify(string)} doesn't start with prefix ${JSON.stringify(oldPrefix)}; this is a bug`);\n    }\n    return newPrefix + string.slice(oldPrefix.length);\n}\nexport function replaceSuffix(string, oldSuffix, newSuffix) {\n    if (!oldSuffix) {\n        return string + newSuffix;\n    }\n    if (string.slice(-oldSuffix.length) != oldSuffix) {\n        throw Error(`string ${JSON.stringify(string)} doesn't end with suffix ${JSON.stringify(oldSuffix)}; this is a bug`);\n    }\n    return string.slice(0, -oldSuffix.length) + newSuffix;\n}\nexport function removePrefix(string, oldPrefix) {\n    return replacePrefix(string, oldPrefix, '');\n}\nexport function removeSuffix(string, oldSuffix) {\n    return replaceSuffix(string, oldSuffix, '');\n}\nexport function maximumOverlap(string1, string2) {\n    return string2.slice(0, overlapCount(string1, string2));\n}\n// Nicked from https://stackoverflow.com/a/60422853/1709587\nfunction overlapCount(a, b) {\n    // Deal with cases where the strings differ in length\n    let startA = 0;\n    if (a.length > b.length) {\n        startA = a.length - b.length;\n    }\n    let endB = b.length;\n    if (a.length < b.length) {\n        endB = a.length;\n    }\n    // Create a back-reference for each index\n    //   that should be followed in case of a mismatch.\n    //   We only need B to make these references:\n    const map = Array(endB);\n    let k = 0; // Index that lags behind j\n    map[0] = 0;\n    for (let j = 1; j < endB; j++) {\n        if (b[j] == b[k]) {\n            map[j] = map[k]; // skip over the same character (optional optimisation)\n        }\n        else {\n            map[j] = k;\n        }\n        while (k > 0 && b[j] != b[k]) {\n            k = map[k];\n        }\n        if (b[j] == b[k]) {\n            k++;\n        }\n    }\n    // Phase 2: use these references while iterating over A\n    k = 0;\n    for (let i = startA; i < a.length; i++) {\n        while (k > 0 && a[i] != b[k]) {\n            k = map[k];\n        }\n        if (a[i] == b[k]) {\n            k++;\n        }\n    }\n    return k;\n}\n/**\n * Returns true if the string consistently uses Windows line endings.\n */\nexport function hasOnlyWinLineEndings(string) {\n    return string.includes('\\r\\n') && !string.startsWith('\\n') && !string.match(/[^\\r]\\n/);\n}\n/**\n * Returns true if the string consistently uses Unix line endings.\n */\nexport function hasOnlyUnixLineEndings(string) {\n    return !string.includes('\\r\\n') && string.includes('\\n');\n}\nexport function trailingWs(string) {\n    // Yes, this looks overcomplicated and dumb - why not replace the whole function with\n    //     return string.match(/\\s*$/)[0]\n    // you ask? Because:\n    // 1. the trap described at https://markamery.com/blog/quadratic-time-regexes/ would mean doing\n    //    this would cause this function to take O(n²) time in the worst case (specifically when\n    //    there is a massive run of NON-TRAILING whitespace in `string`), and\n    // 2. the fix proposed in the same blog post, of using a negative lookbehind, is incompatible\n    //    with old Safari versions that we'd like to not break if possible (see\n    //    https://github.com/kpdecker/jsdiff/pull/550)\n    // It feels absurd to do this with an explicit loop instead of a regex, but I really can't see a\n    // better way that doesn't result in broken behaviour.\n    let i;\n    for (i = string.length - 1; i >= 0; i--) {\n        if (!string[i].match(/\\s/)) {\n            break;\n        }\n    }\n    return string.substring(i + 1);\n}\nexport function leadingWs(string) {\n    // Thankfully the annoying considerations described in trailingWs don't apply here:\n    const match = string.match(/^\\s*/);\n    return match ? match[0] : '';\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAgB,oBAAoB,MAAM,MAAM;CAC5C,IAAI;AACJ,MAAK,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ,IAC5C,KAAI,KAAK,MAAM,KAAK,GAChB,QAAO,KAAK,MAAM,GAAG,EAAE;AAG/B,QAAO,KAAK,MAAM,GAAG,EAAE;;AAE3B,SAAgB,oBAAoB,MAAM,MAAM;CAC5C,IAAI;AAIJ,KAAI,CAAC,QAAQ,CAAC,QAAQ,KAAK,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,GAC9D,QAAO;AAEX,MAAK,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,KAAK,QAAQ,IAC5C,KAAI,KAAK,KAAK,UAAU,IAAI,OAAO,KAAK,KAAK,UAAU,IAAI,IACvD,QAAO,KAAK,MAAM,CAAC,EAAE;AAG7B,QAAO,KAAK,MAAM,CAAC,EAAE;;AAEzB,SAAgB,cAAc,QAAQ,WAAW,WAAW;AACxD,KAAI,OAAO,MAAM,GAAG,UAAU,OAAO,IAAI,UACrC,OAAM,MAAM,UAAU,KAAK,UAAU,OAAO,CAAC,6BAA6B,KAAK,UAAU,UAAU,CAAC,iBAAiB;AAEzH,QAAO,YAAY,OAAO,MAAM,UAAU,OAAO;;AAErD,SAAgB,cAAc,QAAQ,WAAW,WAAW;AACxD,KAAI,CAAC,UACD,QAAO,SAAS;AAEpB,KAAI,OAAO,MAAM,CAAC,UAAU,OAAO,IAAI,UACnC,OAAM,MAAM,UAAU,KAAK,UAAU,OAAO,CAAC,2BAA2B,KAAK,UAAU,UAAU,CAAC,iBAAiB;AAEvH,QAAO,OAAO,MAAM,GAAG,CAAC,UAAU,OAAO,GAAG;;AAEhD,SAAgB,aAAa,QAAQ,WAAW;AAC5C,QAAO,cAAc,QAAQ,WAAW,GAAG;;AAE/C,SAAgB,aAAa,QAAQ,WAAW;AAC5C,QAAO,cAAc,QAAQ,WAAW,GAAG;;AAE/C,SAAgB,eAAe,SAAS,SAAS;AAC7C,QAAO,QAAQ,MAAM,GAAG,aAAa,SAAS,QAAQ,CAAC;;AAG3D,SAAS,aAAa,GAAG,GAAG;CAExB,IAAI,SAAS;AACb,KAAI,EAAE,SAAS,EAAE,OACb,UAAS,EAAE,SAAS,EAAE;CAE1B,IAAI,OAAO,EAAE;AACb,KAAI,EAAE,SAAS,EAAE,OACb,QAAO,EAAE;CAKb,MAAM,MAAM,MAAM,KAAK;CACvB,IAAI,IAAI;AACR,KAAI,KAAK;AACT,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,MAAI,EAAE,MAAM,EAAE,GACV,KAAI,KAAK,IAAI;MAGb,KAAI,KAAK;AAEb,SAAO,IAAI,KAAK,EAAE,MAAM,EAAE,GACtB,KAAI,IAAI;AAEZ,MAAI,EAAE,MAAM,EAAE,GACV;;AAIR,KAAI;AACJ,MAAK,IAAI,IAAI,QAAQ,IAAI,EAAE,QAAQ,KAAK;AACpC,SAAO,IAAI,KAAK,EAAE,MAAM,EAAE,GACtB,KAAI,IAAI;AAEZ,MAAI,EAAE,MAAM,EAAE,GACV;;AAGR,QAAO;;AAcX,SAAgB,WAAW,QAAQ;CAY/B,IAAI;AACJ,MAAK,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,IAChC,KAAI,CAAC,OAAO,GAAG,MAAM,KAAK,CACtB;AAGR,QAAO,OAAO,UAAU,IAAI,EAAE;;AAElC,SAAgB,UAAU,QAAQ;CAE9B,MAAM,QAAQ,OAAO,MAAM,OAAO;AAClC,QAAO,QAAQ,MAAM,KAAK"}