jj-plus 0.10.10

package/dist/shared/diff-stats.cjs

@@ -0,0 +1,129 @@
+const require_diff_helpers = require("./diff-helpers.cjs");
+//#region src/shared/diff-stats.ts
+function computeDiffStats(beforeText, afterText) {
+	if (require_diff_helpers.textsMatchIgnoringLineEndings(beforeText, afterText)) return {
+		additions: 0,
+		deletions: 0,
+		hunkCount: 0,
+		hasChanges: false
+	};
+	const operations = diffLineOperations({
+		beforeLines: splitIntoLines(beforeText),
+		afterLines: splitIntoLines(afterText)
+	});
+	const additions = operations.filter((operation) => operation.type === "add").length;
+	const deletions = operations.filter((operation) => operation.type === "remove").length;
+	return {
+		additions,
+		deletions,
+		hunkCount: countDiffHunks(operations),
+		hasChanges: additions > 0 || deletions > 0
+	};
+}
+function countDiffHunks(operations) {
+	let hunks = 0;
+	let inChange = false;
+	for (const operation of operations) {
+		const isChange = operation.type === "add" || operation.type === "remove";
+		if (isChange && !inChange) {
+			hunks += 1;
+			inChange = true;
+			continue;
+		}
+		if (!isChange) inChange = false;
+	}
+	return hunks;
+}
+function splitIntoLines(value) {
+	if (!value) return [];
+	const lines = value.replace(/\r\n/g, "\n").split("\n");
+	if (lines.at(-1) === "") lines.pop();
+	return lines;
+}
+function diffLineOperations(args) {
+	if (!args.beforeLines.length) return args.afterLines.map((text) => ({
+		type: "add",
+		text
+	}));
+	if (!args.afterLines.length) return args.beforeLines.map((text) => ({
+		type: "remove",
+		text
+	}));
+	if (args.beforeLines.length * args.afterLines.length > 12e5) return buildFallbackOperations(args);
+	const matrix = Array.from({ length: args.beforeLines.length + 1 }, () => new Uint32Array(args.afterLines.length + 1));
+	for (let leftIndex = args.beforeLines.length - 1; leftIndex >= 0; leftIndex -= 1) for (let rightIndex = args.afterLines.length - 1; rightIndex >= 0; rightIndex -= 1) matrix[leftIndex][rightIndex] = args.beforeLines[leftIndex] === args.afterLines[rightIndex] ? matrix[leftIndex + 1][rightIndex + 1] + 1 : Math.max(matrix[leftIndex + 1][rightIndex], matrix[leftIndex][rightIndex + 1]);
+	const operations = [];
+	let leftIndex = 0;
+	let rightIndex = 0;
+	while (leftIndex < args.beforeLines.length && rightIndex < args.afterLines.length) {
+		if (args.beforeLines[leftIndex] === args.afterLines[rightIndex]) {
+			operations.push({
+				type: "context",
+				text: args.beforeLines[leftIndex]
+			});
+			leftIndex += 1;
+			rightIndex += 1;
+			continue;
+		}
+		if (matrix[leftIndex + 1][rightIndex] >= matrix[leftIndex][rightIndex + 1]) {
+			operations.push({
+				type: "remove",
+				text: args.beforeLines[leftIndex]
+			});
+			leftIndex += 1;
+			continue;
+		}
+		operations.push({
+			type: "add",
+			text: args.afterLines[rightIndex]
+		});
+		rightIndex += 1;
+	}
+	while (leftIndex < args.beforeLines.length) {
+		operations.push({
+			type: "remove",
+			text: args.beforeLines[leftIndex]
+		});
+		leftIndex += 1;
+	}
+	while (rightIndex < args.afterLines.length) {
+		operations.push({
+			type: "add",
+			text: args.afterLines[rightIndex]
+		});
+		rightIndex += 1;
+	}
+	return operations;
+}
+function buildFallbackOperations(args) {
+	const operations = [];
+	let prefix = 0;
+	while (prefix < args.beforeLines.length && prefix < args.afterLines.length && args.beforeLines[prefix] === args.afterLines[prefix]) prefix += 1;
+	let beforeSuffix = args.beforeLines.length - 1;
+	let afterSuffix = args.afterLines.length - 1;
+	while (beforeSuffix >= prefix && afterSuffix >= prefix && args.beforeLines[beforeSuffix] === args.afterLines[afterSuffix]) {
+		beforeSuffix -= 1;
+		afterSuffix -= 1;
+	}
+	for (const text of args.beforeLines.slice(0, prefix)) operations.push({
+		type: "context",
+		text
+	});
+	for (const text of args.beforeLines.slice(prefix, beforeSuffix + 1)) operations.push({
+		type: "remove",
+		text
+	});
+	for (const text of args.afterLines.slice(prefix, afterSuffix + 1)) operations.push({
+		type: "add",
+		text
+	});
+	for (const text of args.beforeLines.slice(beforeSuffix + 1)) operations.push({
+		type: "context",
+		text
+	});
+	return operations;
+}
+//#endregion
+exports.computeDiffStats = computeDiffStats;
+
+//# sourceMappingURL=diff-stats.cjs.map

package/dist/shared/diff-stats.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff-stats.cjs","names":["textsMatchIgnoringLineEndings"],"sources":["../../src/shared/diff-stats.ts"],"sourcesContent":["import { textsMatchIgnoringLineEndings } from './diff-helpers.ts';\n\nexport type DiffStats = {\n\tadditions: number;\n\tdeletions: number;\n\thunkCount: number;\n\thasChanges: boolean;\n};\n\ntype DiffOperation = { type: 'context' | 'add' | 'remove'; text: string };\n\nexport function computeDiffStats(beforeText: string, afterText: string): DiffStats {\n\tif (textsMatchIgnoringLineEndings(beforeText, afterText)) {\n\t\treturn { additions: 0, deletions: 0, hunkCount: 0, hasChanges: false };\n\t}\n\n\tconst operations = diffLineOperations({\n\t\tbeforeLines: splitIntoLines(beforeText),\n\t\tafterLines: splitIntoLines(afterText),\n\t});\n\tconst additions = operations.filter((operation) => operation.type === 'add').length;\n\tconst deletions = operations.filter((operation) => operation.type === 'remove').length;\n\treturn {\n\t\tadditions,\n\t\tdeletions,\n\t\thunkCount: countDiffHunks(operations),\n\t\thasChanges: additions > 0 || deletions > 0,\n\t};\n}\n\nfunction countDiffHunks(operations: DiffOperation[]): number {\n\tlet hunks = 0;\n\tlet inChange = false;\n\n\tfor (const operation of operations) {\n\t\tconst isChange = operation.type === 'add' || operation.type === 'remove';\n\t\tif (isChange && !inChange) {\n\t\t\thunks += 1;\n\t\t\tinChange = true;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!isChange) {\n\t\t\tinChange = false;\n\t\t}\n\t}\n\n\treturn hunks;\n}\n\nfunction splitIntoLines(value: string): string[] {\n\tif (!value) {\n\t\treturn [];\n\t}\n\n\tconst normalized = value.replace(/\\r\\n/g, '\\n');\n\tconst lines = normalized.split('\\n');\n\tif (lines.at(-1) === '') {\n\t\tlines.pop();\n\t}\n\treturn lines;\n}\n\nfunction diffLineOperations(args: { beforeLines: string[]; afterLines: string[] }): DiffOperation[] {\n\tif (!args.beforeLines.length) {\n\t\treturn args.afterLines.map((text) => ({ type: 'add' as const, text }));\n\t}\n\n\tif (!args.afterLines.length) {\n\t\treturn args.beforeLines.map((text) => ({ type: 'remove' as const, text }));\n\t}\n\n\tif (args.beforeLines.length * args.afterLines.length > 1_200_000) {\n\t\treturn buildFallbackOperations(args);\n\t}\n\n\tconst matrix = Array.from({ length: args.beforeLines.length + 1 }, () => new Uint32Array(args.afterLines.length + 1));\n\n\tfor (let leftIndex = args.beforeLines.length - 1; leftIndex >= 0; leftIndex -= 1) {\n\t\tfor (let rightIndex = args.afterLines.length - 1; rightIndex >= 0; rightIndex -= 1) {\n\t\t\tmatrix[leftIndex][rightIndex] =\n\t\t\t\targs.beforeLines[leftIndex] === args.afterLines[rightIndex]\n\t\t\t\t\t? matrix[leftIndex + 1][rightIndex + 1] + 1\n\t\t\t\t\t: Math.max(matrix[leftIndex + 1][rightIndex], matrix[leftIndex][rightIndex + 1]);\n\t\t}\n\t}\n\n\tconst operations: DiffOperation[] = [];\n\tlet leftIndex = 0;\n\tlet rightIndex = 0;\n\n\twhile (leftIndex < args.beforeLines.length && rightIndex < args.afterLines.length) {\n\t\tif (args.beforeLines[leftIndex] === args.afterLines[rightIndex]) {\n\t\t\toperations.push({ type: 'context', text: args.beforeLines[leftIndex] });\n\t\t\tleftIndex += 1;\n\t\t\trightIndex += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (matrix[leftIndex + 1][rightIndex] >= matrix[leftIndex][rightIndex + 1]) {\n\t\t\toperations.push({ type: 'remove', text: args.beforeLines[leftIndex] });\n\t\t\tleftIndex += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\toperations.push({ type: 'add', text: args.afterLines[rightIndex] });\n\t\trightIndex += 1;\n\t}\n\n\twhile (leftIndex < args.beforeLines.length) {\n\t\toperations.push({ type: 'remove', text: args.beforeLines[leftIndex] });\n\t\tleftIndex += 1;\n\t}\n\n\twhile (rightIndex < args.afterLines.length) {\n\t\toperations.push({ type: 'add', text: args.afterLines[rightIndex] });\n\t\trightIndex += 1;\n\t}\n\n\treturn operations;\n}\n\nfunction buildFallbackOperations(args: { beforeLines: string[]; afterLines: string[] }): DiffOperation[] {\n\tconst operations: DiffOperation[] = [];\n\tlet prefix = 0;\n\twhile (\n\t\tprefix < args.beforeLines.length &&\n\t\tprefix < args.afterLines.length &&\n\t\targs.beforeLines[prefix] === args.afterLines[prefix]\n\t) {\n\t\tprefix += 1;\n\t}\n\n\tlet beforeSuffix = args.beforeLines.length - 1;\n\tlet afterSuffix = args.afterLines.length - 1;\n\twhile (\n\t\tbeforeSuffix >= prefix &&\n\t\tafterSuffix >= prefix &&\n\t\targs.beforeLines[beforeSuffix] === args.afterLines[afterSuffix]\n\t) {\n\t\tbeforeSuffix -= 1;\n\t\tafterSuffix -= 1;\n\t}\n\n\tfor (const text of args.beforeLines.slice(0, prefix)) {\n\t\toperations.push({ type: 'context', text });\n\t}\n\tfor (const text of args.beforeLines.slice(prefix, beforeSuffix + 1)) {\n\t\toperations.push({ type: 'remove', text });\n\t}\n\tfor (const text of args.afterLines.slice(prefix, afterSuffix + 1)) {\n\t\toperations.push({ type: 'add', text });\n\t}\n\tfor (const text of args.beforeLines.slice(beforeSuffix + 1)) {\n\t\toperations.push({ type: 'context', text });\n\t}\n\n\treturn operations;\n}\n"],"mappings":";;AAWA,SAAgB,iBAAiB,YAAoB,WAA8B;CAClF,IAAIA,qBAAAA,8BAA8B,YAAY,SAAS,GACtD,OAAO;EAAE,WAAW;EAAG,WAAW;EAAG,WAAW;EAAG,YAAY;CAAM;CAGtE,MAAM,aAAa,mBAAmB;EACrC,aAAa,eAAe,UAAU;EACtC,YAAY,eAAe,SAAS;CACrC,CAAC;CACD,MAAM,YAAY,WAAW,QAAQ,cAAc,UAAU,SAAS,KAAK,CAAC,CAAC;CAC7E,MAAM,YAAY,WAAW,QAAQ,cAAc,UAAU,SAAS,QAAQ,CAAC,CAAC;CAChF,OAAO;EACN;EACA;EACA,WAAW,eAAe,UAAU;EACpC,YAAY,YAAY,KAAK,YAAY;CAC1C;AACD;AAEA,SAAS,eAAe,YAAqC;CAC5D,IAAI,QAAQ;CACZ,IAAI,WAAW;CAEf,KAAK,MAAM,aAAa,YAAY;EACnC,MAAM,WAAW,UAAU,SAAS,SAAS,UAAU,SAAS;EAChE,IAAI,YAAY,CAAC,UAAU;GAC1B,SAAS;GACT,WAAW;GACX;EACD;EAEA,IAAI,CAAC,UACJ,WAAW;CAEb;CAEA,OAAO;AACR;AAEA,SAAS,eAAe,OAAyB;CAChD,IAAI,CAAC,OACJ,OAAO,CAAC;CAIT,MAAM,QADa,MAAM,QAAQ,SAAS,IACnB,CAAC,CAAC,MAAM,IAAI;CACnC,IAAI,MAAM,GAAG,EAAE,MAAM,IACpB,MAAM,IAAI;CAEX,OAAO;AACR;AAEA,SAAS,mBAAmB,MAAwE;CACnG,IAAI,CAAC,KAAK,YAAY,QACrB,OAAO,KAAK,WAAW,KAAK,UAAU;EAAE,MAAM;EAAgB;CAAK,EAAE;CAGtE,IAAI,CAAC,KAAK,WAAW,QACpB,OAAO,KAAK,YAAY,KAAK,UAAU;EAAE,MAAM;EAAmB;CAAK,EAAE;CAG1E,IAAI,KAAK,YAAY,SAAS,KAAK,WAAW,SAAS,MACtD,OAAO,wBAAwB,IAAI;CAGpC,MAAM,SAAS,MAAM,KAAK,EAAE,QAAQ,KAAK,YAAY,SAAS,EAAE,SAAS,IAAI,YAAY,KAAK,WAAW,SAAS,CAAC,CAAC;CAEpH,KAAK,IAAI,YAAY,KAAK,YAAY,SAAS,GAAG,aAAa,GAAG,aAAa,GAC9E,KAAK,IAAI,aAAa,KAAK,WAAW,SAAS,GAAG,cAAc,GAAG,cAAc,GAChF,OAAO,UAAU,CAAC,cACjB,KAAK,YAAY,eAAe,KAAK,WAAW,cAC7C,OAAO,YAAY,EAAE,CAAC,aAAa,KAAK,IACxC,KAAK,IAAI,OAAO,YAAY,EAAE,CAAC,aAAa,OAAO,UAAU,CAAC,aAAa,EAAE;CAInF,MAAM,aAA8B,CAAC;CACrC,IAAI,YAAY;CAChB,IAAI,aAAa;CAEjB,OAAO,YAAY,KAAK,YAAY,UAAU,aAAa,KAAK,WAAW,QAAQ;EAClF,IAAI,KAAK,YAAY,eAAe,KAAK,WAAW,aAAa;GAChE,WAAW,KAAK;IAAE,MAAM;IAAW,MAAM,KAAK,YAAY;GAAW,CAAC;GACtE,aAAa;GACb,cAAc;GACd;EACD;EAEA,IAAI,OAAO,YAAY,EAAE,CAAC,eAAe,OAAO,UAAU,CAAC,aAAa,IAAI;GAC3E,WAAW,KAAK;IAAE,MAAM;IAAU,MAAM,KAAK,YAAY;GAAW,CAAC;GACrE,aAAa;GACb;EACD;EAEA,WAAW,KAAK;GAAE,MAAM;GAAO,MAAM,KAAK,WAAW;EAAY,CAAC;EAClE,cAAc;CACf;CAEA,OAAO,YAAY,KAAK,YAAY,QAAQ;EAC3C,WAAW,KAAK;GAAE,MAAM;GAAU,MAAM,KAAK,YAAY;EAAW,CAAC;EACrE,aAAa;CACd;CAEA,OAAO,aAAa,KAAK,WAAW,QAAQ;EAC3C,WAAW,KAAK;GAAE,MAAM;GAAO,MAAM,KAAK,WAAW;EAAY,CAAC;EAClE,cAAc;CACf;CAEA,OAAO;AACR;AAEA,SAAS,wBAAwB,MAAwE;CACxG,MAAM,aAA8B,CAAC;CACrC,IAAI,SAAS;CACb,OACC,SAAS,KAAK,YAAY,UAC1B,SAAS,KAAK,WAAW,UACzB,KAAK,YAAY,YAAY,KAAK,WAAW,SAE7C,UAAU;CAGX,IAAI,eAAe,KAAK,YAAY,SAAS;CAC7C,IAAI,cAAc,KAAK,WAAW,SAAS;CAC3C,OACC,gBAAgB,UAChB,eAAe,UACf,KAAK,YAAY,kBAAkB,KAAK,WAAW,cAClD;EACD,gBAAgB;EAChB,eAAe;CAChB;CAEA,KAAK,MAAM,QAAQ,KAAK,YAAY,MAAM,GAAG,MAAM,GAClD,WAAW,KAAK;EAAE,MAAM;EAAW;CAAK,CAAC;CAE1C,KAAK,MAAM,QAAQ,KAAK,YAAY,MAAM,QAAQ,eAAe,CAAC,GACjE,WAAW,KAAK;EAAE,MAAM;EAAU;CAAK,CAAC;CAEzC,KAAK,MAAM,QAAQ,KAAK,WAAW,MAAM,QAAQ,cAAc,CAAC,GAC/D,WAAW,KAAK;EAAE,MAAM;EAAO;CAAK,CAAC;CAEtC,KAAK,MAAM,QAAQ,KAAK,YAAY,MAAM,eAAe,CAAC,GACzD,WAAW,KAAK;EAAE,MAAM;EAAW;CAAK,CAAC;CAG1C,OAAO;AACR"}

package/dist/shared/file-oplog.cjs

@@ -0,0 +1,82 @@
+//#region src/shared/file-oplog.ts
+function parseJjOpLogLine(line) {
+	const [operationId = "", description = "", authorDate = ""] = line.split("	");
+	const id = operationId.trim();
+	if (!id) return null;
+	return {
+		operationId: id,
+		description: description.trim() || "Operation",
+		authorDate: authorDate.trim() || void 0
+	};
+}
+function parseJjOpLogOutput(output) {
+	const seen = /* @__PURE__ */ new Set();
+	const entries = [];
+	for (const raw of output.split(/\r?\n/u)) {
+		const line = raw.trim();
+		if (!line) continue;
+		const parsed = parseJjOpLogLine(line);
+		if (!parsed || seen.has(parsed.operationId)) continue;
+		seen.add(parsed.operationId);
+		entries.push(parsed);
+	}
+	return entries;
+}
+/** Prefer longer prefix matches so short op ids still link. */
+function findEntryForOperation(entries, operationId) {
+	const needle = operationId.toLowerCase();
+	let best;
+	let bestLen = -1;
+	for (const entry of entries) {
+		const id = (entry.operationId || "").toLowerCase();
+		if (!id) continue;
+		if (id === needle || id.startsWith(needle) || needle.startsWith(id)) {
+			const len = Math.min(id.length, needle.length);
+			if (len > bestLen) {
+				best = entry;
+				bestLen = len;
+			}
+		}
+	}
+	return best;
+}
+/**
+* Keep recent ops that touched the file (linked via known snapshot/revision ops),
+* or whose description mentions the relative path.
+*/
+function filterFileOpLogPeek(args) {
+	const limit = args.limit ?? 12;
+	const pathNeedle = args.relativePath.trim().toLowerCase();
+	const fileName = pathNeedle.includes("/") ? pathNeedle.slice(pathNeedle.lastIndexOf("/") + 1) : pathNeedle;
+	const result = [];
+	for (const op of args.opLog) {
+		const linked = findEntryForOperation(args.fileEntries, op.operationId);
+		const desc = op.description.toLowerCase();
+		const pathHit = Boolean(pathNeedle) && (desc.includes(pathNeedle) || fileName.length > 2 && desc.includes(fileName));
+		if (!linked && !pathHit) continue;
+		result.push({
+			...op,
+			entryIndex: linked?.index,
+			changeId: linked?.changeId,
+			operationIndex: linked?.operationIndex,
+			description: op.description || linked?.description || "Operation"
+		});
+		if (result.length >= limit) break;
+	}
+	return result;
+}
+const JJ_OP_LOG_TEMPLATE = [
+	"self.id().short(12)",
+	"\"\\t\"",
+	"description.first_line()",
+	"\"\\t\"",
+	"time.end().local().format(\"%Y-%m-%dT%H:%M:%S\")",
+	"\"\\n\""
+].join(" ++ ");
+//#endregion
+exports.JJ_OP_LOG_TEMPLATE = JJ_OP_LOG_TEMPLATE;
+exports.filterFileOpLogPeek = filterFileOpLogPeek;
+exports.parseJjOpLogLine = parseJjOpLogLine;
+exports.parseJjOpLogOutput = parseJjOpLogOutput;
+
+//# sourceMappingURL=file-oplog.cjs.map

package/dist/shared/file-oplog.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-oplog.cjs","names":[],"sources":["../../src/shared/file-oplog.ts"],"sourcesContent":["import type { FileRevisionEntry } from './timeline-types.ts';\n\nexport type FileOpLogEntry = {\n\toperationId: string;\n\tdescription: string;\n\tauthorDate?: string;\n\t/** Snapshot/revision entry index to jump to when present. */\n\tentryIndex?: number;\n\tchangeId?: string;\n\toperationIndex?: number;\n};\n\nexport function parseJjOpLogLine(line: string): FileOpLogEntry | null {\n\tconst [operationId = '', description = '', authorDate = ''] = line.split('\\t');\n\tconst id = operationId.trim();\n\tif (!id) {\n\t\treturn null;\n\t}\n\treturn {\n\t\toperationId: id,\n\t\tdescription: description.trim() || 'Operation',\n\t\tauthorDate: authorDate.trim() || undefined,\n\t};\n}\n\nexport function parseJjOpLogOutput(output: string): FileOpLogEntry[] {\n\tconst seen = new Set<string>();\n\tconst entries: FileOpLogEntry[] = [];\n\tfor (const raw of output.split(/\\r?\\n/u)) {\n\t\tconst line = raw.trim();\n\t\tif (!line) {\n\t\t\tcontinue;\n\t\t}\n\t\tconst parsed = parseJjOpLogLine(line);\n\t\tif (!parsed || seen.has(parsed.operationId)) {\n\t\t\tcontinue;\n\t\t}\n\t\tseen.add(parsed.operationId);\n\t\tentries.push(parsed);\n\t}\n\treturn entries;\n}\n\n/** Prefer longer prefix matches so short op ids still link. */\nfunction findEntryForOperation(\n\tentries: ReadonlyArray<FileRevisionEntry>,\n\toperationId: string,\n): FileRevisionEntry | undefined {\n\tconst needle = operationId.toLowerCase();\n\tlet best: FileRevisionEntry | undefined;\n\tlet bestLen = -1;\n\tfor (const entry of entries) {\n\t\tconst id = (entry.operationId || '').toLowerCase();\n\t\tif (!id) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (id === needle || id.startsWith(needle) || needle.startsWith(id)) {\n\t\t\tconst len = Math.min(id.length, needle.length);\n\t\t\tif (len > bestLen) {\n\t\t\t\tbest = entry;\n\t\t\t\tbestLen = len;\n\t\t\t}\n\t\t}\n\t}\n\treturn best;\n}\n\n/**\n * Keep recent ops that touched the file (linked via known snapshot/revision ops),\n * or whose description mentions the relative path.\n */\nexport function filterFileOpLogPeek(args: {\n\topLog: ReadonlyArray<FileOpLogEntry>;\n\tfileEntries: ReadonlyArray<FileRevisionEntry>;\n\trelativePath: string;\n\tlimit?: number;\n}): FileOpLogEntry[] {\n\tconst limit = args.limit ?? 12;\n\tconst pathNeedle = args.relativePath.trim().toLowerCase();\n\tconst fileName = pathNeedle.includes('/') ? pathNeedle.slice(pathNeedle.lastIndexOf('/') + 1) : pathNeedle;\n\tconst result: FileOpLogEntry[] = [];\n\n\tfor (const op of args.opLog) {\n\t\tconst linked = findEntryForOperation(args.fileEntries, op.operationId);\n\t\tconst desc = op.description.toLowerCase();\n\t\tconst pathHit =\n\t\t\tBoolean(pathNeedle) && (desc.includes(pathNeedle) || (fileName.length > 2 && desc.includes(fileName)));\n\t\tif (!linked && !pathHit) {\n\t\t\tcontinue;\n\t\t}\n\t\tresult.push({\n\t\t\t...op,\n\t\t\tentryIndex: linked?.index,\n\t\t\tchangeId: linked?.changeId,\n\t\t\toperationIndex: linked?.operationIndex,\n\t\t\tdescription: op.description || linked?.description || 'Operation',\n\t\t});\n\t\tif (result.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn result;\n}\n\nexport const JJ_OP_LOG_TEMPLATE = [\n\t'self.id().short(12)',\n\t'\"\\\\t\"',\n\t'description.first_line()',\n\t'\"\\\\t\"',\n\t'time.end().local().format(\"%Y-%m-%dT%H:%M:%S\")',\n\t'\"\\\\n\"',\n].join(' ++ ');\n"],"mappings":";AAYA,SAAgB,iBAAiB,MAAqC;CACrE,MAAM,CAAC,cAAc,IAAI,cAAc,IAAI,aAAa,MAAM,KAAK,MAAM,GAAI;CAC7E,MAAM,KAAK,YAAY,KAAK;CAC5B,IAAI,CAAC,IACJ,OAAO;CAER,OAAO;EACN,aAAa;EACb,aAAa,YAAY,KAAK,KAAK;EACnC,YAAY,WAAW,KAAK,KAAK,KAAA;CAClC;AACD;AAEA,SAAgB,mBAAmB,QAAkC;CACpE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,UAA4B,CAAC;CACnC,KAAK,MAAM,OAAO,OAAO,MAAM,QAAQ,GAAG;EACzC,MAAM,OAAO,IAAI,KAAK;EACtB,IAAI,CAAC,MACJ;EAED,MAAM,SAAS,iBAAiB,IAAI;EACpC,IAAI,CAAC,UAAU,KAAK,IAAI,OAAO,WAAW,GACzC;EAED,KAAK,IAAI,OAAO,WAAW;EAC3B,QAAQ,KAAK,MAAM;CACpB;CACA,OAAO;AACR;;AAGA,SAAS,sBACR,SACA,aACgC;CAChC,MAAM,SAAS,YAAY,YAAY;CACvC,IAAI;CACJ,IAAI,UAAU;CACd,KAAK,MAAM,SAAS,SAAS;EAC5B,MAAM,MAAM,MAAM,eAAe,GAAA,CAAI,YAAY;EACjD,IAAI,CAAC,IACJ;EAED,IAAI,OAAO,UAAU,GAAG,WAAW,MAAM,KAAK,OAAO,WAAW,EAAE,GAAG;GACpE,MAAM,MAAM,KAAK,IAAI,GAAG,QAAQ,OAAO,MAAM;GAC7C,IAAI,MAAM,SAAS;IAClB,OAAO;IACP,UAAU;GACX;EACD;CACD;CACA,OAAO;AACR;;;;;AAMA,SAAgB,oBAAoB,MAKf;CACpB,MAAM,QAAQ,KAAK,SAAS;CAC5B,MAAM,aAAa,KAAK,aAAa,KAAK,CAAC,CAAC,YAAY;CACxD,MAAM,WAAW,WAAW,SAAS,GAAG,IAAI,WAAW,MAAM,WAAW,YAAY,GAAG,IAAI,CAAC,IAAI;CAChG,MAAM,SAA2B,CAAC;CAElC,KAAK,MAAM,MAAM,KAAK,OAAO;EAC5B,MAAM,SAAS,sBAAsB,KAAK,aAAa,GAAG,WAAW;EACrE,MAAM,OAAO,GAAG,YAAY,YAAY;EACxC,MAAM,UACL,QAAQ,UAAU,MAAM,KAAK,SAAS,UAAU,KAAM,SAAS,SAAS,KAAK,KAAK,SAAS,QAAQ;EACpG,IAAI,CAAC,UAAU,CAAC,SACf;EAED,OAAO,KAAK;GACX,GAAG;GACH,YAAY,QAAQ;GACpB,UAAU,QAAQ;GAClB,gBAAgB,QAAQ;GACxB,aAAa,GAAG,eAAe,QAAQ,eAAe;EACvD,CAAC;EACD,IAAI,OAAO,UAAU,OACpB;CAEF;CACA,OAAO;AACR;AAEA,MAAa,qBAAqB;CACjC;CACA;CACA;CACA;CACA;CACA;AACD,CAAC,CAAC,KAAK,MAAM"}

package/dist/shared/history-helpers.cjs

@@ -0,0 +1,257 @@
+const require_runtime = require("../_virtual/_rolldown/runtime.cjs");
+let node_path = require("node:path");
+node_path = require_runtime.__toESM(node_path, 1);
+//#region src/shared/history-helpers.ts
+function parseMarkerNames(rawValue) {
+	const names = rawValue.split(",").map((value) => value.trim()).filter(Boolean);
+	return names.length ? [...new Set(names)] : void 0;
+}
+function parseGitBranchNames(decorations) {
+	const names = decorations.split(",").map((value) => value.trim()).flatMap((value) => {
+		if (!value || value === "HEAD" || value.startsWith("tag: ")) return [];
+		const [left, right] = value.split("->").map((part) => part.trim());
+		if (right) return right === "HEAD" ? [] : [right];
+		return left ? [left] : [];
+	}).filter(Boolean);
+	return names.length ? [...new Set(names)] : void 0;
+}
+function parseJjSummaryRenameLines(output) {
+	return output.split(/\r?\n/u).map((line) => line.trim()).filter(Boolean).reduce((entries, line) => {
+		const match = /^R\s+(.+?)\s+=>\s+(.+)$/u.exec(line);
+		if (!match) return entries;
+		const fromPath = match[1].trim();
+		const toPath = match[2].trim();
+		const braceStart = fromPath.indexOf("{");
+		const braceEnd = toPath.lastIndexOf("}");
+		if (braceStart >= 0 && braceEnd >= 0) {
+			const prefix = fromPath.slice(0, braceStart);
+			const fromSuffix = fromPath.slice(braceStart + 1);
+			const toPrefix = toPath.slice(0, braceEnd);
+			const suffix = toPath.slice(braceEnd + 1);
+			entries.push({
+				fromPath: `${prefix}${fromSuffix}${suffix}`,
+				toPath: `${prefix}${toPrefix}${suffix}`
+			});
+			return entries;
+		}
+		entries.push({
+			fromPath,
+			toPath
+		});
+		return entries;
+	}, []);
+}
+function parseJjEvolutionSummaryHeader(line) {
+	const tokens = line.trim().split(/\s+/u);
+	if (tokens.length < 5) return null;
+	const dateIndex = tokens.findIndex((token) => /^\d{4}-\d{2}-\d{2}$/u.test(token));
+	if (dateIndex < 2 || dateIndex + 2 >= tokens.length) return null;
+	const timeToken = tokens[dateIndex + 1];
+	if (!/^\d{2}:\d{2}:\d{2}$/u.test(timeToken)) return null;
+	const revisionIndex = tokens.findLastIndex((token) => /^[0-9a-f]{8,}$/u.test(token));
+	if (revisionIndex <= dateIndex + 1) return null;
+	const changeKey = tokens[0];
+	const [changeId = "", operationIndexRaw = ""] = changeKey.split("/");
+	const operationIndex = Number.parseInt(operationIndexRaw, 10);
+	const bookmarkNames = tokens.slice(dateIndex + 2, revisionIndex).filter(Boolean);
+	return {
+		changeKey,
+		changeId: changeId || void 0,
+		operationIndex: Number.isInteger(operationIndex) ? operationIndex : void 0,
+		...bookmarkNames.length ? { bookmarkNames } : {},
+		authorDate: `${tokens[dateIndex]}T${timeToken}`,
+		authorName: tokens.slice(1, dateIndex).join(" ") || "Unknown author",
+		revision: tokens[revisionIndex] || ""
+	};
+}
+function normalizeSnapshotOperationKey(changeKey) {
+	const trimmed = String(changeKey || "").trim();
+	if (!trimmed) return;
+	return trimmed.includes("/") ? trimmed : `${trimmed}/0`;
+}
+function toJjRootFileFileset(relativePath) {
+	return `root-file:${JSON.stringify(relativePath)}`;
+}
+function resolvePreferredHistoryBackend(args) {
+	const workspacePath = normalizeFilesystemPath(args.workspacePath);
+	const gitRoot = normalizeCandidateRoot(args.gitRoot, workspacePath);
+	const jjRoot = normalizeCandidateRoot(args.jjRoot, workspacePath);
+	if (gitRoot && jjRoot) {
+		if (gitRoot === jjRoot) return "jj";
+		if (isPathWithinRoot({
+			candidatePath: gitRoot,
+			rootPath: jjRoot
+		})) return "git";
+		if (isPathWithinRoot({
+			candidatePath: jjRoot,
+			rootPath: gitRoot
+		})) return "jj";
+		return gitRoot.length >= jjRoot.length ? "git" : "jj";
+	}
+	if (jjRoot) return "jj";
+	if (gitRoot) return "git";
+}
+function normalizeCandidateRoot(root, workspacePath) {
+	const trimmed = String(root || "").trim();
+	if (!trimmed) return;
+	const normalizedRoot = normalizeFilesystemPath(trimmed);
+	return isPathWithinRoot({
+		candidatePath: workspacePath,
+		rootPath: normalizedRoot
+	}) ? normalizedRoot : void 0;
+}
+function normalizeFilesystemPath(value) {
+	return node_path.default.resolve(value.trim());
+}
+function isPathWithinRoot(args) {
+	const relativePath = node_path.default.relative(args.rootPath, args.candidatePath);
+	return relativePath === "" || !relativePath.startsWith("..") && !node_path.default.isAbsolute(relativePath);
+}
+function parseJjEvolutionSummaryEntries(output) {
+	const lines = output.split(/\r?\n/u);
+	const entries = [];
+	let current = null;
+	let descriptionCaptured = false;
+	const pushCurrent = () => {
+		if (!current) return;
+		entries.push(current);
+		current = null;
+		descriptionCaptured = false;
+	};
+	for (const rawLine of lines) {
+		const line = rawLine.trim();
+		if (!line) continue;
+		const header = parseJjEvolutionSummaryHeader(line);
+		if (header) {
+			pushCurrent();
+			current = {
+				...header,
+				description: "Snapshot",
+				operationId: void 0,
+				operationDescription: "snapshot working copy",
+				summaryLines: []
+			};
+			continue;
+		}
+		if (!current) continue;
+		if (!descriptionCaptured) {
+			current.description = line;
+			descriptionCaptured = true;
+			continue;
+		}
+		const operationMatch = /^-- operation ([0-9a-f]+)\s*(.*)$/u.exec(line);
+		if (operationMatch) {
+			current.operationId = operationMatch[1] || void 0;
+			current.operationDescription = operationMatch[2] || "snapshot working copy";
+			continue;
+		}
+		current.summaryLines.push(line);
+	}
+	pushCurrent();
+	return entries;
+}
+function parseJjBookmarkNames(rawValue) {
+	return parseMarkerNames(rawValue);
+}
+/** jj template prints `true`/`false` for empty/conflict/immutable. */
+function parseJjBooleanFlag(rawValue) {
+	const value = (rawValue || "").trim().toLowerCase();
+	return value === "true" || value === "1" || value === "yes";
+}
+/**
+* Shared jj log template fields for file/repo history lines:
+* revision, changeId, date, author, bookmarks, empty, conflict, immutable, description
+*/
+function buildJjHistoryLogTemplate() {
+	return [
+		"commit_id.short()",
+		"\"\\t\"",
+		"change_id.shortest()",
+		"\"\\t\"",
+		"author.timestamp().format(\"%Y-%m-%dT%H:%M:%S%:z\")",
+		"\"\\t\"",
+		"author.name()",
+		"\"\\t\"",
+		"self.local_bookmarks().map(|b| b.name()).join(\",\")",
+		"\"\\t\"",
+		"if(empty, \"true\", \"false\")",
+		"\"\\t\"",
+		"if(conflict, \"true\", \"false\")",
+		"\"\\t\"",
+		"if(immutable, \"true\", \"false\")",
+		"\"\\t\"",
+		"description.first_line()",
+		"\"\\n\""
+	].join(" ++ ");
+}
+function parseJjHistoryLine(line) {
+	const parts = line.split("	");
+	const revision = parts[0] || "";
+	const changeId = parts[1] || "";
+	const authorDate = parts[2] || "";
+	const authorName = parts[3] || "";
+	const bookmarkNames = parts[4] || "";
+	const looksLikeFlags = parts.length >= 8 && /^(true|false|0|1)$/iu.test((parts[5] || "").trim()) && /^(true|false|0|1)$/iu.test((parts[6] || "").trim()) && /^(true|false|0|1)$/iu.test((parts[7] || "").trim());
+	const isEmpty = looksLikeFlags ? parseJjBooleanFlag(parts[5]) : void 0;
+	const hasConflict = looksLikeFlags ? parseJjBooleanFlag(parts[6]) : void 0;
+	const isImmutable = looksLikeFlags ? parseJjBooleanFlag(parts[7]) : void 0;
+	const description = looksLikeFlags ? parts.slice(8).join("	") : parts.slice(5).join("	");
+	return {
+		id: revision,
+		revision,
+		shortRevision: changeId || revision.slice(0, 8),
+		changeId: changeId || void 0,
+		bookmarkNames: parseJjBookmarkNames(bookmarkNames),
+		authorDate,
+		authorName: authorName || "Unknown author",
+		description: description || "No description",
+		isWorkingTree: false,
+		touchesFile: true,
+		timestamp: Date.parse(authorDate) || 0,
+		...isEmpty ? { isEmpty: true } : {},
+		...hasConflict ? { hasConflict: true } : {},
+		...isImmutable ? { isImmutable: true } : {}
+	};
+}
+function parseJjSummaryChangedPaths(summaryLines) {
+	const lines = Array.isArray(summaryLines) ? summaryLines : String(summaryLines || "").split(/\r?\n/u);
+	const renamePaths = parseJjSummaryRenameLines(lines.join("\n")).flatMap((entry) => [entry.fromPath, entry.toPath]);
+	const directPaths = lines.reduce((paths, rawLine) => {
+		const line = rawLine.trim();
+		if (!line || /^R\s+/u.test(line)) return paths;
+		const match = /^[A-Z?]\s+(.+)$/u.exec(line);
+		if (match) paths.push(match[1].trim());
+		return paths;
+	}, []);
+	return [.../* @__PURE__ */ new Set([...directPaths, ...renamePaths])];
+}
+function getGitHubRemoteBaseUrl(remote) {
+	const trimmed = remote.trim();
+	if (!trimmed) return;
+	const httpsMatch = /^https?:\/\/github\.com\/([^/]+)\/([^/]+?)(?:\.git)?$/u.exec(trimmed);
+	if (httpsMatch) return `https://github.com/${httpsMatch[1]}/${httpsMatch[2]}`;
+	const sshMatch = /^(?:ssh:\/\/)?git@github\.com[:/]([^/]+)\/([^/]+?)(?:\.git)?$/u.exec(trimmed);
+	if (sshMatch) return `https://github.com/${sshMatch[1]}/${sshMatch[2]}`;
+}
+function dedupeAdjacentEntriesByChangeId(entries) {
+	return entries.filter((entry, index) => {
+		if (!entry.changeId || index === 0) return true;
+		return entries[index - 1]?.changeId !== entry.changeId;
+	});
+}
+//#endregion
+exports.buildJjHistoryLogTemplate = buildJjHistoryLogTemplate;
+exports.dedupeAdjacentEntriesByChangeId = dedupeAdjacentEntriesByChangeId;
+exports.getGitHubRemoteBaseUrl = getGitHubRemoteBaseUrl;
+exports.normalizeSnapshotOperationKey = normalizeSnapshotOperationKey;
+exports.parseGitBranchNames = parseGitBranchNames;
+exports.parseJjBookmarkNames = parseJjBookmarkNames;
+exports.parseJjBooleanFlag = parseJjBooleanFlag;
+exports.parseJjEvolutionSummaryEntries = parseJjEvolutionSummaryEntries;
+exports.parseJjHistoryLine = parseJjHistoryLine;
+exports.parseJjSummaryChangedPaths = parseJjSummaryChangedPaths;
+exports.parseJjSummaryRenameLines = parseJjSummaryRenameLines;
+exports.resolvePreferredHistoryBackend = resolvePreferredHistoryBackend;
+exports.toJjRootFileFileset = toJjRootFileFileset;
+
+//# sourceMappingURL=history-helpers.cjs.map

package/dist/shared/history-helpers.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"history-helpers.cjs","names":["path"],"sources":["../../src/shared/history-helpers.ts"],"sourcesContent":["import path from 'node:path';\n\nimport type { FileRevisionEntry } from './timeline-types.ts';\n\ntype RenameEntry = {\n\tfromPath: string;\n\ttoPath: string;\n};\n\ntype ParsedEvolutionLine = {\n\trevision: string;\n\tchangeId?: string;\n\tauthorDate: string;\n\tauthorName: string;\n\tdescription: string;\n\toperationDescription: string;\n};\n\ntype ParsedEvolutionSummaryEntry = {\n\tchangeKey: string;\n\tchangeId?: string;\n\toperationIndex?: number;\n\tbookmarkNames?: string[];\n\tauthorDate: string;\n\tauthorName: string;\n\trevision: string;\n\tdescription: string;\n\toperationId?: string;\n\toperationDescription: string;\n\tsummaryLines: string[];\n};\n\ntype ParsedEvolutionSummaryHeader = {\n\tchangeKey: string;\n\tchangeId?: string;\n\toperationIndex?: number;\n\tbookmarkNames?: string[];\n\tauthorDate: string;\n\tauthorName: string;\n\trevision: string;\n};\n\nfunction parseMarkerNames(rawValue: string): string[] | undefined {\n\tconst names = rawValue\n\t\t.split(',')\n\t\t.map((value) => value.trim())\n\t\t.filter(Boolean);\n\n\treturn names.length ? [...new Set(names)] : undefined;\n}\n\nexport function parseGitBranchNames(decorations: string): string[] | undefined {\n\tconst names = decorations\n\t\t.split(',')\n\t\t.map((value) => value.trim())\n\t\t.flatMap((value) => {\n\t\t\tif (!value || value === 'HEAD' || value.startsWith('tag: ')) {\n\t\t\t\treturn [];\n\t\t\t}\n\n\t\t\tconst [left, right] = value.split('->').map((part) => part.trim());\n\t\t\tif (right) {\n\t\t\t\treturn right === 'HEAD' ? [] : [right];\n\t\t\t}\n\n\t\t\treturn left ? [left] : [];\n\t\t})\n\t\t.filter(Boolean);\n\n\treturn names.length ? [...new Set(names)] : undefined;\n}\n\nexport function parseJjSummaryRenameLines(output: string): RenameEntry[] {\n\treturn output\n\t\t.split(/\\r?\\n/u)\n\t\t.map((line) => line.trim())\n\t\t.filter(Boolean)\n\t\t.reduce<RenameEntry[]>((entries, line) => {\n\t\t\tconst match = /^R\\s+(.+?)\\s+=>\\s+(.+)$/u.exec(line);\n\t\t\tif (!match) {\n\t\t\t\treturn entries;\n\t\t\t}\n\n\t\t\tconst fromPath = match[1].trim();\n\t\t\tconst toPath = match[2].trim();\n\t\t\tconst braceStart = fromPath.indexOf('{');\n\t\t\tconst braceEnd = toPath.lastIndexOf('}');\n\n\t\t\tif (braceStart >= 0 && braceEnd >= 0) {\n\t\t\t\tconst prefix = fromPath.slice(0, braceStart);\n\t\t\t\tconst fromSuffix = fromPath.slice(braceStart + 1);\n\t\t\t\tconst toPrefix = toPath.slice(0, braceEnd);\n\t\t\t\tconst suffix = toPath.slice(braceEnd + 1);\n\n\t\t\t\tentries.push({\n\t\t\t\t\tfromPath: `${prefix}${fromSuffix}${suffix}`,\n\t\t\t\t\ttoPath: `${prefix}${toPrefix}${suffix}`,\n\t\t\t\t});\n\t\t\t\treturn entries;\n\t\t\t}\n\n\t\t\tentries.push({\n\t\t\t\tfromPath,\n\t\t\t\ttoPath,\n\t\t\t});\n\t\t\treturn entries;\n\t\t}, []);\n}\n\nexport function parseJjEvolutionLine(line: string): ParsedEvolutionLine {\n\tconst [\n\t\trevision = '',\n\t\tchangeId = '',\n\t\tauthorDate = '',\n\t\tauthorName = '',\n\t\toperationDescription = '',\n\t\t...descriptionParts\n\t] = line.split('\\t');\n\tconst description = descriptionParts.join('\\t') || operationDescription || 'Snapshot';\n\treturn {\n\t\trevision,\n\t\tchangeId: changeId || undefined,\n\t\tauthorDate,\n\t\tauthorName: authorName || 'Unknown author',\n\t\tdescription,\n\t\toperationDescription: operationDescription || 'snapshot working copy',\n\t};\n}\n\nfunction parseJjEvolutionSummaryHeader(line: string): ParsedEvolutionSummaryHeader | null {\n\tconst tokens = line.trim().split(/\\s+/u);\n\tif (tokens.length < 5) {\n\t\treturn null;\n\t}\n\n\tconst dateIndex = tokens.findIndex((token) => /^\\d{4}-\\d{2}-\\d{2}$/u.test(token));\n\tif (dateIndex < 2 || dateIndex + 2 >= tokens.length) {\n\t\treturn null;\n\t}\n\n\tconst timeToken = tokens[dateIndex + 1];\n\tif (!/^\\d{2}:\\d{2}:\\d{2}$/u.test(timeToken)) {\n\t\treturn null;\n\t}\n\n\tconst revisionIndex = tokens.findLastIndex((token) => /^[0-9a-f]{8,}$/u.test(token));\n\tif (revisionIndex <= dateIndex + 1) {\n\t\treturn null;\n\t}\n\n\tconst changeKey = tokens[0];\n\tconst [changeId = '', operationIndexRaw = ''] = changeKey.split('/');\n\tconst operationIndex = Number.parseInt(operationIndexRaw, 10);\n\tconst bookmarkNames = tokens.slice(dateIndex + 2, revisionIndex).filter(Boolean);\n\n\treturn {\n\t\tchangeKey,\n\t\tchangeId: changeId || undefined,\n\t\toperationIndex: Number.isInteger(operationIndex) ? operationIndex : undefined,\n\t\t...(bookmarkNames.length ? { bookmarkNames } : {}),\n\t\tauthorDate: `${tokens[dateIndex]}T${timeToken}`,\n\t\tauthorName: tokens.slice(1, dateIndex).join(' ') || 'Unknown author',\n\t\trevision: tokens[revisionIndex] || '',\n\t};\n}\n\nexport function normalizeSnapshotOperationKey(changeKey?: string): string | undefined {\n\tconst trimmed = String(changeKey || '').trim();\n\tif (!trimmed) {\n\t\treturn undefined;\n\t}\n\n\treturn trimmed.includes('/') ? trimmed : `${trimmed}/0`;\n}\n\nexport function toJjRootFileFileset(relativePath: string): string {\n\treturn `root-file:${JSON.stringify(relativePath)}`;\n}\n\nexport function resolvePreferredHistoryBackend(args: {\n\tworkspacePath: string;\n\tgitRoot?: string;\n\tjjRoot?: string;\n}): 'git' | 'jj' | undefined {\n\tconst workspacePath = normalizeFilesystemPath(args.workspacePath);\n\tconst gitRoot = normalizeCandidateRoot(args.gitRoot, workspacePath);\n\tconst jjRoot = normalizeCandidateRoot(args.jjRoot, workspacePath);\n\n\tif (gitRoot && jjRoot) {\n\t\tif (gitRoot === jjRoot) {\n\t\t\treturn 'jj';\n\t\t}\n\n\t\tif (isPathWithinRoot({ candidatePath: gitRoot, rootPath: jjRoot })) {\n\t\t\treturn 'git';\n\t\t}\n\n\t\tif (isPathWithinRoot({ candidatePath: jjRoot, rootPath: gitRoot })) {\n\t\t\treturn 'jj';\n\t\t}\n\n\t\treturn gitRoot.length >= jjRoot.length ? 'git' : 'jj';\n\t}\n\n\tif (jjRoot) {\n\t\treturn 'jj';\n\t}\n\n\tif (gitRoot) {\n\t\treturn 'git';\n\t}\n\n\treturn undefined;\n}\n\nfunction normalizeCandidateRoot(root: string | undefined, workspacePath: string): string | undefined {\n\tconst trimmed = String(root || '').trim();\n\tif (!trimmed) {\n\t\treturn undefined;\n\t}\n\n\tconst normalizedRoot = normalizeFilesystemPath(trimmed);\n\treturn isPathWithinRoot({ candidatePath: workspacePath, rootPath: normalizedRoot }) ? normalizedRoot : undefined;\n}\n\nfunction normalizeFilesystemPath(value: string): string {\n\treturn path.resolve(value.trim());\n}\n\nfunction isPathWithinRoot(args: { candidatePath: string; rootPath: string }): boolean {\n\tconst relativePath = path.relative(args.rootPath, args.candidatePath);\n\treturn relativePath === '' || (!relativePath.startsWith('..') && !path.isAbsolute(relativePath));\n}\n\nexport function parseJjEvolutionSummaryEntries(output: string): ParsedEvolutionSummaryEntry[] {\n\tconst lines = output.split(/\\r?\\n/u);\n\tconst entries: ParsedEvolutionSummaryEntry[] = [];\n\tlet current: ParsedEvolutionSummaryEntry | null = null;\n\tlet descriptionCaptured = false;\n\n\tconst pushCurrent = () => {\n\t\tif (!current) {\n\t\t\treturn;\n\t\t}\n\n\t\tentries.push(current);\n\t\tcurrent = null;\n\t\tdescriptionCaptured = false;\n\t};\n\n\tfor (const rawLine of lines) {\n\t\tconst line = rawLine.trim();\n\t\tif (!line) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst header = parseJjEvolutionSummaryHeader(line);\n\t\tif (header) {\n\t\t\tpushCurrent();\n\t\t\tcurrent = {\n\t\t\t\t...header,\n\t\t\t\tdescription: 'Snapshot',\n\t\t\t\toperationId: undefined,\n\t\t\t\toperationDescription: 'snapshot working copy',\n\t\t\t\tsummaryLines: [],\n\t\t\t};\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!current) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!descriptionCaptured) {\n\t\t\tcurrent.description = line;\n\t\t\tdescriptionCaptured = true;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst operationMatch = /^-- operation ([0-9a-f]+)\\s*(.*)$/u.exec(line);\n\t\tif (operationMatch) {\n\t\t\tcurrent.operationId = operationMatch[1] || undefined;\n\t\t\tcurrent.operationDescription = operationMatch[2] || 'snapshot working copy';\n\t\t\tcontinue;\n\t\t}\n\n\t\tcurrent.summaryLines.push(line);\n\t}\n\n\tpushCurrent();\n\treturn entries;\n}\n\nexport function parseJjBookmarkNames(rawValue: string): string[] | undefined {\n\treturn parseMarkerNames(rawValue);\n}\n\n/** jj template prints `true`/`false` for empty/conflict/immutable. */\nexport function parseJjBooleanFlag(rawValue: string | undefined): boolean {\n\tconst value = (rawValue || '').trim().toLowerCase();\n\treturn value === 'true' || value === '1' || value === 'yes';\n}\n\n/**\n * Shared jj log template fields for file/repo history lines:\n * revision, changeId, date, author, bookmarks, empty, conflict, immutable, description\n */\nexport function buildJjHistoryLogTemplate(): string {\n\treturn [\n\t\t'commit_id.short()',\n\t\t'\"\\\\t\"',\n\t\t'change_id.shortest()',\n\t\t'\"\\\\t\"',\n\t\t'author.timestamp().format(\"%Y-%m-%dT%H:%M:%S%:z\")',\n\t\t'\"\\\\t\"',\n\t\t'author.name()',\n\t\t'\"\\\\t\"',\n\t\t'self.local_bookmarks().map(|b| b.name()).join(\",\")',\n\t\t'\"\\\\t\"',\n\t\t'if(empty, \"true\", \"false\")',\n\t\t'\"\\\\t\"',\n\t\t'if(conflict, \"true\", \"false\")',\n\t\t'\"\\\\t\"',\n\t\t'if(immutable, \"true\", \"false\")',\n\t\t'\"\\\\t\"',\n\t\t'description.first_line()',\n\t\t'\"\\\\n\"',\n\t].join(' ++ ');\n}\n\nexport function parseJjHistoryLine(line: string): FileRevisionEntry {\n\tconst parts = line.split('\\t');\n\tconst revision = parts[0] || '';\n\tconst changeId = parts[1] || '';\n\tconst authorDate = parts[2] || '';\n\tconst authorName = parts[3] || '';\n\tconst bookmarkNames = parts[4] || '';\n\n\t// New format: … bookmarks, empty, conflict, immutable, description…\n\t// Legacy: … bookmarks, description…\n\tconst looksLikeFlags =\n\t\tparts.length >= 8 &&\n\t\t/^(true|false|0|1)$/iu.test((parts[5] || '').trim()) &&\n\t\t/^(true|false|0|1)$/iu.test((parts[6] || '').trim()) &&\n\t\t/^(true|false|0|1)$/iu.test((parts[7] || '').trim());\n\n\tconst isEmpty = looksLikeFlags ? parseJjBooleanFlag(parts[5]) : undefined;\n\tconst hasConflict = looksLikeFlags ? parseJjBooleanFlag(parts[6]) : undefined;\n\tconst isImmutable = looksLikeFlags ? parseJjBooleanFlag(parts[7]) : undefined;\n\tconst description = looksLikeFlags ? parts.slice(8).join('\\t') : parts.slice(5).join('\\t');\n\n\treturn {\n\t\tid: revision,\n\t\trevision,\n\t\tshortRevision: changeId || revision.slice(0, 8),\n\t\tchangeId: changeId || undefined,\n\t\tbookmarkNames: parseJjBookmarkNames(bookmarkNames),\n\t\tauthorDate,\n\t\tauthorName: authorName || 'Unknown author',\n\t\tdescription: description || 'No description',\n\t\tisWorkingTree: false,\n\t\ttouchesFile: true,\n\t\ttimestamp: Date.parse(authorDate) || 0,\n\t\t...(isEmpty ? { isEmpty: true } : {}),\n\t\t...(hasConflict ? { hasConflict: true } : {}),\n\t\t...(isImmutable ? { isImmutable: true } : {}),\n\t};\n}\n\nexport function parseJjSummaryChangedPaths(summaryLines: string[] | string): string[] {\n\tconst lines = Array.isArray(summaryLines) ? summaryLines : String(summaryLines || '').split(/\\r?\\n/u);\n\tconst renameLines = parseJjSummaryRenameLines(lines.join('\\n'));\n\tconst renamePaths = renameLines.flatMap((entry) => [entry.fromPath, entry.toPath]);\n\tconst directPaths = lines.reduce<string[]>((paths, rawLine) => {\n\t\tconst line = rawLine.trim();\n\t\tif (!line || /^R\\s+/u.test(line)) {\n\t\t\treturn paths;\n\t\t}\n\n\t\tconst match = /^[A-Z?]\\s+(.+)$/u.exec(line);\n\t\tif (match) {\n\t\t\tpaths.push(match[1].trim());\n\t\t}\n\n\t\treturn paths;\n\t}, []);\n\n\treturn [...new Set([...directPaths, ...renamePaths])];\n}\n\nexport function getGitHubRemoteBaseUrl(remote: string): string | undefined {\n\tconst trimmed = remote.trim();\n\tif (!trimmed) {\n\t\treturn undefined;\n\t}\n\n\tconst httpsMatch = /^https?:\\/\\/github\\.com\\/([^/]+)\\/([^/]+?)(?:\\.git)?$/u.exec(trimmed);\n\tif (httpsMatch) {\n\t\treturn `https://github.com/${httpsMatch[1]}/${httpsMatch[2]}`;\n\t}\n\n\tconst sshMatch = /^(?:ssh:\\/\\/)?git@github\\.com[:/]([^/]+)\\/([^/]+?)(?:\\.git)?$/u.exec(trimmed);\n\tif (sshMatch) {\n\t\treturn `https://github.com/${sshMatch[1]}/${sshMatch[2]}`;\n\t}\n\n\treturn undefined;\n}\n\nexport function dedupeAdjacentEntriesByChangeId<T extends { changeId?: string }>(entries: T[]): T[] {\n\treturn entries.filter((entry, index) => {\n\t\tif (!entry.changeId || index === 0) {\n\t\t\treturn true;\n\t\t}\n\n\t\treturn entries[index - 1]?.changeId !== entry.changeId;\n\t});\n}\n"],"mappings":";;;;AA0CA,SAAS,iBAAiB,UAAwC;CACjE,MAAM,QAAQ,SACZ,MAAM,GAAG,CAAC,CACV,KAAK,UAAU,MAAM,KAAK,CAAC,CAAC,CAC5B,OAAO,OAAO;CAEhB,OAAO,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,IAAI,KAAA;AAC7C;AAEA,SAAgB,oBAAoB,aAA2C;CAC9E,MAAM,QAAQ,YACZ,MAAM,GAAG,CAAC,CACV,KAAK,UAAU,MAAM,KAAK,CAAC,CAAC,CAC5B,SAAS,UAAU;EACnB,IAAI,CAAC,SAAS,UAAU,UAAU,MAAM,WAAW,OAAO,GACzD,OAAO,CAAC;EAGT,MAAM,CAAC,MAAM,SAAS,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,SAAS,KAAK,KAAK,CAAC;EACjE,IAAI,OACH,OAAO,UAAU,SAAS,CAAC,IAAI,CAAC,KAAK;EAGtC,OAAO,OAAO,CAAC,IAAI,IAAI,CAAC;CACzB,CAAC,CAAC,CACD,OAAO,OAAO;CAEhB,OAAO,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,IAAI,KAAA;AAC7C;AAEA,SAAgB,0BAA0B,QAA+B;CACxE,OAAO,OACL,MAAM,QAAQ,CAAC,CACf,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAC1B,OAAO,OAAO,CAAC,CACf,QAAuB,SAAS,SAAS;EACzC,MAAM,QAAQ,2BAA2B,KAAK,IAAI;EAClD,IAAI,CAAC,OACJ,OAAO;EAGR,MAAM,WAAW,MAAM,EAAE,CAAC,KAAK;EAC/B,MAAM,SAAS,MAAM,EAAE,CAAC,KAAK;EAC7B,MAAM,aAAa,SAAS,QAAQ,GAAG;EACvC,MAAM,WAAW,OAAO,YAAY,GAAG;EAEvC,IAAI,cAAc,KAAK,YAAY,GAAG;GACrC,MAAM,SAAS,SAAS,MAAM,GAAG,UAAU;GAC3C,MAAM,aAAa,SAAS,MAAM,aAAa,CAAC;GAChD,MAAM,WAAW,OAAO,MAAM,GAAG,QAAQ;GACzC,MAAM,SAAS,OAAO,MAAM,WAAW,CAAC;GAExC,QAAQ,KAAK;IACZ,UAAU,GAAG,SAAS,aAAa;IACnC,QAAQ,GAAG,SAAS,WAAW;GAChC,CAAC;GACD,OAAO;EACR;EAEA,QAAQ,KAAK;GACZ;GACA;EACD,CAAC;EACD,OAAO;CACR,GAAG,CAAC,CAAC;AACP;AAsBA,SAAS,8BAA8B,MAAmD;CACzF,MAAM,SAAS,KAAK,KAAK,CAAC,CAAC,MAAM,MAAM;CACvC,IAAI,OAAO,SAAS,GACnB,OAAO;CAGR,MAAM,YAAY,OAAO,WAAW,UAAU,uBAAuB,KAAK,KAAK,CAAC;CAChF,IAAI,YAAY,KAAK,YAAY,KAAK,OAAO,QAC5C,OAAO;CAGR,MAAM,YAAY,OAAO,YAAY;CACrC,IAAI,CAAC,uBAAuB,KAAK,SAAS,GACzC,OAAO;CAGR,MAAM,gBAAgB,OAAO,eAAe,UAAU,kBAAkB,KAAK,KAAK,CAAC;CACnF,IAAI,iBAAiB,YAAY,GAChC,OAAO;CAGR,MAAM,YAAY,OAAO;CACzB,MAAM,CAAC,WAAW,IAAI,oBAAoB,MAAM,UAAU,MAAM,GAAG;CACnE,MAAM,iBAAiB,OAAO,SAAS,mBAAmB,EAAE;CAC5D,MAAM,gBAAgB,OAAO,MAAM,YAAY,GAAG,aAAa,CAAC,CAAC,OAAO,OAAO;CAE/E,OAAO;EACN;EACA,UAAU,YAAY,KAAA;EACtB,gBAAgB,OAAO,UAAU,cAAc,IAAI,iBAAiB,KAAA;EACpE,GAAI,cAAc,SAAS,EAAE,cAAc,IAAI,CAAC;EAChD,YAAY,GAAG,OAAO,WAAW,GAAG;EACpC,YAAY,OAAO,MAAM,GAAG,SAAS,CAAC,CAAC,KAAK,GAAG,KAAK;EACpD,UAAU,OAAO,kBAAkB;CACpC;AACD;AAEA,SAAgB,8BAA8B,WAAwC;CACrF,MAAM,UAAU,OAAO,aAAa,EAAE,CAAC,CAAC,KAAK;CAC7C,IAAI,CAAC,SACJ;CAGD,OAAO,QAAQ,SAAS,GAAG,IAAI,UAAU,GAAG,QAAQ;AACrD;AAEA,SAAgB,oBAAoB,cAA8B;CACjE,OAAO,aAAa,KAAK,UAAU,YAAY;AAChD;AAEA,SAAgB,+BAA+B,MAIlB;CAC5B,MAAM,gBAAgB,wBAAwB,KAAK,aAAa;CAChE,MAAM,UAAU,uBAAuB,KAAK,SAAS,aAAa;CAClE,MAAM,SAAS,uBAAuB,KAAK,QAAQ,aAAa;CAEhE,IAAI,WAAW,QAAQ;EACtB,IAAI,YAAY,QACf,OAAO;EAGR,IAAI,iBAAiB;GAAE,eAAe;GAAS,UAAU;EAAO,CAAC,GAChE,OAAO;EAGR,IAAI,iBAAiB;GAAE,eAAe;GAAQ,UAAU;EAAQ,CAAC,GAChE,OAAO;EAGR,OAAO,QAAQ,UAAU,OAAO,SAAS,QAAQ;CAClD;CAEA,IAAI,QACH,OAAO;CAGR,IAAI,SACH,OAAO;AAIT;AAEA,SAAS,uBAAuB,MAA0B,eAA2C;CACpG,MAAM,UAAU,OAAO,QAAQ,EAAE,CAAC,CAAC,KAAK;CACxC,IAAI,CAAC,SACJ;CAGD,MAAM,iBAAiB,wBAAwB,OAAO;CACtD,OAAO,iBAAiB;EAAE,eAAe;EAAe,UAAU;CAAe,CAAC,IAAI,iBAAiB,KAAA;AACxG;AAEA,SAAS,wBAAwB,OAAuB;CACvD,OAAOA,UAAAA,QAAK,QAAQ,MAAM,KAAK,CAAC;AACjC;AAEA,SAAS,iBAAiB,MAA4D;CACrF,MAAM,eAAeA,UAAAA,QAAK,SAAS,KAAK,UAAU,KAAK,aAAa;CACpE,OAAO,iBAAiB,MAAO,CAAC,aAAa,WAAW,IAAI,KAAK,CAACA,UAAAA,QAAK,WAAW,YAAY;AAC/F;AAEA,SAAgB,+BAA+B,QAA+C;CAC7F,MAAM,QAAQ,OAAO,MAAM,QAAQ;CACnC,MAAM,UAAyC,CAAC;CAChD,IAAI,UAA8C;CAClD,IAAI,sBAAsB;CAE1B,MAAM,oBAAoB;EACzB,IAAI,CAAC,SACJ;EAGD,QAAQ,KAAK,OAAO;EACpB,UAAU;EACV,sBAAsB;CACvB;CAEA,KAAK,MAAM,WAAW,OAAO;EAC5B,MAAM,OAAO,QAAQ,KAAK;EAC1B,IAAI,CAAC,MACJ;EAGD,MAAM,SAAS,8BAA8B,IAAI;EACjD,IAAI,QAAQ;GACX,YAAY;GACZ,UAAU;IACT,GAAG;IACH,aAAa;IACb,aAAa,KAAA;IACb,sBAAsB;IACtB,cAAc,CAAC;GAChB;GACA;EACD;EAEA,IAAI,CAAC,SACJ;EAGD,IAAI,CAAC,qBAAqB;GACzB,QAAQ,cAAc;GACtB,sBAAsB;GACtB;EACD;EAEA,MAAM,iBAAiB,qCAAqC,KAAK,IAAI;EACrE,IAAI,gBAAgB;GACnB,QAAQ,cAAc,eAAe,MAAM,KAAA;GAC3C,QAAQ,uBAAuB,eAAe,MAAM;GACpD;EACD;EAEA,QAAQ,aAAa,KAAK,IAAI;CAC/B;CAEA,YAAY;CACZ,OAAO;AACR;AAEA,SAAgB,qBAAqB,UAAwC;CAC5E,OAAO,iBAAiB,QAAQ;AACjC;;AAGA,SAAgB,mBAAmB,UAAuC;CACzE,MAAM,SAAS,YAAY,GAAA,CAAI,KAAK,CAAC,CAAC,YAAY;CAClD,OAAO,UAAU,UAAU,UAAU,OAAO,UAAU;AACvD;;;;;AAMA,SAAgB,4BAAoC;CACnD,OAAO;EACN;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACD,CAAC,CAAC,KAAK,MAAM;AACd;AAEA,SAAgB,mBAAmB,MAAiC;CACnE,MAAM,QAAQ,KAAK,MAAM,GAAI;CAC7B,MAAM,WAAW,MAAM,MAAM;CAC7B,MAAM,WAAW,MAAM,MAAM;CAC7B,MAAM,aAAa,MAAM,MAAM;CAC/B,MAAM,aAAa,MAAM,MAAM;CAC/B,MAAM,gBAAgB,MAAM,MAAM;CAIlC,MAAM,iBACL,MAAM,UAAU,KAChB,uBAAuB,MAAM,MAAM,MAAM,GAAA,CAAI,KAAK,CAAC,KACnD,uBAAuB,MAAM,MAAM,MAAM,GAAA,CAAI,KAAK,CAAC,KACnD,uBAAuB,MAAM,MAAM,MAAM,GAAA,CAAI,KAAK,CAAC;CAEpD,MAAM,UAAU,iBAAiB,mBAAmB,MAAM,EAAE,IAAI,KAAA;CAChE,MAAM,cAAc,iBAAiB,mBAAmB,MAAM,EAAE,IAAI,KAAA;CACpE,MAAM,cAAc,iBAAiB,mBAAmB,MAAM,EAAE,IAAI,KAAA;CACpE,MAAM,cAAc,iBAAiB,MAAM,MAAM,CAAC,CAAC,CAAC,KAAK,GAAI,IAAI,MAAM,MAAM,CAAC,CAAC,CAAC,KAAK,GAAI;CAEzF,OAAO;EACN,IAAI;EACJ;EACA,eAAe,YAAY,SAAS,MAAM,GAAG,CAAC;EAC9C,UAAU,YAAY,KAAA;EACtB,eAAe,qBAAqB,aAAa;EACjD;EACA,YAAY,cAAc;EAC1B,aAAa,eAAe;EAC5B,eAAe;EACf,aAAa;EACb,WAAW,KAAK,MAAM,UAAU,KAAK;EACrC,GAAI,UAAU,EAAE,SAAS,KAAK,IAAI,CAAC;EACnC,GAAI,cAAc,EAAE,aAAa,KAAK,IAAI,CAAC;EAC3C,GAAI,cAAc,EAAE,aAAa,KAAK,IAAI,CAAC;CAC5C;AACD;AAEA,SAAgB,2BAA2B,cAA2C;CACrF,MAAM,QAAQ,MAAM,QAAQ,YAAY,IAAI,eAAe,OAAO,gBAAgB,EAAE,CAAC,CAAC,MAAM,QAAQ;CAEpG,MAAM,cADc,0BAA0B,MAAM,KAAK,IAAI,CAC/B,CAAC,CAAC,SAAS,UAAU,CAAC,MAAM,UAAU,MAAM,MAAM,CAAC;CACjF,MAAM,cAAc,MAAM,QAAkB,OAAO,YAAY;EAC9D,MAAM,OAAO,QAAQ,KAAK;EAC1B,IAAI,CAAC,QAAQ,SAAS,KAAK,IAAI,GAC9B,OAAO;EAGR,MAAM,QAAQ,mBAAmB,KAAK,IAAI;EAC1C,IAAI,OACH,MAAM,KAAK,MAAM,EAAE,CAAC,KAAK,CAAC;EAG3B,OAAO;CACR,GAAG,CAAC,CAAC;CAEL,OAAO,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,aAAa,GAAG,WAAW,CAAC,CAAC;AACrD;AAEA,SAAgB,uBAAuB,QAAoC;CAC1E,MAAM,UAAU,OAAO,KAAK;CAC5B,IAAI,CAAC,SACJ;CAGD,MAAM,aAAa,yDAAyD,KAAK,OAAO;CACxF,IAAI,YACH,OAAO,sBAAsB,WAAW,GAAG,GAAG,WAAW;CAG1D,MAAM,WAAW,iEAAiE,KAAK,OAAO;CAC9F,IAAI,UACH,OAAO,sBAAsB,SAAS,GAAG,GAAG,SAAS;AAIvD;AAEA,SAAgB,gCAAiE,SAAmB;CACnG,OAAO,QAAQ,QAAQ,OAAO,UAAU;EACvC,IAAI,CAAC,MAAM,YAAY,UAAU,GAChC,OAAO;EAGR,OAAO,QAAQ,QAAQ,EAAE,EAAE,aAAa,MAAM;CAC/C,CAAC;AACF"}

package/dist/shared/history-search.cjs

@@ -0,0 +1,85 @@
+const require_diff_content_search = require("./diff-content-search.cjs");
+//#region src/shared/history-search.ts
+function normalizeHistorySearchQuery(query) {
+	return query.trim();
+}
+/**
+* Walk oldest→newest file contents and classify when `query` first appears / last disappears.
+* `contentsByIndex` maps absolute entry index → file text at that stop.
+*/
+function searchHistoryContents(args) {
+	const query = normalizeHistorySearchQuery(args.query);
+	const hits = [];
+	let introducedAt = null;
+	let removedAt = null;
+	if (!query) return {
+		query,
+		hits,
+		introducedAt,
+		removedAt
+	};
+	let wasPresent = false;
+	for (const entryIndex of args.orderedEntryIndexes) {
+		const present = (args.contentsByIndex.get(entryIndex) ?? "").includes(query);
+		if (present) {
+			hits.push({
+				entryIndex,
+				kind: wasPresent ? "present" : "introduced"
+			});
+			if (!wasPresent) introducedAt = entryIndex;
+		} else if (wasPresent) {
+			hits.push({
+				entryIndex,
+				kind: "removed"
+			});
+			removedAt = entryIndex;
+		}
+		wasPresent = present;
+	}
+	return {
+		query,
+		hits,
+		introducedAt,
+		removedAt
+	};
+}
+/**
+* Sidebar `content:` matches — only revisions whose parent→self diff hunks contain the needle.
+*/
+function searchHistoryDiffContents(args) {
+	const query = normalizeHistorySearchQuery(args.query);
+	const hits = [];
+	if (!query) return {
+		query,
+		hits,
+		introducedAt: null,
+		removedAt: null,
+		purpose: "sidebar"
+	};
+	let previousContent = "";
+	for (const entryIndex of args.orderedEntryIndexes) {
+		const content = args.contentsByIndex.get(entryIndex) ?? "";
+		if (require_diff_content_search.diffHunkContainsNeedle({
+			before: previousContent,
+			after: content,
+			needle: query
+		})) hits.push({
+			entryIndex,
+			kind: "present"
+		});
+		previousContent = content;
+	}
+	return {
+		query,
+		hits,
+		introducedAt: hits[0]?.entryIndex ?? null,
+		removedAt: null,
+		purpose: "sidebar"
+	};
+}
+//#endregion
+exports.normalizeHistorySearchQuery = normalizeHistorySearchQuery;
+exports.searchHistoryContents = searchHistoryContents;
+exports.searchHistoryDiffContents = searchHistoryDiffContents;
+
+//# sourceMappingURL=history-search.cjs.map

package/dist/shared/history-search.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"history-search.cjs","names":["diffHunkContainsNeedle"],"sources":["../../src/shared/history-search.ts"],"sourcesContent":["import { diffHunkContainsNeedle } from './diff-content-search.ts';\n\nexport type HistorySearchHit = {\n\tentryIndex: number;\n\tkind: 'introduced' | 'removed' | 'present';\n};\n\nexport type HistorySearchResult = {\n\tquery: string;\n\thits: HistorySearchHit[];\n\tintroducedAt: number | null;\n\tremovedAt: number | null;\n\tpurpose?: 'history' | 'sidebar';\n};\n\nexport function normalizeHistorySearchQuery(query: string): string {\n\treturn query.trim();\n}\n\n/**\n * Walk oldest→newest file contents and classify when `query` first appears / last disappears.\n * `contentsByIndex` maps absolute entry index → file text at that stop.\n */\nexport function searchHistoryContents(args: {\n\tquery: string;\n\torderedEntryIndexes: number[];\n\tcontentsByIndex: Map<number, string>;\n}): HistorySearchResult {\n\tconst query = normalizeHistorySearchQuery(args.query);\n\tconst hits: HistorySearchHit[] = [];\n\tlet introducedAt: number | null = null;\n\tlet removedAt: number | null = null;\n\tif (!query) {\n\t\treturn { query, hits, introducedAt, removedAt };\n\t}\n\n\tlet wasPresent = false;\n\tfor (const entryIndex of args.orderedEntryIndexes) {\n\t\tconst content = args.contentsByIndex.get(entryIndex) ?? '';\n\t\tconst present = content.includes(query);\n\t\tif (present) {\n\t\t\thits.push({ entryIndex, kind: wasPresent ? 'present' : 'introduced' });\n\t\t\tif (!wasPresent) {\n\t\t\t\tintroducedAt = entryIndex;\n\t\t\t}\n\t\t} else if (wasPresent) {\n\t\t\thits.push({ entryIndex, kind: 'removed' });\n\t\t\tremovedAt = entryIndex;\n\t\t}\n\t\twasPresent = present;\n\t}\n\n\treturn { query, hits, introducedAt, removedAt };\n}\n\n/**\n * Sidebar `content:` matches — only revisions whose parent→self diff hunks contain the needle.\n */\nexport function searchHistoryDiffContents(args: {\n\tquery: string;\n\torderedEntryIndexes: number[];\n\tcontentsByIndex: Map<number, string>;\n}): HistorySearchResult {\n\tconst query = normalizeHistorySearchQuery(args.query);\n\tconst hits: HistorySearchHit[] = [];\n\tif (!query) {\n\t\treturn { query, hits, introducedAt: null, removedAt: null, purpose: 'sidebar' };\n\t}\n\n\tlet previousContent = '';\n\tfor (const entryIndex of args.orderedEntryIndexes) {\n\t\tconst content = args.contentsByIndex.get(entryIndex) ?? '';\n\t\tif (diffHunkContainsNeedle({ before: previousContent, after: content, needle: query })) {\n\t\t\thits.push({ entryIndex, kind: 'present' });\n\t\t}\n\t\tpreviousContent = content;\n\t}\n\n\treturn {\n\t\tquery,\n\t\thits,\n\t\tintroducedAt: hits[0]?.entryIndex ?? null,\n\t\tremovedAt: null,\n\t\tpurpose: 'sidebar',\n\t};\n}\n"],"mappings":";;AAeA,SAAgB,4BAA4B,OAAuB;CAClE,OAAO,MAAM,KAAK;AACnB;;;;;AAMA,SAAgB,sBAAsB,MAId;CACvB,MAAM,QAAQ,4BAA4B,KAAK,KAAK;CACpD,MAAM,OAA2B,CAAC;CAClC,IAAI,eAA8B;CAClC,IAAI,YAA2B;CAC/B,IAAI,CAAC,OACJ,OAAO;EAAE;EAAO;EAAM;EAAc;CAAU;CAG/C,IAAI,aAAa;CACjB,KAAK,MAAM,cAAc,KAAK,qBAAqB;EAElD,MAAM,WADU,KAAK,gBAAgB,IAAI,UAAU,KAAK,GAAA,CAChC,SAAS,KAAK;EACtC,IAAI,SAAS;GACZ,KAAK,KAAK;IAAE;IAAY,MAAM,aAAa,YAAY;GAAa,CAAC;GACrE,IAAI,CAAC,YACJ,eAAe;EAEjB,OAAO,IAAI,YAAY;GACtB,KAAK,KAAK;IAAE;IAAY,MAAM;GAAU,CAAC;GACzC,YAAY;EACb;EACA,aAAa;CACd;CAEA,OAAO;EAAE;EAAO;EAAM;EAAc;CAAU;AAC/C;;;;AAKA,SAAgB,0BAA0B,MAIlB;CACvB,MAAM,QAAQ,4BAA4B,KAAK,KAAK;CACpD,MAAM,OAA2B,CAAC;CAClC,IAAI,CAAC,OACJ,OAAO;EAAE;EAAO;EAAM,cAAc;EAAM,WAAW;EAAM,SAAS;CAAU;CAG/E,IAAI,kBAAkB;CACtB,KAAK,MAAM,cAAc,KAAK,qBAAqB;EAClD,MAAM,UAAU,KAAK,gBAAgB,IAAI,UAAU,KAAK;EACxD,IAAIA,4BAAAA,uBAAuB;GAAE,QAAQ;GAAiB,OAAO;GAAS,QAAQ;EAAM,CAAC,GACpF,KAAK,KAAK;GAAE;GAAY,MAAM;EAAU,CAAC;EAE1C,kBAAkB;CACnB;CAEA,OAAO;EACN;EACA;EACA,cAAc,KAAK,EAAE,EAAE,cAAc;EACrC,WAAW;EACX,SAAS;CACV;AACD"}