jj-plus 0.10.10

package/dist/shared/jj-revset-suggestions.cjs

@@ -0,0 +1,41 @@
+//#region src/shared/jj-revset-suggestions.ts
+/** Single-revision targets for “compare file with …” quick picks. */
+const JJ_COMPARE_TARGET_SUGGESTIONS = [
+	{
+		label: "Parent",
+		revset: "@-"
+	},
+	{
+		label: "Trunk",
+		revset: "trunk()"
+	},
+	{
+		label: "Closest bookmark",
+		revset: "closest_bookmark(@)"
+	},
+	{
+		label: "Closest pushable",
+		revset: "closest_pushable(@)"
+	},
+	{
+		label: "Tip",
+		revset: "tip"
+	},
+	{
+		label: "Latest",
+		revset: "latest"
+	},
+	{
+		label: "main@origin",
+		revset: "main@origin"
+	}
+];
+function mergeCompareQuickPickValues(bookmarkNames) {
+	const seeded = JJ_COMPARE_TARGET_SUGGESTIONS.map((entry) => entry.revset);
+	return [.../* @__PURE__ */ new Set([...seeded, ...bookmarkNames.map((name) => name.trim()).filter(Boolean)])];
+}
+//#endregion
+exports.JJ_COMPARE_TARGET_SUGGESTIONS = JJ_COMPARE_TARGET_SUGGESTIONS;
+exports.mergeCompareQuickPickValues = mergeCompareQuickPickValues;
+
+//# sourceMappingURL=jj-revset-suggestions.cjs.map

package/dist/shared/jj-revset-suggestions.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"jj-revset-suggestions.cjs","names":[],"sources":["../../src/shared/jj-revset-suggestions.ts"],"sourcesContent":["/**\n * Common jj revset chips / compare targets.\n * Prefer built-ins + widely useful aliases (closest_bookmark, slice, tip, …).\n * Avoid fileset-confused / version-fragile helpers like tags() / heads(all()).\n */\n\nexport type RevsetSuggestion = { label: string; revset: string };\n\n/** Single-revision targets for “compare file with …” quick picks. */\nexport const JJ_COMPARE_TARGET_SUGGESTIONS: ReadonlyArray<RevsetSuggestion> = [\n\t{ label: 'Parent', revset: '@-' },\n\t{ label: 'Trunk', revset: 'trunk()' },\n\t{ label: 'Closest bookmark', revset: 'closest_bookmark(@)' },\n\t{ label: 'Closest pushable', revset: 'closest_pushable(@)' },\n\t{ label: 'Tip', revset: 'tip' },\n\t{ label: 'Latest', revset: 'latest' },\n\t{ label: 'main@origin', revset: 'main@origin' },\n];\n\n/** Timeline View-menu revset filter chips (ranges + filters OK). */\nexport const JJ_TIMELINE_REVSET_SUGGESTIONS: ReadonlyArray<RevsetSuggestion> = [\n\t{ label: 'vs bookmark', revset: 'trunk()..closest_bookmark(@)' },\n\t{ label: 'vs pushable', revset: 'trunk()..closest_pushable(@)' },\n\t{ label: 'Slice', revset: 'slice()' },\n\t{ label: 'Tip', revset: 'tip' },\n\t{ label: 'Latest', revset: 'latest' },\n\t{ label: 'Mine', revset: 'mine()' },\n\t{ label: 'Bookmarks', revset: 'bookmarks()' },\n\t{ label: 'Remote bookmarks', revset: 'remote_bookmarks()' },\n\t{ label: 'Branch start', revset: 'branch_start(@)' },\n\t{ label: 'Trunk…@', revset: 'trunk()..@' },\n\t{ label: 'Mutable', revset: 'mutable()' },\n\t{ label: 'Immutable', revset: 'immutable()' },\n\t{ label: 'Conflicts', revset: 'conflicts()' },\n\t{ label: 'Empty', revset: 'empty()' },\n\t{ label: 'Ancestors', revset: 'ancestors(@)' },\n];\n\nexport function mergeCompareQuickPickValues(bookmarkNames: ReadonlyArray<string>): string[] {\n\tconst seeded = JJ_COMPARE_TARGET_SUGGESTIONS.map((entry) => entry.revset);\n\treturn [...new Set([...seeded, ...bookmarkNames.map((name) => name.trim()).filter(Boolean)])];\n}\n"],"mappings":";;AASA,MAAa,gCAAiE;CAC7E;EAAE,OAAO;EAAU,QAAQ;CAAK;CAChC;EAAE,OAAO;EAAS,QAAQ;CAAU;CACpC;EAAE,OAAO;EAAoB,QAAQ;CAAsB;CAC3D;EAAE,OAAO;EAAoB,QAAQ;CAAsB;CAC3D;EAAE,OAAO;EAAO,QAAQ;CAAM;CAC9B;EAAE,OAAO;EAAU,QAAQ;CAAS;CACpC;EAAE,OAAO;EAAe,QAAQ;CAAc;AAC/C;AAqBA,SAAgB,4BAA4B,eAAgD;CAC3F,MAAM,SAAS,8BAA8B,KAAK,UAAU,MAAM,MAAM;CACxE,OAAO,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,cAAc,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC;AAC7F"}

package/dist/shared/line-history.cjs

@@ -0,0 +1,181 @@
+const require_diff_helpers = require("./diff-helpers.cjs");
+//#region src/shared/line-history.ts
+function normalizeLineHistoryRange(startLine, endLine) {
+	if (!Number.isFinite(startLine) || !Number.isFinite(endLine)) return null;
+	return {
+		startLine: Math.max(1, Math.floor(Math.min(startLine, endLine))),
+		endLine: Math.max(1, Math.floor(Math.max(startLine, endLine)))
+	};
+}
+function formatStatusBarLineHistoryChip(range) {
+	if (range.startLine === range.endLine) return `JJ Timeline L${range.startLine}`;
+	return `JJ Timeline L${range.startLine}–${range.endLine}`;
+}
+function splitTextIntoLines(value) {
+	if (!value) return [];
+	const lines = value.replace(/\r\n/g, "\n").split("\n");
+	if (lines.at(-1) === "") lines.pop();
+	return lines;
+}
+/**
+* True when the diff between before/after changes any line whose
+* before-file or after-file line number falls in the inclusive 1-based range.
+*/
+function diffTouchesLineRange(args) {
+	if (require_diff_helpers.textsMatchIgnoringLineEndings(args.beforeText, args.afterText)) return false;
+	const beforeLines = splitTextIntoLines(args.beforeText);
+	const afterLines = splitTextIntoLines(args.afterText);
+	if (!beforeLines.length && afterLines.length) return lineRangeOverlaps(1, afterLines.length, args.range);
+	if (beforeLines.length && !afterLines.length) return lineRangeOverlaps(1, beforeLines.length, args.range);
+	let beforeLine = 1;
+	let afterLine = 1;
+	const operations = buildLineOperations(beforeLines, afterLines);
+	for (const operation of operations) {
+		if (operation.type === "context") {
+			beforeLine += 1;
+			afterLine += 1;
+			continue;
+		}
+		if (operation.type === "remove") {
+			if (lineInRange(beforeLine, args.range)) return true;
+			beforeLine += 1;
+			continue;
+		}
+		if (lineInRange(afterLine, args.range)) return true;
+		afterLine += 1;
+	}
+	return false;
+}
+function filterEntriesTouchingLineRange(args) {
+	if (args.entries.length <= 1) return [...args.entries];
+	const kept = [];
+	for (let index = 1; index < args.entries.length; index += 1) {
+		const previous = args.entries[index - 1];
+		const entry = args.entries[index];
+		if (diffTouchesLineRange({
+			beforeText: args.getContent(previous),
+			afterText: args.getContent(entry),
+			range: args.range
+		})) kept.push(entry);
+	}
+	if (!kept.length) {
+		const tip = args.entries.at(-1);
+		return tip ? [tip] : [];
+	}
+	const tip = args.entries.at(-1);
+	if (tip && kept.at(-1) !== tip) kept.push(tip);
+	return kept;
+}
+/** Parse `git log -L` / `--format=%H` style stdout into ordered oldest→newest hashes. */
+function parseGitLineHistoryRevisions(stdout) {
+	return stdout.split(/\r?\n/u).map((line) => line.trim()).filter((line) => /^[0-9a-f]{7,40}$/i.test(line)).toReversed();
+}
+function buildGitLineHistoryArgs(args) {
+	return [
+		"log",
+		"--follow",
+		`-L${args.range.startLine},${args.range.endLine}:${args.relativePath}`,
+		"--date=iso-strict",
+		"--format=%H",
+		`--max-count=${args.limit ?? 200}`
+	];
+}
+function lineInRange(line, range) {
+	return line >= range.startLine && line <= range.endLine;
+}
+function lineRangeOverlaps(start, end, range) {
+	return start <= range.endLine && end >= range.startLine;
+}
+function buildLineOperations(beforeLines, afterLines) {
+	if (!beforeLines.length) return afterLines.map((text) => ({
+		type: "add",
+		text
+	}));
+	if (!afterLines.length) return beforeLines.map((text) => ({
+		type: "remove",
+		text
+	}));
+	if (beforeLines.length * afterLines.length > 12e5) return buildFallbackLineOperations(beforeLines, afterLines);
+	const matrix = Array.from({ length: beforeLines.length + 1 }, () => new Uint32Array(afterLines.length + 1));
+	for (let leftIndex = beforeLines.length - 1; leftIndex >= 0; leftIndex -= 1) for (let rightIndex = afterLines.length - 1; rightIndex >= 0; rightIndex -= 1) matrix[leftIndex][rightIndex] = beforeLines[leftIndex] === 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 < beforeLines.length && rightIndex < afterLines.length) {
+		if (beforeLines[leftIndex] === afterLines[rightIndex]) {
+			operations.push({
+				type: "context",
+				text: beforeLines[leftIndex]
+			});
+			leftIndex += 1;
+			rightIndex += 1;
+			continue;
+		}
+		if (matrix[leftIndex + 1][rightIndex] >= matrix[leftIndex][rightIndex + 1]) {
+			operations.push({
+				type: "remove",
+				text: beforeLines[leftIndex]
+			});
+			leftIndex += 1;
+			continue;
+		}
+		operations.push({
+			type: "add",
+			text: afterLines[rightIndex]
+		});
+		rightIndex += 1;
+	}
+	while (leftIndex < beforeLines.length) {
+		operations.push({
+			type: "remove",
+			text: beforeLines[leftIndex]
+		});
+		leftIndex += 1;
+	}
+	while (rightIndex < afterLines.length) {
+		operations.push({
+			type: "add",
+			text: afterLines[rightIndex]
+		});
+		rightIndex += 1;
+	}
+	return operations;
+}
+function buildFallbackLineOperations(beforeLines, afterLines) {
+	const operations = [];
+	let prefix = 0;
+	while (prefix < beforeLines.length && prefix < afterLines.length && beforeLines[prefix] === afterLines[prefix]) prefix += 1;
+	let beforeSuffix = beforeLines.length - 1;
+	let afterSuffix = afterLines.length - 1;
+	while (beforeSuffix >= prefix && afterSuffix >= prefix && beforeLines[beforeSuffix] === afterLines[afterSuffix]) {
+		beforeSuffix -= 1;
+		afterSuffix -= 1;
+	}
+	for (const text of beforeLines.slice(0, prefix)) operations.push({
+		type: "context",
+		text
+	});
+	for (const text of beforeLines.slice(prefix, beforeSuffix + 1)) operations.push({
+		type: "remove",
+		text
+	});
+	for (const text of afterLines.slice(prefix, afterSuffix + 1)) operations.push({
+		type: "add",
+		text
+	});
+	for (const text of beforeLines.slice(beforeSuffix + 1)) operations.push({
+		type: "context",
+		text
+	});
+	return operations;
+}
+//#endregion
+exports.buildGitLineHistoryArgs = buildGitLineHistoryArgs;
+exports.diffTouchesLineRange = diffTouchesLineRange;
+exports.filterEntriesTouchingLineRange = filterEntriesTouchingLineRange;
+exports.formatStatusBarLineHistoryChip = formatStatusBarLineHistoryChip;
+exports.normalizeLineHistoryRange = normalizeLineHistoryRange;
+exports.parseGitLineHistoryRevisions = parseGitLineHistoryRevisions;
+exports.splitTextIntoLines = splitTextIntoLines;
+
+//# sourceMappingURL=line-history.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"line-history.cjs","names":["textsMatchIgnoringLineEndings"],"sources":["../../src/shared/line-history.ts"],"sourcesContent":["import { textsMatchIgnoringLineEndings } from './diff-helpers.ts';\n\nexport type LineHistoryRange = {\n\tstartLine: number;\n\tendLine: number;\n};\n\nexport function normalizeLineHistoryRange(startLine: number, endLine: number): LineHistoryRange | null {\n\tif (!Number.isFinite(startLine) || !Number.isFinite(endLine)) {\n\t\treturn null;\n\t}\n\tconst start = Math.max(1, Math.floor(Math.min(startLine, endLine)));\n\tconst end = Math.max(1, Math.floor(Math.max(startLine, endLine)));\n\treturn { startLine: start, endLine: end };\n}\n\nexport function formatLineHistoryLabel(range: LineHistoryRange): string {\n\tif (range.startLine === range.endLine) {\n\t\treturn `Line ${range.startLine}`;\n\t}\n\treturn `Lines ${range.startLine}–${range.endLine}`;\n}\n\nexport function formatStatusBarLineHistoryChip(range: LineHistoryRange): string {\n\tif (range.startLine === range.endLine) {\n\t\treturn `JJ Timeline L${range.startLine}`;\n\t}\n\treturn `JJ Timeline L${range.startLine}–${range.endLine}`;\n}\n\nexport function splitTextIntoLines(value: string): string[] {\n\tif (!value) {\n\t\treturn [];\n\t}\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\n/**\n * True when the diff between before/after changes any line whose\n * before-file or after-file line number falls in the inclusive 1-based range.\n */\nexport function diffTouchesLineRange(args: {\n\tbeforeText: string;\n\tafterText: string;\n\trange: LineHistoryRange;\n}): boolean {\n\tif (textsMatchIgnoringLineEndings(args.beforeText, args.afterText)) {\n\t\treturn false;\n\t}\n\n\tconst beforeLines = splitTextIntoLines(args.beforeText);\n\tconst afterLines = splitTextIntoLines(args.afterText);\n\n\tif (!beforeLines.length && afterLines.length) {\n\t\treturn lineRangeOverlaps(1, afterLines.length, args.range);\n\t}\n\tif (beforeLines.length && !afterLines.length) {\n\t\treturn lineRangeOverlaps(1, beforeLines.length, args.range);\n\t}\n\n\tlet beforeLine = 1;\n\tlet afterLine = 1;\n\tconst operations = buildLineOperations(beforeLines, afterLines);\n\n\tfor (const operation of operations) {\n\t\tif (operation.type === 'context') {\n\t\t\tbeforeLine += 1;\n\t\t\tafterLine += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tif (operation.type === 'remove') {\n\t\t\tif (lineInRange(beforeLine, args.range)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tbeforeLine += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tif (lineInRange(afterLine, args.range)) {\n\t\t\treturn true;\n\t\t}\n\t\tafterLine += 1;\n\t}\n\n\treturn false;\n}\n\nexport function filterEntriesTouchingLineRange<T extends { revision: string; isWorkingTree?: boolean }>(args: {\n\tentries: T[];\n\trange: LineHistoryRange;\n\tgetContent: (entry: T) => string;\n}): T[] {\n\tif (args.entries.length <= 1) {\n\t\treturn [...args.entries];\n\t}\n\n\tconst kept: T[] = [];\n\tfor (let index = 1; index < args.entries.length; index += 1) {\n\t\tconst previous = args.entries[index - 1];\n\t\tconst entry = args.entries[index];\n\t\tif (\n\t\t\tdiffTouchesLineRange({\n\t\t\t\tbeforeText: args.getContent(previous),\n\t\t\t\tafterText: args.getContent(entry),\n\t\t\t\trange: args.range,\n\t\t\t})\n\t\t) {\n\t\t\tkept.push(entry);\n\t\t}\n\t}\n\n\tif (!kept.length) {\n\t\tconst tip = args.entries.at(-1);\n\t\treturn tip ? [tip] : [];\n\t}\n\n\tconst tip = args.entries.at(-1);\n\tif (tip && kept.at(-1) !== tip) {\n\t\tkept.push(tip);\n\t}\n\n\treturn kept;\n}\n\n/** Parse `git log -L` / `--format=%H` style stdout into ordered oldest→newest hashes. */\nexport function parseGitLineHistoryRevisions(stdout: string): string[] {\n\treturn stdout\n\t\t.split(/\\r?\\n/u)\n\t\t.map((line) => line.trim())\n\t\t.filter((line) => /^[0-9a-f]{7,40}$/i.test(line))\n\t\t.toReversed();\n}\n\nexport function buildGitLineHistoryArgs(args: {\n\trelativePath: string;\n\trange: LineHistoryRange;\n\tlimit?: number;\n}): string[] {\n\treturn [\n\t\t'log',\n\t\t'--follow',\n\t\t`-L${args.range.startLine},${args.range.endLine}:${args.relativePath}`,\n\t\t'--date=iso-strict',\n\t\t'--format=%H',\n\t\t`--max-count=${args.limit ?? 200}`,\n\t];\n}\n\nfunction lineInRange(line: number, range: LineHistoryRange): boolean {\n\treturn line >= range.startLine && line <= range.endLine;\n}\n\nfunction lineRangeOverlaps(start: number, end: number, range: LineHistoryRange): boolean {\n\treturn start <= range.endLine && end >= range.startLine;\n}\n\ntype LineOp = { type: 'context' | 'add' | 'remove'; text: string };\n\nfunction buildLineOperations(beforeLines: string[], afterLines: string[]): LineOp[] {\n\tif (!beforeLines.length) {\n\t\treturn afterLines.map((text) => ({ type: 'add' as const, text }));\n\t}\n\tif (!afterLines.length) {\n\t\treturn beforeLines.map((text) => ({ type: 'remove' as const, text }));\n\t}\n\tif (beforeLines.length * afterLines.length > 1_200_000) {\n\t\treturn buildFallbackLineOperations(beforeLines, afterLines);\n\t}\n\n\tconst matrix = Array.from({ length: beforeLines.length + 1 }, () => new Uint32Array(afterLines.length + 1));\n\tfor (let leftIndex = beforeLines.length - 1; leftIndex >= 0; leftIndex -= 1) {\n\t\tfor (let rightIndex = afterLines.length - 1; rightIndex >= 0; rightIndex -= 1) {\n\t\t\tmatrix[leftIndex][rightIndex] =\n\t\t\t\tbeforeLines[leftIndex] === 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: LineOp[] = [];\n\tlet leftIndex = 0;\n\tlet rightIndex = 0;\n\twhile (leftIndex < beforeLines.length && rightIndex < afterLines.length) {\n\t\tif (beforeLines[leftIndex] === afterLines[rightIndex]) {\n\t\t\toperations.push({ type: 'context', text: beforeLines[leftIndex] });\n\t\t\tleftIndex += 1;\n\t\t\trightIndex += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tif (matrix[leftIndex + 1][rightIndex] >= matrix[leftIndex][rightIndex + 1]) {\n\t\t\toperations.push({ type: 'remove', text: beforeLines[leftIndex] });\n\t\t\tleftIndex += 1;\n\t\t\tcontinue;\n\t\t}\n\t\toperations.push({ type: 'add', text: afterLines[rightIndex] });\n\t\trightIndex += 1;\n\t}\n\twhile (leftIndex < beforeLines.length) {\n\t\toperations.push({ type: 'remove', text: beforeLines[leftIndex] });\n\t\tleftIndex += 1;\n\t}\n\twhile (rightIndex < afterLines.length) {\n\t\toperations.push({ type: 'add', text: afterLines[rightIndex] });\n\t\trightIndex += 1;\n\t}\n\treturn operations;\n}\n\nfunction buildFallbackLineOperations(beforeLines: string[], afterLines: string[]): LineOp[] {\n\tconst operations: LineOp[] = [];\n\tlet prefix = 0;\n\twhile (prefix < beforeLines.length && prefix < afterLines.length && beforeLines[prefix] === afterLines[prefix]) {\n\t\tprefix += 1;\n\t}\n\tlet beforeSuffix = beforeLines.length - 1;\n\tlet afterSuffix = afterLines.length - 1;\n\twhile (beforeSuffix >= prefix && afterSuffix >= prefix && beforeLines[beforeSuffix] === afterLines[afterSuffix]) {\n\t\tbeforeSuffix -= 1;\n\t\tafterSuffix -= 1;\n\t}\n\tfor (const text of beforeLines.slice(0, prefix)) {\n\t\toperations.push({ type: 'context', text });\n\t}\n\tfor (const text of beforeLines.slice(prefix, beforeSuffix + 1)) {\n\t\toperations.push({ type: 'remove', text });\n\t}\n\tfor (const text of afterLines.slice(prefix, afterSuffix + 1)) {\n\t\toperations.push({ type: 'add', text });\n\t}\n\tfor (const text of beforeLines.slice(beforeSuffix + 1)) {\n\t\toperations.push({ type: 'context', text });\n\t}\n\treturn operations;\n}\n"],"mappings":";;AAOA,SAAgB,0BAA0B,WAAmB,SAA0C;CACtG,IAAI,CAAC,OAAO,SAAS,SAAS,KAAK,CAAC,OAAO,SAAS,OAAO,GAC1D,OAAO;CAIR,OAAO;EAAE,WAFK,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,WAAW,OAAO,CAAC,CAEzC;EAAG,SADf,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,WAAW,OAAO,CAAC,CACzB;CAAE;AACzC;AASA,SAAgB,+BAA+B,OAAiC;CAC/E,IAAI,MAAM,cAAc,MAAM,SAC7B,OAAO,gBAAgB,MAAM;CAE9B,OAAO,gBAAgB,MAAM,UAAU,GAAG,MAAM;AACjD;AAEA,SAAgB,mBAAmB,OAAyB;CAC3D,IAAI,CAAC,OACJ,OAAO,CAAC;CAGT,MAAM,QADa,MAAM,QAAQ,SAAS,IACnB,CAAC,CAAC,MAAM,IAAI;CACnC,IAAI,MAAM,GAAG,EAAE,MAAM,IACpB,MAAM,IAAI;CAEX,OAAO;AACR;;;;;AAMA,SAAgB,qBAAqB,MAIzB;CACX,IAAIA,qBAAAA,8BAA8B,KAAK,YAAY,KAAK,SAAS,GAChE,OAAO;CAGR,MAAM,cAAc,mBAAmB,KAAK,UAAU;CACtD,MAAM,aAAa,mBAAmB,KAAK,SAAS;CAEpD,IAAI,CAAC,YAAY,UAAU,WAAW,QACrC,OAAO,kBAAkB,GAAG,WAAW,QAAQ,KAAK,KAAK;CAE1D,IAAI,YAAY,UAAU,CAAC,WAAW,QACrC,OAAO,kBAAkB,GAAG,YAAY,QAAQ,KAAK,KAAK;CAG3D,IAAI,aAAa;CACjB,IAAI,YAAY;CAChB,MAAM,aAAa,oBAAoB,aAAa,UAAU;CAE9D,KAAK,MAAM,aAAa,YAAY;EACnC,IAAI,UAAU,SAAS,WAAW;GACjC,cAAc;GACd,aAAa;GACb;EACD;EACA,IAAI,UAAU,SAAS,UAAU;GAChC,IAAI,YAAY,YAAY,KAAK,KAAK,GACrC,OAAO;GAER,cAAc;GACd;EACD;EACA,IAAI,YAAY,WAAW,KAAK,KAAK,GACpC,OAAO;EAER,aAAa;CACd;CAEA,OAAO;AACR;AAEA,SAAgB,+BAAwF,MAIhG;CACP,IAAI,KAAK,QAAQ,UAAU,GAC1B,OAAO,CAAC,GAAG,KAAK,OAAO;CAGxB,MAAM,OAAY,CAAC;CACnB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,QAAQ,SAAS,GAAG;EAC5D,MAAM,WAAW,KAAK,QAAQ,QAAQ;EACtC,MAAM,QAAQ,KAAK,QAAQ;EAC3B,IACC,qBAAqB;GACpB,YAAY,KAAK,WAAW,QAAQ;GACpC,WAAW,KAAK,WAAW,KAAK;GAChC,OAAO,KAAK;EACb,CAAC,GAED,KAAK,KAAK,KAAK;CAEjB;CAEA,IAAI,CAAC,KAAK,QAAQ;EACjB,MAAM,MAAM,KAAK,QAAQ,GAAG,EAAE;EAC9B,OAAO,MAAM,CAAC,GAAG,IAAI,CAAC;CACvB;CAEA,MAAM,MAAM,KAAK,QAAQ,GAAG,EAAE;CAC9B,IAAI,OAAO,KAAK,GAAG,EAAE,MAAM,KAC1B,KAAK,KAAK,GAAG;CAGd,OAAO;AACR;;AAGA,SAAgB,6BAA6B,QAA0B;CACtE,OAAO,OACL,MAAM,QAAQ,CAAC,CACf,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAC1B,QAAQ,SAAS,oBAAoB,KAAK,IAAI,CAAC,CAAC,CAChD,WAAW;AACd;AAEA,SAAgB,wBAAwB,MAI3B;CACZ,OAAO;EACN;EACA;EACA,KAAK,KAAK,MAAM,UAAU,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK;EACxD;EACA;EACA,eAAe,KAAK,SAAS;CAC9B;AACD;AAEA,SAAS,YAAY,MAAc,OAAkC;CACpE,OAAO,QAAQ,MAAM,aAAa,QAAQ,MAAM;AACjD;AAEA,SAAS,kBAAkB,OAAe,KAAa,OAAkC;CACxF,OAAO,SAAS,MAAM,WAAW,OAAO,MAAM;AAC/C;AAIA,SAAS,oBAAoB,aAAuB,YAAgC;CACnF,IAAI,CAAC,YAAY,QAChB,OAAO,WAAW,KAAK,UAAU;EAAE,MAAM;EAAgB;CAAK,EAAE;CAEjE,IAAI,CAAC,WAAW,QACf,OAAO,YAAY,KAAK,UAAU;EAAE,MAAM;EAAmB;CAAK,EAAE;CAErE,IAAI,YAAY,SAAS,WAAW,SAAS,MAC5C,OAAO,4BAA4B,aAAa,UAAU;CAG3D,MAAM,SAAS,MAAM,KAAK,EAAE,QAAQ,YAAY,SAAS,EAAE,SAAS,IAAI,YAAY,WAAW,SAAS,CAAC,CAAC;CAC1G,KAAK,IAAI,YAAY,YAAY,SAAS,GAAG,aAAa,GAAG,aAAa,GACzE,KAAK,IAAI,aAAa,WAAW,SAAS,GAAG,cAAc,GAAG,cAAc,GAC3E,OAAO,UAAU,CAAC,cACjB,YAAY,eAAe,WAAW,cACnC,OAAO,YAAY,EAAE,CAAC,aAAa,KAAK,IACxC,KAAK,IAAI,OAAO,YAAY,EAAE,CAAC,aAAa,OAAO,UAAU,CAAC,aAAa,EAAE;CAInF,MAAM,aAAuB,CAAC;CAC9B,IAAI,YAAY;CAChB,IAAI,aAAa;CACjB,OAAO,YAAY,YAAY,UAAU,aAAa,WAAW,QAAQ;EACxE,IAAI,YAAY,eAAe,WAAW,aAAa;GACtD,WAAW,KAAK;IAAE,MAAM;IAAW,MAAM,YAAY;GAAW,CAAC;GACjE,aAAa;GACb,cAAc;GACd;EACD;EACA,IAAI,OAAO,YAAY,EAAE,CAAC,eAAe,OAAO,UAAU,CAAC,aAAa,IAAI;GAC3E,WAAW,KAAK;IAAE,MAAM;IAAU,MAAM,YAAY;GAAW,CAAC;GAChE,aAAa;GACb;EACD;EACA,WAAW,KAAK;GAAE,MAAM;GAAO,MAAM,WAAW;EAAY,CAAC;EAC7D,cAAc;CACf;CACA,OAAO,YAAY,YAAY,QAAQ;EACtC,WAAW,KAAK;GAAE,MAAM;GAAU,MAAM,YAAY;EAAW,CAAC;EAChE,aAAa;CACd;CACA,OAAO,aAAa,WAAW,QAAQ;EACtC,WAAW,KAAK;GAAE,MAAM;GAAO,MAAM,WAAW;EAAY,CAAC;EAC7D,cAAc;CACf;CACA,OAAO;AACR;AAEA,SAAS,4BAA4B,aAAuB,YAAgC;CAC3F,MAAM,aAAuB,CAAC;CAC9B,IAAI,SAAS;CACb,OAAO,SAAS,YAAY,UAAU,SAAS,WAAW,UAAU,YAAY,YAAY,WAAW,SACtG,UAAU;CAEX,IAAI,eAAe,YAAY,SAAS;CACxC,IAAI,cAAc,WAAW,SAAS;CACtC,OAAO,gBAAgB,UAAU,eAAe,UAAU,YAAY,kBAAkB,WAAW,cAAc;EAChH,gBAAgB;EAChB,eAAe;CAChB;CACA,KAAK,MAAM,QAAQ,YAAY,MAAM,GAAG,MAAM,GAC7C,WAAW,KAAK;EAAE,MAAM;EAAW;CAAK,CAAC;CAE1C,KAAK,MAAM,QAAQ,YAAY,MAAM,QAAQ,eAAe,CAAC,GAC5D,WAAW,KAAK;EAAE,MAAM;EAAU;CAAK,CAAC;CAEzC,KAAK,MAAM,QAAQ,WAAW,MAAM,QAAQ,cAAc,CAAC,GAC1D,WAAW,KAAK;EAAE,MAAM;EAAO;CAAK,CAAC;CAEtC,KAAK,MAAM,QAAQ,YAAY,MAAM,eAAe,CAAC,GACpD,WAAW,KAAK;EAAE,MAAM;EAAW;CAAK,CAAC;CAE1C,OAAO;AACR"}

package/dist/shared/list-file-revisions.cjs

@@ -0,0 +1,36 @@
+//#region src/shared/list-file-revisions.ts
+async function listFileRevisionIds(args) {
+	if (args.backend === "git") {
+		const { stdout } = await args.runner.runGit({
+			workspacePath: args.workspacePath,
+			args: [
+				"log",
+				"--follow",
+				"--format=%H",
+				"--",
+				args.relativePath
+			]
+		});
+		return stdout.split(/\r?\n/u).map((line) => line.trim()).filter(Boolean).toReversed();
+	}
+	const { stdout } = await args.runner.runJj({
+		workspacePath: args.workspacePath,
+		args: [
+			"log",
+			"-r",
+			"::@",
+			"--no-graph",
+			"-T",
+			"commit_id ++ \"\\n\"",
+			"--",
+			args.relativePath
+		]
+	});
+	const ids = stdout.split(/\r?\n/u).map((line) => line.trim()).filter(Boolean).toReversed();
+	if (ids.at(-1) !== "@") ids.push("@");
+	return ids;
+}
+//#endregion
+exports.listFileRevisionIds = listFileRevisionIds;
+
+//# sourceMappingURL=list-file-revisions.cjs.map

package/dist/shared/list-file-revisions.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"list-file-revisions.cjs","names":[],"sources":["../../src/shared/list-file-revisions.ts"],"sourcesContent":["export async function listFileRevisionIds(args: {\n\trunner: {\n\t\trunGit: (args: { workspacePath: string; args: string[] }) => Promise<{ stdout: string }>;\n\t\trunJj: (args: { workspacePath: string; args: string[] }) => Promise<{ stdout: string }>;\n\t};\n\tworkspacePath: string;\n\trelativePath: string;\n\tbackend: 'git' | 'jj';\n}): Promise<string[]> {\n\tif (args.backend === 'git') {\n\t\tconst { stdout } = await args.runner.runGit({\n\t\t\tworkspacePath: args.workspacePath,\n\t\t\targs: ['log', '--follow', '--format=%H', '--', args.relativePath],\n\t\t});\n\t\treturn stdout\n\t\t\t.split(/\\r?\\n/u)\n\t\t\t.map((line) => line.trim())\n\t\t\t.filter(Boolean)\n\t\t\t.toReversed();\n\t}\n\tconst { stdout } = await args.runner.runJj({\n\t\tworkspacePath: args.workspacePath,\n\t\targs: ['log', '-r', '::@', '--no-graph', '-T', 'commit_id ++ \"\\\\n\"', '--', args.relativePath],\n\t});\n\tconst ids = stdout\n\t\t.split(/\\r?\\n/u)\n\t\t.map((line) => line.trim())\n\t\t.filter(Boolean)\n\t\t.toReversed();\n\tif (ids.at(-1) !== '@') {\n\t\tids.push('@');\n\t}\n\treturn ids;\n}\n"],"mappings":";AAAA,eAAsB,oBAAoB,MAQpB;CACrB,IAAI,KAAK,YAAY,OAAO;EAC3B,MAAM,EAAE,WAAW,MAAM,KAAK,OAAO,OAAO;GAC3C,eAAe,KAAK;GACpB,MAAM;IAAC;IAAO;IAAY;IAAe;IAAM,KAAK;GAAY;EACjE,CAAC;EACD,OAAO,OACL,MAAM,QAAQ,CAAC,CACf,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAC1B,OAAO,OAAO,CAAC,CACf,WAAW;CACd;CACA,MAAM,EAAE,WAAW,MAAM,KAAK,OAAO,MAAM;EAC1C,eAAe,KAAK;EACpB,MAAM;GAAC;GAAO;GAAM;GAAO;GAAc;GAAM;GAAsB;GAAM,KAAK;EAAY;CAC7F,CAAC;CACD,MAAM,MAAM,OACV,MAAM,QAAQ,CAAC,CACf,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAC1B,OAAO,OAAO,CAAC,CACf,WAAW;CACb,IAAI,IAAI,GAAG,EAAE,MAAM,KAClB,IAAI,KAAK,GAAG;CAEb,OAAO;AACR"}

package/dist/shared/non-textual-details.cjs

@@ -0,0 +1,43 @@
+const require_diff_helpers = require("./diff-helpers.cjs");
+//#region src/shared/non-textual-details.ts
+function stripAllWhitespace(value) {
+	return value.replace(/\s+/gu, "");
+}
+function textsMatchIgnoringWhitespace(beforeText, afterText) {
+	return stripAllWhitespace(beforeText) === stripAllWhitespace(afterText);
+}
+function looksBinary(text) {
+	return text.includes("\0");
+}
+/**
+* Explain why a selection has no textual line diff worth rendering in Pierre.
+* Always returns at least one human-readable reason when called for an empty preview.
+*/
+function buildNonTextualDetails(args) {
+	const details = [];
+	const before = args.beforeText ?? "";
+	const after = args.afterText ?? "";
+	const beforePath = args.beforePath || "";
+	const afterPath = args.afterPath || "";
+	if (beforePath && afterPath && beforePath !== afterPath) details.push(`Path changed: ${beforePath} -> ${afterPath}`);
+	if (args.beforeMode && args.afterMode && args.beforeMode !== args.afterMode) details.push(`File mode changed: ${args.beforeMode} -> ${args.afterMode}`);
+	if (!before && !after) {
+		details.push("Both sides are empty for this path.");
+		return details;
+	}
+	if (looksBinary(before) || looksBinary(after)) {
+		details.push("Binary (or null-byte) content changed; inline text diff is skipped.");
+		return details;
+	}
+	if (before !== after && require_diff_helpers.textsMatchIgnoringLineEndings(before, after)) details.push("Line endings changed.");
+	if (before !== after && !require_diff_helpers.textsMatchIgnoringLineEndings(before, after) && textsMatchIgnoringWhitespace(before, after)) details.push("Whitespace-only changes.");
+	if (!before && after) details.push("File appeared (empty before, content after) but no line hunks were produced.");
+	else if (before && !after) details.push("File disappeared (content before, empty after) but no line hunks were produced.");
+	if (!details.length && args.isWorkingTree) details.push("The working tree differs in a way this preview does not render as a textual line diff.");
+	if (!details.length) details.push("This selection changed file metadata or another non-text detail that is not shown in the inline preview.");
+	return details;
+}
+//#endregion
+exports.buildNonTextualDetails = buildNonTextualDetails;
+
+//# sourceMappingURL=non-textual-details.cjs.map

package/dist/shared/non-textual-details.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-textual-details.cjs","names":["textsMatchIgnoringLineEndings"],"sources":["../../src/shared/non-textual-details.ts"],"sourcesContent":["import { textsMatchIgnoringLineEndings } from './diff-helpers.ts';\n\nexport type NonTextualDetailArgs = {\n\tbeforeText: string;\n\tafterText: string;\n\tbeforePath: string;\n\tafterPath: string;\n\tisWorkingTree?: boolean;\n\t/** Optional file modes from git/jj (e.g. 100644 / 100755). */\n\tbeforeMode?: string;\n\tafterMode?: string;\n};\n\nfunction stripAllWhitespace(value: string): string {\n\treturn value.replace(/\\s+/gu, '');\n}\n\nfunction textsMatchIgnoringWhitespace(beforeText: string, afterText: string): boolean {\n\treturn stripAllWhitespace(beforeText) === stripAllWhitespace(afterText);\n}\n\nfunction looksBinary(text: string): boolean {\n\treturn text.includes('\\u0000');\n}\n\n/**\n * Explain why a selection has no textual line diff worth rendering in Pierre.\n * Always returns at least one human-readable reason when called for an empty preview.\n */\nexport function buildNonTextualDetails(args: NonTextualDetailArgs): string[] {\n\tconst details: string[] = [];\n\tconst before = args.beforeText ?? '';\n\tconst after = args.afterText ?? '';\n\tconst beforePath = args.beforePath || '';\n\tconst afterPath = args.afterPath || '';\n\n\tif (beforePath && afterPath && beforePath !== afterPath) {\n\t\tdetails.push(`Path changed: ${beforePath} -> ${afterPath}`);\n\t}\n\n\tif (args.beforeMode && args.afterMode && args.beforeMode !== args.afterMode) {\n\t\tdetails.push(`File mode changed: ${args.beforeMode} -> ${args.afterMode}`);\n\t}\n\n\tif (!before && !after) {\n\t\tdetails.push('Both sides are empty for this path.');\n\t\treturn details;\n\t}\n\n\tif (looksBinary(before) || looksBinary(after)) {\n\t\tdetails.push('Binary (or null-byte) content changed; inline text diff is skipped.');\n\t\treturn details;\n\t}\n\n\tif (before !== after && textsMatchIgnoringLineEndings(before, after)) {\n\t\tdetails.push('Line endings changed.');\n\t}\n\n\tif (\n\t\tbefore !== after &&\n\t\t!textsMatchIgnoringLineEndings(before, after) &&\n\t\ttextsMatchIgnoringWhitespace(before, after)\n\t) {\n\t\tdetails.push('Whitespace-only changes.');\n\t}\n\n\tif (!before && after) {\n\t\tdetails.push('File appeared (empty before, content after) but no line hunks were produced.');\n\t} else if (before && !after) {\n\t\tdetails.push('File disappeared (content before, empty after) but no line hunks were produced.');\n\t}\n\n\tif (!details.length && args.isWorkingTree) {\n\t\tdetails.push('The working tree differs in a way this preview does not render as a textual line diff.');\n\t}\n\n\tif (!details.length) {\n\t\tdetails.push(\n\t\t\t'This selection changed file metadata or another non-text detail that is not shown in the inline preview.',\n\t\t);\n\t}\n\n\treturn details;\n}\n"],"mappings":";;AAaA,SAAS,mBAAmB,OAAuB;CAClD,OAAO,MAAM,QAAQ,SAAS,EAAE;AACjC;AAEA,SAAS,6BAA6B,YAAoB,WAA4B;CACrF,OAAO,mBAAmB,UAAU,MAAM,mBAAmB,SAAS;AACvE;AAEA,SAAS,YAAY,MAAuB;CAC3C,OAAO,KAAK,SAAS,IAAQ;AAC9B;;;;;AAMA,SAAgB,uBAAuB,MAAsC;CAC5E,MAAM,UAAoB,CAAC;CAC3B,MAAM,SAAS,KAAK,cAAc;CAClC,MAAM,QAAQ,KAAK,aAAa;CAChC,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,YAAY,KAAK,aAAa;CAEpC,IAAI,cAAc,aAAa,eAAe,WAC7C,QAAQ,KAAK,iBAAiB,WAAW,MAAM,WAAW;CAG3D,IAAI,KAAK,cAAc,KAAK,aAAa,KAAK,eAAe,KAAK,WACjE,QAAQ,KAAK,sBAAsB,KAAK,WAAW,MAAM,KAAK,WAAW;CAG1E,IAAI,CAAC,UAAU,CAAC,OAAO;EACtB,QAAQ,KAAK,qCAAqC;EAClD,OAAO;CACR;CAEA,IAAI,YAAY,MAAM,KAAK,YAAY,KAAK,GAAG;EAC9C,QAAQ,KAAK,qEAAqE;EAClF,OAAO;CACR;CAEA,IAAI,WAAW,SAASA,qBAAAA,8BAA8B,QAAQ,KAAK,GAClE,QAAQ,KAAK,uBAAuB;CAGrC,IACC,WAAW,SACX,CAACA,qBAAAA,8BAA8B,QAAQ,KAAK,KAC5C,6BAA6B,QAAQ,KAAK,GAE1C,QAAQ,KAAK,0BAA0B;CAGxC,IAAI,CAAC,UAAU,OACd,QAAQ,KAAK,8EAA8E;MACrF,IAAI,UAAU,CAAC,OACrB,QAAQ,KAAK,iFAAiF;CAG/F,IAAI,CAAC,QAAQ,UAAU,KAAK,eAC3B,QAAQ,KAAK,wFAAwF;CAGtG,IAAI,CAAC,QAAQ,QACZ,QAAQ,KACP,0GACD;CAGD,OAAO;AACR"}

package/dist/shared/resolve-file-path.cjs

@@ -0,0 +1,14 @@
+//#region src/shared/resolve-file-path.ts
+/** Coerce editor/title / command args (Uri | string | { fsPath }) into a filesystem path. */
+function coerceFsPath(value) {
+	if (typeof value === "string" && value.trim()) return value;
+	if (!value || typeof value !== "object") return;
+	const fsPath = Reflect.get(value, "fsPath");
+	if (typeof fsPath === "string" && fsPath.trim()) return fsPath;
+	const pathValue = Reflect.get(value, "path");
+	if (typeof pathValue === "string" && pathValue.trim() && !pathValue.includes("://")) return pathValue;
+}
+//#endregion
+exports.coerceFsPath = coerceFsPath;
+
+//# sourceMappingURL=resolve-file-path.cjs.map

package/dist/shared/resolve-file-path.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-file-path.cjs","names":[],"sources":["../../src/shared/resolve-file-path.ts"],"sourcesContent":["/** Coerce editor/title / command args (Uri | string | { fsPath }) into a filesystem path. */\nexport function coerceFsPath(value: unknown): string | undefined {\n\tif (typeof value === 'string' && value.trim()) {\n\t\treturn value;\n\t}\n\tif (!value || typeof value !== 'object') {\n\t\treturn undefined;\n\t}\n\tconst fsPath = Reflect.get(value, 'fsPath');\n\tif (typeof fsPath === 'string' && fsPath.trim()) {\n\t\treturn fsPath;\n\t}\n\tconst pathValue = Reflect.get(value, 'path');\n\tif (typeof pathValue === 'string' && pathValue.trim() && !pathValue.includes('://')) {\n\t\treturn pathValue;\n\t}\n\treturn undefined;\n}\n"],"mappings":";;AACA,SAAgB,aAAa,OAAoC;CAChE,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,GAC3C,OAAO;CAER,IAAI,CAAC,SAAS,OAAO,UAAU,UAC9B;CAED,MAAM,SAAS,QAAQ,IAAI,OAAO,QAAQ;CAC1C,IAAI,OAAO,WAAW,YAAY,OAAO,KAAK,GAC7C,OAAO;CAER,MAAM,YAAY,QAAQ,IAAI,OAAO,MAAM;CAC3C,IAAI,OAAO,cAAc,YAAY,UAAU,KAAK,KAAK,CAAC,UAAU,SAAS,KAAK,GACjF,OAAO;AAGT"}

package/dist/shared/revision-diff-availability.cjs

@@ -0,0 +1,18 @@
+//#region src/shared/revision-diff-availability.ts
+/** tipIndex is the "after" side; a pair needs tipIndex >= 1. */
+function getRevisionDiffNavAvailability(session) {
+	if (!session || session.revisions.length < 2) return {
+		active: false,
+		hasPrevious: false,
+		hasNext: false
+	};
+	return {
+		active: true,
+		hasPrevious: session.previousTipIndex === void 0 ? session.tipIndex > 1 : session.previousTipIndex !== null,
+		hasNext: session.nextTipIndex === void 0 ? session.tipIndex < session.revisions.length - 1 : session.nextTipIndex !== null
+	};
+}
+//#endregion
+exports.getRevisionDiffNavAvailability = getRevisionDiffNavAvailability;
+
+//# sourceMappingURL=revision-diff-availability.cjs.map

package/dist/shared/revision-diff-availability.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"revision-diff-availability.cjs","names":[],"sources":["../../src/shared/revision-diff-availability.ts"],"sourcesContent":["export type RevisionDiffSessionLike = {\n\trevisions: string[];\n\t/** Index of the \"after\" / tip side currently shown. */\n\ttipIndex: number;\n\t/** Nearest non-empty pair before the current one; null means the edge is known. */\n\tpreviousTipIndex?: number | null;\n\t/** Nearest non-empty pair after the current one; null means the edge is known. */\n\tnextTipIndex?: number | null;\n};\n\nexport type RevisionDiffNavAvailability = {\n\tactive: boolean;\n\thasPrevious: boolean;\n\thasNext: boolean;\n};\n\n/** tipIndex is the \"after\" side; a pair needs tipIndex >= 1. */\nexport function getRevisionDiffNavAvailability(\n\tsession: RevisionDiffSessionLike | undefined,\n): RevisionDiffNavAvailability {\n\tif (!session || session.revisions.length < 2) {\n\t\treturn { active: false, hasPrevious: false, hasNext: false };\n\t}\n\tconst hasPrevious = session.previousTipIndex === undefined ? session.tipIndex > 1 : session.previousTipIndex !== null;\n\tconst hasNext =\n\t\tsession.nextTipIndex === undefined\n\t\t\t? session.tipIndex < session.revisions.length - 1\n\t\t\t: session.nextTipIndex !== null;\n\treturn {\n\t\tactive: true,\n\t\thasPrevious,\n\t\thasNext,\n\t};\n}\n"],"mappings":";;AAiBA,SAAgB,+BACf,SAC8B;CAC9B,IAAI,CAAC,WAAW,QAAQ,UAAU,SAAS,GAC1C,OAAO;EAAE,QAAQ;EAAO,aAAa;EAAO,SAAS;CAAM;CAO5D,OAAO;EACN,QAAQ;EACR,aAPmB,QAAQ,qBAAqB,KAAA,IAAY,QAAQ,WAAW,IAAI,QAAQ,qBAAqB;EAQhH,SANA,QAAQ,iBAAiB,KAAA,IACtB,QAAQ,WAAW,QAAQ,UAAU,SAAS,IAC9C,QAAQ,iBAAiB;CAK7B;AACD"}

package/dist/shared/revision-diff-pair.cjs

@@ -0,0 +1,42 @@
+//#region src/shared/revision-diff-pair.ts
+/**
+* Walk tipIndex downward until base→tip file contents differ.
+* Avoids empty vscode.diff when tip is `@` (or any rev) with identical content to its parent side.
+*/
+async function resolveNonEmptyRevisionPair(args) {
+	return resolveNonEmptyRevisionPairInDirection({
+		...args,
+		direction: "backward"
+	});
+}
+/** Walk tipIndex upward to the next non-empty pair after the current diff. */
+async function resolveNextNonEmptyRevisionPair(args) {
+	return resolveNonEmptyRevisionPairInDirection({
+		...args,
+		direction: "forward"
+	});
+}
+async function resolveNonEmptyRevisionPairInDirection(args) {
+	let tipIndex = args.direction === "backward" ? Math.min(args.tipIndex, args.revisions.length - 1) : Math.max(1, args.tipIndex);
+	const step = args.direction === "backward" ? -1 : 1;
+	while (tipIndex >= 1 && tipIndex < args.revisions.length) {
+		const tip = args.revisions[tipIndex];
+		const base = args.revisions[tipIndex - 1];
+		if (!tip || !base) break;
+		const [originalContent, modifiedContent] = await Promise.all([args.showFile(base), args.showFile(tip)]);
+		if (originalContent !== modifiedContent) return {
+			tipIndex,
+			base,
+			tip,
+			originalContent,
+			modifiedContent
+		};
+		tipIndex += step;
+	}
+	return null;
+}
+//#endregion
+exports.resolveNextNonEmptyRevisionPair = resolveNextNonEmptyRevisionPair;
+exports.resolveNonEmptyRevisionPair = resolveNonEmptyRevisionPair;
+
+//# sourceMappingURL=revision-diff-pair.cjs.map

package/dist/shared/revision-diff-pair.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"revision-diff-pair.cjs","names":[],"sources":["../../src/shared/revision-diff-pair.ts"],"sourcesContent":["type RevisionPairArgs = {\n\trevisions: string[];\n\ttipIndex: number;\n\tshowFile: (revset: string) => Promise<string>;\n};\n\nexport type NonEmptyRevisionPair = {\n\ttipIndex: number;\n\tbase: string;\n\ttip: string;\n\toriginalContent: string;\n\tmodifiedContent: string;\n};\n\n/**\n * Walk tipIndex downward until base→tip file contents differ.\n * Avoids empty vscode.diff when tip is `@` (or any rev) with identical content to its parent side.\n */\nexport async function resolveNonEmptyRevisionPair(args: RevisionPairArgs): Promise<NonEmptyRevisionPair | null> {\n\treturn resolveNonEmptyRevisionPairInDirection({ ...args, direction: 'backward' });\n}\n\n/** Walk tipIndex upward to the next non-empty pair after the current diff. */\nexport async function resolveNextNonEmptyRevisionPair(args: RevisionPairArgs): Promise<NonEmptyRevisionPair | null> {\n\treturn resolveNonEmptyRevisionPairInDirection({ ...args, direction: 'forward' });\n}\n\nasync function resolveNonEmptyRevisionPairInDirection(\n\targs: RevisionPairArgs & { direction: 'backward' | 'forward' },\n): Promise<NonEmptyRevisionPair | null> {\n\tlet tipIndex =\n\t\targs.direction === 'backward' ? Math.min(args.tipIndex, args.revisions.length - 1) : Math.max(1, args.tipIndex);\n\tconst step = args.direction === 'backward' ? -1 : 1;\n\n\twhile (tipIndex >= 1 && tipIndex < args.revisions.length) {\n\t\tconst tip = args.revisions[tipIndex];\n\t\tconst base = args.revisions[tipIndex - 1];\n\t\tif (!tip || !base) {\n\t\t\tbreak;\n\t\t}\n\t\tconst [originalContent, modifiedContent] = await Promise.all([args.showFile(base), args.showFile(tip)]);\n\t\tif (originalContent !== modifiedContent) {\n\t\t\treturn { tipIndex, base, tip, originalContent, modifiedContent };\n\t\t}\n\t\ttipIndex += step;\n\t}\n\treturn null;\n}\n"],"mappings":";;;;;AAkBA,eAAsB,4BAA4B,MAA8D;CAC/G,OAAO,uCAAuC;EAAE,GAAG;EAAM,WAAW;CAAW,CAAC;AACjF;;AAGA,eAAsB,gCAAgC,MAA8D;CACnH,OAAO,uCAAuC;EAAE,GAAG;EAAM,WAAW;CAAU,CAAC;AAChF;AAEA,eAAe,uCACd,MACuC;CACvC,IAAI,WACH,KAAK,cAAc,aAAa,KAAK,IAAI,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC,IAAI,KAAK,IAAI,GAAG,KAAK,QAAQ;CAC/G,MAAM,OAAO,KAAK,cAAc,aAAa,KAAK;CAElD,OAAO,YAAY,KAAK,WAAW,KAAK,UAAU,QAAQ;EACzD,MAAM,MAAM,KAAK,UAAU;EAC3B,MAAM,OAAO,KAAK,UAAU,WAAW;EACvC,IAAI,CAAC,OAAO,CAAC,MACZ;EAED,MAAM,CAAC,iBAAiB,mBAAmB,MAAM,QAAQ,IAAI,CAAC,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,GAAG,CAAC,CAAC;EACtG,IAAI,oBAAoB,iBACvB,OAAO;GAAE;GAAU;GAAM;GAAK;GAAiB;EAAgB;EAEhE,YAAY;CACb;CACA,OAAO;AACR"}

package/dist/shared/revset.cjs

@@ -0,0 +1,16 @@
+//#region src/shared/revset.ts
+/** Normalize a user-entered jj revset; empty means "use default history". */
+function normalizeCustomRevset(value) {
+	return (value || "").trim();
+}
+/** Combine an optional power-user revset with the default ancestor window. */
+function composeJjHistoryRevset(args) {
+	const custom = normalizeCustomRevset(args.customRevset);
+	if (!custom) return args.defaultRevset;
+	return `(${custom}) & (${args.defaultRevset})`;
+}
+//#endregion
+exports.composeJjHistoryRevset = composeJjHistoryRevset;
+exports.normalizeCustomRevset = normalizeCustomRevset;
+
+//# sourceMappingURL=revset.cjs.map

package/dist/shared/revset.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"revset.cjs","names":[],"sources":["../../src/shared/revset.ts"],"sourcesContent":["/** Normalize a user-entered jj revset; empty means \"use default history\". */\nexport function normalizeCustomRevset(value: string | null | undefined): string {\n\treturn (value || '').trim();\n}\n\nexport function isCustomRevsetActive(value: string | null | undefined): boolean {\n\treturn normalizeCustomRevset(value).length > 0;\n}\n\n/** Combine an optional power-user revset with the default ancestor window. */\nexport function composeJjHistoryRevset(args: { defaultRevset: string; customRevset?: string | null }): string {\n\tconst custom = normalizeCustomRevset(args.customRevset);\n\tif (!custom) {\n\t\treturn args.defaultRevset;\n\t}\n\treturn `(${custom}) & (${args.defaultRevset})`;\n}\n"],"mappings":";;AACA,SAAgB,sBAAsB,OAA0C;CAC/E,QAAQ,SAAS,GAAA,CAAI,KAAK;AAC3B;;AAOA,SAAgB,uBAAuB,MAAuE;CAC7G,MAAM,SAAS,sBAAsB,KAAK,YAAY;CACtD,IAAI,CAAC,QACJ,OAAO,KAAK;CAEb,OAAO,IAAI,OAAO,OAAO,KAAK,cAAc;AAC7C"}

package/dist/shared/timeline-model.cjs

@@ -0,0 +1,29 @@
+//#region src/shared/timeline-model.ts
+function getEntriesForSource(data, comparisonSource) {
+	if (!data) return [];
+	if (data.backend === "jj" && comparisonSource === "snapshot") {
+		const revisionEntries = Array.isArray(data.entries) ? data.entries : [];
+		const snapshotEntries = Array.isArray(data.snapshotEntries) ? data.snapshotEntries : [];
+		const loadedChangeIds = new Set(Array.isArray(data.snapshotState?.loadedChangeIds) ? data.snapshotState.loadedChangeIds : []);
+		if (!loadedChangeIds.size) return revisionEntries;
+		const snapshotEntriesByChangeId = snapshotEntries.reduce((groups, entry) => {
+			if (!entry.changeId) return groups;
+			const existing = groups.get(entry.changeId) || [];
+			existing.push(entry);
+			groups.set(entry.changeId, existing);
+			return groups;
+		}, /* @__PURE__ */ new Map());
+		return revisionEntries.flatMap((entry) => {
+			if (!entry.changeId || entry.isWorkingTree || !entry.touchesFile || !loadedChangeIds.has(entry.changeId)) return [entry];
+			return snapshotEntriesByChangeId.get(entry.changeId) || [entry];
+		}).map((entry, index) => ({
+			...entry,
+			index
+		}));
+	}
+	return Array.isArray(data.entries) ? data.entries : [];
+}
+//#endregion
+exports.getEntriesForSource = getEntriesForSource;
+
+//# sourceMappingURL=timeline-model.cjs.map

package/dist/shared/timeline-model.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"timeline-model.cjs","names":[],"sources":["../../src/shared/timeline-model.ts"],"sourcesContent":["import type {\n\tComparisonMode,\n\tComparisonSource,\n\tDiffPreview,\n\tFileRevisionEntry,\n\tRangeOverviewItem,\n\tTimelineData,\n} from './timeline-types.ts';\n\nexport function getEntriesForSource(\n\tdata: TimelineData | null,\n\tcomparisonSource: ComparisonSource,\n): FileRevisionEntry[] {\n\tif (!data) {\n\t\treturn [];\n\t}\n\n\tif (data.backend === 'jj' && comparisonSource === 'snapshot') {\n\t\tconst revisionEntries = Array.isArray(data.entries) ? data.entries : [];\n\t\tconst snapshotEntries = Array.isArray(data.snapshotEntries) ? data.snapshotEntries : [];\n\t\tconst loadedChangeIds = new Set(\n\t\t\tArray.isArray(data.snapshotState?.loadedChangeIds) ? data.snapshotState.loadedChangeIds : [],\n\t\t);\n\n\t\tif (!loadedChangeIds.size) {\n\t\t\treturn revisionEntries;\n\t\t}\n\n\t\tconst snapshotEntriesByChangeId = snapshotEntries.reduce((groups, entry) => {\n\t\t\tif (!entry.changeId) {\n\t\t\t\treturn groups;\n\t\t\t}\n\t\t\tconst existing = groups.get(entry.changeId) || [];\n\t\t\texisting.push(entry);\n\t\t\tgroups.set(entry.changeId, existing);\n\t\t\treturn groups;\n\t\t}, new Map<string, FileRevisionEntry[]>());\n\n\t\treturn revisionEntries\n\t\t\t.flatMap((entry) => {\n\t\t\t\tif (!entry.changeId || entry.isWorkingTree || !entry.touchesFile || !loadedChangeIds.has(entry.changeId)) {\n\t\t\t\t\treturn [entry];\n\t\t\t\t}\n\t\t\t\treturn snapshotEntriesByChangeId.get(entry.changeId) || [entry];\n\t\t\t})\n\t\t\t.map((entry, index) => ({ ...entry, index }));\n\t}\n\n\treturn Array.isArray(data.entries) ? data.entries : [];\n}\n\nexport function getSelectedEntryCount(visibleEntries: FileRevisionEntry[], fromIndex: number, toIndex: number): number {\n\tconst minIndex = Math.min(fromIndex, toIndex);\n\tconst maxIndex = Math.max(fromIndex, toIndex);\n\treturn visibleEntries.filter(\n\t\t(entry) => entry.index !== undefined && entry.index >= minIndex && entry.index <= maxIndex,\n\t).length;\n}\n\nexport function findRevisionEntryMatch(entries: FileRevisionEntry[], value: string): FileRevisionEntry | undefined {\n\tconst query = value.trim().toLowerCase();\n\tif (!query) {\n\t\treturn undefined;\n\t}\n\n\treturn (\n\t\tentries.find((entry) => entry.shortRevision.toLowerCase() === query) ||\n\t\tentries.find((entry) => entry.revision.toLowerCase().startsWith(query))\n\t);\n}\n\nexport function getSelectedDiffEntryIndexes(\n\tvisibleEntries: FileRevisionEntry[],\n\tfromIndex: number,\n\ttoIndex: number,\n\tcomparisonMode: ComparisonMode,\n): number[] {\n\tif (!visibleEntries.length) {\n\t\treturn [];\n\t}\n\n\tif (comparisonMode === 'step') {\n\t\treturn visibleEntries.some((entry) => entry.index === toIndex) ? [toIndex] : [];\n\t}\n\n\tconst minIndex = Math.min(fromIndex, toIndex);\n\tconst maxIndex = Math.max(fromIndex, toIndex);\n\treturn visibleEntries\n\t\t.map((entry) => entry.index)\n\t\t.filter(\n\t\t\t(entryIndex): entryIndex is number =>\n\t\t\t\tentryIndex !== undefined && entryIndex >= minIndex && entryIndex <= maxIndex,\n\t\t)\n\t\t.slice(1);\n}\n\nexport function getRangeOverviewDiffCount(items: RangeOverviewItem[]): number {\n\treturn items.reduce((total, item) => total + item.changeCount, 0);\n}\n\nexport function getTimelineAnchorPercent(visibleEntries: FileRevisionEntry[], visibleIndex: number): number {\n\tif (!visibleEntries.length) {\n\t\treturn 0;\n\t}\n\n\tconst denominator = Math.max(1, visibleEntries.length - 1);\n\treturn (Math.min(Math.max(visibleIndex, 0), visibleEntries.length - 1) / denominator) * 100;\n}\n\nexport function getPendingSnapshotRevisionIndexes(\n\trevisionEntries: FileRevisionEntry[],\n\tloadedChangeIds: Set<string>,\n\tlimit: number,\n\tpreferredIndexes: number[] = [],\n): number[] {\n\tconst preferredIndexSet = new Set(preferredIndexes);\n\tconst seenChangeIds = new Set<string>();\n\tconst orderedEntries = [\n\t\t...revisionEntries.filter((entry) => preferredIndexSet.has(entry.index ?? -1)),\n\t\t...revisionEntries,\n\t];\n\n\treturn orderedEntries\n\t\t.reduce<number[]>((indexes, entry) => {\n\t\t\tif (\n\t\t\t\t!entry.touchesFile ||\n\t\t\t\tentry.isWorkingTree ||\n\t\t\t\t!entry.changeId ||\n\t\t\t\tloadedChangeIds.has(entry.changeId) ||\n\t\t\t\tseenChangeIds.has(entry.changeId) ||\n\t\t\t\tentry.index === undefined\n\t\t\t) {\n\t\t\t\treturn indexes;\n\t\t\t}\n\n\t\t\tseenChangeIds.add(entry.changeId);\n\t\t\tindexes.push(entry.index);\n\t\t\treturn indexes;\n\t\t}, [])\n\t\t.slice(0, limit);\n}\n\nexport function getUnitPreviewRange(\n\tvisibleEntries: FileRevisionEntry[],\n\ttoIndex: number,\n): { fromIndex: number; toIndex: number } | null {\n\tconst currentIndex = visibleEntries.findIndex((entry) => entry.index === toIndex);\n\tif (currentIndex <= 0) {\n\t\treturn null;\n\t}\n\n\treturn {\n\t\tfromIndex: visibleEntries[currentIndex - 1]?.index ?? toIndex,\n\t\ttoIndex: visibleEntries[currentIndex]?.index ?? toIndex,\n\t};\n}\n\nexport function getSidebarPreviewRequests(\n\tvisibleEntries: FileRevisionEntry[],\n\tcomparisonSource: ComparisonSource,\n\tpreviewByRange: Record<string, DiffPreview>,\n\tselectedPreviewKey: string,\n\tbuildPreviewKey: (fromIndex: number, toIndex: number, source: ComparisonSource) => string,\n): Array<{ key: string; fromIndex: number; toIndex: number; comparisonSource: ComparisonSource }> {\n\tconst requests: Array<{ key: string; fromIndex: number; toIndex: number; comparisonSource: ComparisonSource }> = [];\n\n\tfor (let index = 1; index < visibleEntries.length; index += 1) {\n\t\tconst fromIndex = visibleEntries[index - 1]?.index;\n\t\tconst toIndex = visibleEntries[index]?.index;\n\t\tif (fromIndex === undefined || toIndex === undefined) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst key = buildPreviewKey(fromIndex, toIndex, comparisonSource);\n\t\tif (key === selectedPreviewKey || previewByRange[key]) {\n\t\t\tcontinue;\n\t\t}\n\n\t\trequests.push({ key, fromIndex, toIndex, comparisonSource });\n\t}\n\n\treturn requests;\n}\n\nexport function getPendingSelectionRange(\n\tvisibleEntries: FileRevisionEntry[],\n\tpendingSelectionIndex: number | null,\n\thoveredSelectionIndex: number | null,\n): { fromEntry: FileRevisionEntry; toEntry: FileRevisionEntry; selectedCount: number } | null {\n\tif (\n\t\tpendingSelectionIndex === null ||\n\t\thoveredSelectionIndex === null ||\n\t\tpendingSelectionIndex === hoveredSelectionIndex\n\t) {\n\t\treturn null;\n\t}\n\n\tconst fromIndex = Math.min(pendingSelectionIndex, hoveredSelectionIndex);\n\tconst toIndex = Math.max(pendingSelectionIndex, hoveredSelectionIndex);\n\tconst fromEntry = visibleEntries.find((entry) => entry.index === fromIndex);\n\tconst toEntry = visibleEntries.find((entry) => entry.index === toIndex);\n\tif (!fromEntry || !toEntry) {\n\t\treturn null;\n\t}\n\n\treturn {\n\t\tfromEntry,\n\t\ttoEntry,\n\t\tselectedCount: getSelectedEntryCount(visibleEntries, fromIndex, toIndex),\n\t};\n}\n\nexport function getIntermediateToggleLabel(\n\tvisibleCount: number,\n\ttotalCount: number,\n\t_showIntermediateRevisions?: boolean,\n): string {\n\tconst safeTotal = Math.max(0, totalCount);\n\tif (!safeTotal) {\n\t\treturn 'In-Between';\n\t}\n\n\tconst safeVisibleCount = Math.min(Math.max(0, visibleCount), safeTotal);\n\treturn `In-Between ${safeVisibleCount}/${safeTotal}`;\n}\n"],"mappings":";AASA,SAAgB,oBACf,MACA,kBACsB;CACtB,IAAI,CAAC,MACJ,OAAO,CAAC;CAGT,IAAI,KAAK,YAAY,QAAQ,qBAAqB,YAAY;EAC7D,MAAM,kBAAkB,MAAM,QAAQ,KAAK,OAAO,IAAI,KAAK,UAAU,CAAC;EACtE,MAAM,kBAAkB,MAAM,QAAQ,KAAK,eAAe,IAAI,KAAK,kBAAkB,CAAC;EACtF,MAAM,kBAAkB,IAAI,IAC3B,MAAM,QAAQ,KAAK,eAAe,eAAe,IAAI,KAAK,cAAc,kBAAkB,CAAC,CAC5F;EAEA,IAAI,CAAC,gBAAgB,MACpB,OAAO;EAGR,MAAM,4BAA4B,gBAAgB,QAAQ,QAAQ,UAAU;GAC3E,IAAI,CAAC,MAAM,UACV,OAAO;GAER,MAAM,WAAW,OAAO,IAAI,MAAM,QAAQ,KAAK,CAAC;GAChD,SAAS,KAAK,KAAK;GACnB,OAAO,IAAI,MAAM,UAAU,QAAQ;GACnC,OAAO;EACR,mBAAG,IAAI,IAAiC,CAAC;EAEzC,OAAO,gBACL,SAAS,UAAU;GACnB,IAAI,CAAC,MAAM,YAAY,MAAM,iBAAiB,CAAC,MAAM,eAAe,CAAC,gBAAgB,IAAI,MAAM,QAAQ,GACtG,OAAO,CAAC,KAAK;GAEd,OAAO,0BAA0B,IAAI,MAAM,QAAQ,KAAK,CAAC,KAAK;EAC/D,CAAC,CAAC,CACD,KAAK,OAAO,WAAW;GAAE,GAAG;GAAO;EAAM,EAAE;CAC9C;CAEA,OAAO,MAAM,QAAQ,KAAK,OAAO,IAAI,KAAK,UAAU,CAAC;AACtD"}