@gitkraken/core-gitlens 0.6.0 → 0.7.0

package/dist/git/utils/blame.utils.js

@@ -1,239 +1,205 @@
-import { fnv1aHash } from '../../utils/hash.js';
-import { uncommitted } from '../models/revision.js';
+import { uncommitted } from "../models/revision.js";
+import { fnv1aHash } from "../../utils/hash.js";
+//#region ../git/src/utils/blame.utils.ts
 /**
- * Filters a {@link GitBlame} object to only include lines within the given range.
- * This is a pure data transform — no I/O or provider access needed.
- *
- * @param blame - The full blame to filter
- * @param range - 1-based line range (inclusive)
- */
-export function getBlameRange(blame, range) {
-    if (blame.lines.length === 0)
-        return blame;
-    // DiffRange is 1-based; lines array is 0-indexed
-    const startIdx = range.startLine - 1;
-    const endIdx = range.endLine; // endLine is inclusive, slice is exclusive
-    if (startIdx === 0 && endIdx >= blame.lines.length)
-        return blame;
-    const lines = blame.lines.slice(startIdx, endIdx);
-    const shas = new Set(lines.map(l => l.sha));
-    const authors = new Map();
-    const commits = new Map();
-    for (const c of blame.commits.values()) {
-        if (!shas.has(c.sha))
-            continue;
-        const commit = c.with({
-            lines: c.lines.filter(l => l.line >= range.startLine && l.line <= range.endLine),
-        });
-        commits.set(c.sha, commit);
-        let author = authors.get(commit.author.name);
-        if (author == null) {
-            author = {
-                name: commit.author.name,
-                lineCount: 0,
-                current: commit.author.current,
-            };
-            authors.set(author.name, author);
-        }
-        author.lineCount += commit.lines.length;
-    }
-    const sortedAuthors = new Map([...authors.entries()].sort((a, b) => b[1].lineCount - a[1].lineCount));
-    return {
-        repoPath: blame.repoPath,
-        authors: sortedAuthors,
-        commits: commits,
-        lines: lines,
-    };
+* Filters a {@link GitBlame} object to only include lines within the given range.
+* This is a pure data transform — no I/O or provider access needed.
+*
+* @param blame - The full blame to filter
+* @param range - 1-based line range (inclusive)
+*/
+function getBlameRange(blame, range) {
+	if (blame.lines.length === 0) return blame;
+	const startIdx = range.startLine - 1;
+	const endIdx = range.endLine;
+	if (startIdx === 0 && endIdx >= blame.lines.length) return blame;
+	const lines = blame.lines.slice(startIdx, endIdx);
+	const shas = new Set(lines.map((l) => l.sha));
+	const authors = /* @__PURE__ */ new Map();
+	const commits = /* @__PURE__ */ new Map();
+	for (const c of blame.commits.values()) {
+		if (!shas.has(c.sha)) continue;
+		const commit = c.with({ lines: c.lines.filter((l) => l.line >= range.startLine && l.line <= range.endLine) });
+		commits.set(c.sha, commit);
+		let author = authors.get(commit.author.name);
+		if (author == null) {
+			author = {
+				name: commit.author.name,
+				lineCount: 0,
+				current: commit.author.current
+			};
+			authors.set(author.name, author);
+		}
+		author.lineCount += commit.lines.length;
+	}
+	const sortedAuthors = new Map([...authors.entries()].sort((a, b) => b[1].lineCount - a[1].lineCount));
+	return {
+		repoPath: blame.repoPath,
+		authors: sortedAuthors,
+		commits,
+		lines
+	};
 }
 /**
- * Line-level diff optimized for "mostly unchanged" content.
- *
- * Strategy:
- * 1. Strip common prefix (hash + string comparison)
- * 2. Strip common suffix (hash + string comparison)
- * 3. For the small middle section, use hash-map matching with string verification
- *
- * Performance: < 0.1ms for typical edits on files up to 5000 lines.
- */
-export function diffLineMapping(baselineHashes, baselineLines, dirtyLines, dirtyHashes) {
-    if (dirtyHashes == null) {
-        dirtyHashes = new Uint32Array(dirtyLines.length);
-        for (let i = 0; i < dirtyLines.length; i++) {
-            dirtyHashes[i] = fnv1aHash(dirtyLines[i]);
-        }
-    }
-    const baseLen = baselineHashes.length;
-    const dirtyLen = dirtyHashes.length;
-    const minLen = Math.min(baseLen, dirtyLen);
-    // Common prefix scan — hash + string verification to avoid silent collision misattribution
-    let prefixLen = 0;
-    while (prefixLen < minLen &&
-        baselineHashes[prefixLen] === dirtyHashes[prefixLen] &&
-        baselineLines[prefixLen] === dirtyLines[prefixLen]) {
-        prefixLen++;
-    }
-    // Common suffix scan — hash + string verification
-    let suffixLen = 0;
-    const maxSuffix = minLen - prefixLen;
-    while (suffixLen < maxSuffix &&
-        baselineHashes[baseLen - 1 - suffixLen] === dirtyHashes[dirtyLen - 1 - suffixLen] &&
-        baselineLines[baseLen - 1 - suffixLen] === dirtyLines[dirtyLen - 1 - suffixLen]) {
-        suffixLen++;
-    }
-    const baseMiddleStart = prefixLen;
-    const baseMiddleEnd = baseLen - suffixLen;
-    const dirtyMiddleStart = prefixLen;
-    const dirtyMiddleEnd = dirtyLen - suffixLen;
-    const baseMiddleLen = baseMiddleEnd - baseMiddleStart;
-    const dirtyMiddleLen = dirtyMiddleEnd - dirtyMiddleStart;
-    const middleMapping = new Array(dirtyMiddleLen).fill(undefined);
-    if (baseMiddleLen > 0 && dirtyMiddleLen > 0) {
-        // Build a map from hash → list of baseline middle indices
-        const hashToBaseIndices = new Map();
-        for (let i = 0; i < baseMiddleLen; i++) {
-            const h = baselineHashes[baseMiddleStart + i];
-            let indices = hashToBaseIndices.get(h);
-            if (indices == null) {
-                indices = [];
-                hashToBaseIndices.set(h, indices);
-            }
-            indices.push(i);
-        }
-        // For each dirty middle line, find a matching baseline line.
-        // Prefer same relative position first (handles identical lines like "}" or blank
-        // lines staying in place), then fall back to first available hash-map match.
-        const usedBaseIndices = new Set();
-        for (let di = 0; di < dirtyMiddleLen; di++) {
-            const dh = dirtyHashes[dirtyMiddleStart + di];
-            // Positional bias: check same relative position first
-            if (di < baseMiddleLen &&
-                !usedBaseIndices.has(di) &&
-                baselineHashes[baseMiddleStart + di] === dh &&
-                baselineLines[baseMiddleStart + di] === dirtyLines[dirtyMiddleStart + di]) {
-                middleMapping[di] = di;
-                usedBaseIndices.add(di);
-                continue;
-            }
-            // Fall back to first available match from hash-map candidates
-            const candidates = hashToBaseIndices.get(dh);
-            if (candidates == null)
-                continue;
-            for (const bi of candidates) {
-                if (usedBaseIndices.has(bi))
-                    continue;
-                // Verify with string comparison (in case of hash collision)
-                if (baselineLines[baseMiddleStart + bi] === dirtyLines[dirtyMiddleStart + di]) {
-                    middleMapping[di] = bi;
-                    usedBaseIndices.add(bi);
-                    break;
-                }
-            }
-        }
-    }
-    return {
-        prefixLen: prefixLen,
-        suffixLen: suffixLen,
-        baseMiddleStart: baseMiddleStart,
-        baseMiddleEnd: baseMiddleEnd,
-        dirtyMiddleStart: dirtyMiddleStart,
-        dirtyMiddleEnd: dirtyMiddleEnd,
-        middleMapping: middleMapping,
-    };
+* Line-level diff optimized for "mostly unchanged" content.
+*
+* Strategy:
+* 1. Strip common prefix (hash + string comparison)
+* 2. Strip common suffix (hash + string comparison)
+* 3. For the small middle section, use hash-map matching with string verification
+*
+* Performance: < 0.1ms for typical edits on files up to 5000 lines.
+*/
+function diffLineMapping(baselineHashes, baselineLines, dirtyLines, dirtyHashes) {
+	if (dirtyHashes == null) {
+		dirtyHashes = new Uint32Array(dirtyLines.length);
+		for (let i = 0; i < dirtyLines.length; i++) dirtyHashes[i] = fnv1aHash(dirtyLines[i]);
+	}
+	const baseLen = baselineHashes.length;
+	const dirtyLen = dirtyHashes.length;
+	const minLen = Math.min(baseLen, dirtyLen);
+	let prefixLen = 0;
+	while (prefixLen < minLen && baselineHashes[prefixLen] === dirtyHashes[prefixLen] && baselineLines[prefixLen] === dirtyLines[prefixLen]) prefixLen++;
+	let suffixLen = 0;
+	const maxSuffix = minLen - prefixLen;
+	while (suffixLen < maxSuffix && baselineHashes[baseLen - 1 - suffixLen] === dirtyHashes[dirtyLen - 1 - suffixLen] && baselineLines[baseLen - 1 - suffixLen] === dirtyLines[dirtyLen - 1 - suffixLen]) suffixLen++;
+	const baseMiddleStart = prefixLen;
+	const baseMiddleEnd = baseLen - suffixLen;
+	const dirtyMiddleStart = prefixLen;
+	const dirtyMiddleEnd = dirtyLen - suffixLen;
+	const baseMiddleLen = baseMiddleEnd - baseMiddleStart;
+	const dirtyMiddleLen = dirtyMiddleEnd - dirtyMiddleStart;
+	const middleMapping = new Array(dirtyMiddleLen).fill(void 0);
+	if (baseMiddleLen > 0 && dirtyMiddleLen > 0) {
+		const hashToBaseIndices = /* @__PURE__ */ new Map();
+		for (let i = 0; i < baseMiddleLen; i++) {
+			const h = baselineHashes[baseMiddleStart + i];
+			let indices = hashToBaseIndices.get(h);
+			if (indices == null) {
+				indices = [];
+				hashToBaseIndices.set(h, indices);
+			}
+			indices.push(i);
+		}
+		const usedBaseIndices = /* @__PURE__ */ new Set();
+		for (let di = 0; di < dirtyMiddleLen; di++) {
+			const dh = dirtyHashes[dirtyMiddleStart + di];
+			if (di < baseMiddleLen && !usedBaseIndices.has(di) && baselineHashes[baseMiddleStart + di] === dh && baselineLines[baseMiddleStart + di] === dirtyLines[dirtyMiddleStart + di]) {
+				middleMapping[di] = di;
+				usedBaseIndices.add(di);
+				continue;
+			}
+			const candidates = hashToBaseIndices.get(dh);
+			if (candidates == null) continue;
+			for (const bi of candidates) {
+				if (usedBaseIndices.has(bi)) continue;
+				if (baselineLines[baseMiddleStart + bi] === dirtyLines[dirtyMiddleStart + di]) {
+					middleMapping[di] = bi;
+					usedBaseIndices.add(bi);
+					break;
+				}
+			}
+		}
+	}
+	return {
+		prefixLen,
+		suffixLen,
+		baseMiddleStart,
+		baseMiddleEnd,
+		dirtyMiddleStart,
+		dirtyMiddleEnd,
+		middleMapping
+	};
 }
 /**
- * Build a dirty blame result from a clean blame and a line mapping.
- */
-export function buildDirtyBlame(cleanBlame, mapping, dirtyLineCount) {
-    const dirtyBlameLines = new Array(dirtyLineCount);
-    const commits = new Map(cleanBlame.commits);
-    // Prefix lines — direct mapping
-    for (let i = 0; i < mapping.prefixLen; i++) {
-        const cleanLine = cleanBlame.lines[i];
-        if (cleanLine != null) {
-            dirtyBlameLines[i] = { ...cleanLine, line: i + 1 };
-        }
-        else {
-            dirtyBlameLines[i] = makeUncommittedLine(i);
-        }
-    }
-    // Middle section — use the mapping
-    const dirtyMiddleLen = mapping.dirtyMiddleEnd - mapping.dirtyMiddleStart;
-    for (let di = 0; di < dirtyMiddleLen; di++) {
-        const dirtyIdx = mapping.dirtyMiddleStart + di;
-        const baseOffset = mapping.middleMapping[di];
-        if (baseOffset != null) {
-            const baseIdx = mapping.baseMiddleStart + baseOffset;
-            const cleanLine = cleanBlame.lines[baseIdx];
-            if (cleanLine != null) {
-                dirtyBlameLines[dirtyIdx] = { ...cleanLine, line: dirtyIdx + 1 };
-            }
-            else {
-                dirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);
-            }
-        }
-        else {
-            dirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);
-        }
-    }
-    // Suffix lines — direct mapping from end
-    const baseLen = cleanBlame.lines.length;
-    for (let si = 0; si < mapping.suffixLen; si++) {
-        const dirtyIdx = dirtyLineCount - mapping.suffixLen + si;
-        const baseIdx = baseLen - mapping.suffixLen + si;
-        const cleanLine = cleanBlame.lines[baseIdx];
-        if (cleanLine != null) {
-            dirtyBlameLines[dirtyIdx] = { ...cleanLine, line: dirtyIdx + 1 };
-        }
-        else {
-            dirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);
-        }
-    }
-    // Recompute line counts per sha and authors
-    const lineCountsBySha = new Map();
-    for (const blameLine of dirtyBlameLines) {
-        if (blameLine == null)
-            continue;
-        lineCountsBySha.set(blameLine.sha, (lineCountsBySha.get(blameLine.sha) ?? 0) + 1);
-    }
-    const authors = new Map();
-    for (const [sha, lineCount] of lineCountsBySha) {
-        if (sha === uncommitted) {
-            const uncommittedCommit = commits.get(uncommitted);
-            const userName = uncommittedCommit?.author.name ?? '';
-            authors.set(userName, { name: userName, lineCount: lineCount, current: true });
-            continue;
-        }
-        const c = commits.get(sha);
-        if (!c?.author.name)
-            continue;
-        const existing = authors.get(c.author.name);
-        if (existing != null) {
-            existing.lineCount += lineCount;
-        }
-        else {
-            authors.set(c.author.name, { name: c.author.name, lineCount: lineCount, current: c.author.current });
-        }
-    }
-    // Include authors from commits that have no lines in the dirty blame (zero lineCount)
-    for (const [, c] of commits) {
-        if (!c.author.name)
-            continue;
-        if (authors.has(c.author.name))
-            continue;
-        authors.set(c.author.name, { name: c.author.name, lineCount: 0, current: c.author.current });
-    }
-    return {
-        repoPath: cleanBlame.repoPath,
-        authors: authors,
-        commits: commits,
-        lines: dirtyBlameLines,
-    };
+* Build a dirty blame result from a clean blame and a line mapping.
+*/
+function buildDirtyBlame(cleanBlame, mapping, dirtyLineCount) {
+	const dirtyBlameLines = new Array(dirtyLineCount);
+	const commits = new Map(cleanBlame.commits);
+	for (let i = 0; i < mapping.prefixLen; i++) {
+		const cleanLine = cleanBlame.lines[i];
+		if (cleanLine != null) dirtyBlameLines[i] = {
+			...cleanLine,
+			line: i + 1
+		};
+		else dirtyBlameLines[i] = makeUncommittedLine(i);
+	}
+	const dirtyMiddleLen = mapping.dirtyMiddleEnd - mapping.dirtyMiddleStart;
+	for (let di = 0; di < dirtyMiddleLen; di++) {
+		const dirtyIdx = mapping.dirtyMiddleStart + di;
+		const baseOffset = mapping.middleMapping[di];
+		if (baseOffset != null) {
+			const baseIdx = mapping.baseMiddleStart + baseOffset;
+			const cleanLine = cleanBlame.lines[baseIdx];
+			if (cleanLine != null) dirtyBlameLines[dirtyIdx] = {
+				...cleanLine,
+				line: dirtyIdx + 1
+			};
+			else dirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);
+		} else dirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);
+	}
+	const baseLen = cleanBlame.lines.length;
+	for (let si = 0; si < mapping.suffixLen; si++) {
+		const dirtyIdx = dirtyLineCount - mapping.suffixLen + si;
+		const baseIdx = baseLen - mapping.suffixLen + si;
+		const cleanLine = cleanBlame.lines[baseIdx];
+		if (cleanLine != null) dirtyBlameLines[dirtyIdx] = {
+			...cleanLine,
+			line: dirtyIdx + 1
+		};
+		else dirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);
+	}
+	const lineCountsBySha = /* @__PURE__ */ new Map();
+	for (const blameLine of dirtyBlameLines) {
+		if (blameLine == null) continue;
+		lineCountsBySha.set(blameLine.sha, (lineCountsBySha.get(blameLine.sha) ?? 0) + 1);
+	}
+	const authors = /* @__PURE__ */ new Map();
+	for (const [sha, lineCount] of lineCountsBySha) {
+		if (sha === "0000000000000000000000000000000000000000") {
+			const userName = commits.get("0000000000000000000000000000000000000000")?.author.name ?? "";
+			authors.set(userName, {
+				name: userName,
+				lineCount,
+				current: true
+			});
+			continue;
+		}
+		const c = commits.get(sha);
+		if (!c?.author.name) continue;
+		const existing = authors.get(c.author.name);
+		if (existing != null) existing.lineCount += lineCount;
+		else authors.set(c.author.name, {
+			name: c.author.name,
+			lineCount,
+			current: c.author.current
+		});
+	}
+	for (const [, c] of commits) {
+		if (!c.author.name) continue;
+		if (authors.has(c.author.name)) continue;
+		authors.set(c.author.name, {
+			name: c.author.name,
+			lineCount: 0,
+			current: c.author.current
+		});
+	}
+	return {
+		repoPath: cleanBlame.repoPath,
+		authors,
+		commits,
+		lines: dirtyBlameLines
+	};
 }
 function makeUncommittedLine(dirtyIndex) {
-    return {
-        sha: uncommitted,
-        line: dirtyIndex + 1,
-        originalLine: 0,
-    };
+	return {
+		sha: uncommitted,
+		line: dirtyIndex + 1,
+		originalLine: 0
+	};
 }
+//#endregion
+export { buildDirtyBlame, diffLineMapping, getBlameRange };
+
 //# sourceMappingURL=blame.utils.js.map

package/dist/git/utils/blame.utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"blame.utils.js","sourceRoot":"","sources":["../../../src/git/utils/blame.utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAGnD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAGpD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAAe,EAAE,KAAgB;IAC9D,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE3C,iDAAiD;IACjD,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,2CAA2C;IAEzE,IAAI,QAAQ,KAAK,CAAC,IAAI,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAEjE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0B,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,SAAS;QAE/B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC;YACrB,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC;SAChF,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAE3B,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACpB,MAAM,GAAG;gBACR,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;gBACxB,SAAS,EAAE,CAAC;gBACZ,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO;aAC9B,CAAC;YACF,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;IACzC,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEtG,OAAO;QACN,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,OAAO,EAAE,aAAa;QACtB,OAAO,EAAE,OAAO;QAChB,KAAK,EAAE,KAAK;KACZ,CAAC;AACH,CAAC;AAwBD;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAC9B,cAA2B,EAC3B,aAAgC,EAChC,UAA6B,EAC7B,WAAyB;IAEzB,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;QACzB,WAAW,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACF,CAAC;IAED,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC;IACtC,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAE3C,2FAA2F;IAC3F,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OACC,SAAS,GAAG,MAAM;QAClB,cAAc,CAAC,SAAS,CAAC,KAAK,WAAW,CAAC,SAAS,CAAC;QACpD,aAAa,CAAC,SAAS,CAAC,KAAK,UAAU,CAAC,SAAS,CAAC,EACjD,CAAC;QACF,SAAS,EAAE,CAAC;IACb,CAAC;IAED,kDAAkD;IAClD,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,SAAS,GAAG,MAAM,GAAG,SAAS,CAAC;IACrC,OACC,SAAS,GAAG,SAAS;QACrB,cAAc,CAAC,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC,KAAK,WAAW,CAAC,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC;QACjF,aAAa,CAAC,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC,KAAK,UAAU,CAAC,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC,EAC9E,CAAC;QACF,SAAS,EAAE,CAAC;IACb,CAAC;IAED,MAAM,eAAe,GAAG,SAAS,CAAC;IAClC,MAAM,aAAa,GAAG,OAAO,GAAG,SAAS,CAAC;IAC1C,MAAM,gBAAgB,GAAG,SAAS,CAAC;IACnC,MAAM,cAAc,GAAG,QAAQ,GAAG,SAAS,CAAC;IAE5C,MAAM,aAAa,GAAG,aAAa,GAAG,eAAe,CAAC;IACtD,MAAM,cAAc,GAAG,cAAc,GAAG,gBAAgB,CAAC;IAEzD,MAAM,aAAa,GAA2B,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAExF,IAAI,aAAa,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QAC7C,0DAA0D;QAC1D,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAoB,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,cAAc,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;YAC9C,IAAI,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;gBACrB,OAAO,GAAG,EAAE,CAAC;gBACb,iBAAiB,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACnC,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QAED,6DAA6D;QAC7D,iFAAiF;QACjF,6EAA6E;QAC7E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,cAAc,EAAE,EAAE,EAAE,EAAE,CAAC;YAC5C,MAAM,EAAE,GAAG,WAAW,CAAC,gBAAgB,GAAG,EAAE,CAAC,CAAC;YAE9C,sDAAsD;YACtD,IACC,EAAE,GAAG,aAAa;gBAClB,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,cAAc,CAAC,eAAe,GAAG,EAAE,CAAC,KAAK,EAAE;gBAC3C,aAAa,CAAC,eAAe,GAAG,EAAE,CAAC,KAAK,UAAU,CAAC,gBAAgB,GAAG,EAAE,CAAC,EACxE,CAAC;gBACF,aAAa,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBACvB,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxB,SAAS;YACV,CAAC;YAED,8DAA8D;YAC9D,MAAM,UAAU,GAAG,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7C,IAAI,UAAU,IAAI,IAAI;gBAAE,SAAS;YAEjC,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC7B,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAEtC,4DAA4D;gBAC5D,IAAI,aAAa,CAAC,eAAe,GAAG,EAAE,CAAC,KAAK,UAAU,CAAC,gBAAgB,GAAG,EAAE,CAAC,EAAE,CAAC;oBAC/E,aAAa,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;oBACvB,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACxB,MAAM;gBACP,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO;QACN,SAAS,EAAE,SAAS;QACpB,SAAS,EAAE,SAAS;QACpB,eAAe,EAAE,eAAe;QAChC,aAAa,EAAE,aAAa;QAC5B,gBAAgB,EAAE,gBAAgB;QAClC,cAAc,EAAE,cAAc;QAC9B,aAAa,EAAE,aAAa;KAC5B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,UAAoB,EAAE,OAA0B,EAAE,cAAsB;IACvG,MAAM,eAAe,GAAoB,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAE5C,gCAAgC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;YACvB,eAAe,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,CAAC;aAAM,CAAC;YACP,eAAe,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;IACF,CAAC;IAED,mCAAmC;IACnC,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,GAAG,OAAO,CAAC,gBAAgB,CAAC;IACzE,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,cAAc,EAAE,EAAE,EAAE,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,gBAAgB,GAAG,EAAE,CAAC;QAC/C,MAAM,UAAU,GAAG,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAE7C,IAAI,UAAU,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,OAAO,CAAC,eAAe,GAAG,UAAU,CAAC;YACrD,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;gBACvB,eAAe,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,IAAI,EAAE,QAAQ,GAAG,CAAC,EAAE,CAAC;YAClE,CAAC;iBAAM,CAAC;gBACP,eAAe,CAAC,QAAQ,CAAC,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;YAC3D,CAAC;QACF,CAAC;aAAM,CAAC;YACP,eAAe,CAAC,QAAQ,CAAC,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QAC3D,CAAC;IACF,CAAC;IAED,yCAAyC;IACzC,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC;IACxC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/C,MAAM,QAAQ,GAAG,cAAc,GAAG,OAAO,CAAC,SAAS,GAAG,EAAE,CAAC;QACzD,MAAM,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC,SAAS,GAAG,EAAE,CAAC;QACjD,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;YACvB,eAAe,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,IAAI,EAAE,QAAQ,GAAG,CAAC,EAAE,CAAC;QAClE,CAAC;aAAM,CAAC;YACP,eAAe,CAAC,QAAQ,CAAC,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QAC3D,CAAC;IACF,CAAC;IAED,4CAA4C;IAC5C,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,KAAK,MAAM,SAAS,IAAI,eAAe,EAAE,CAAC;QACzC,IAAI,SAAS,IAAI,IAAI;YAAE,SAAS;QAEhC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnF,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0B,CAAC;IAClD,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,eAAe,EAAE,CAAC;QAChD,IAAI,GAAG,KAAK,WAAW,EAAE,CAAC;YACzB,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACnD,MAAM,QAAQ,GAAG,iBAAiB,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACtD,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YAC/E,SAAS;QACV,CAAC;QAED,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI;YAAE,SAAS;QAE9B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACtB,QAAQ,CAAC,SAAS,IAAI,SAAS,CAAC;QACjC,CAAC;aAAM,CAAC;YACP,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;QACtG,CAAC;IACF,CAAC;IAED,sFAAsF;IACtF,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;YAAE,SAAS;QAEzC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;IAC9F,CAAC;IAED,OAAO;QACN,QAAQ,EAAE,UAAU,CAAC,QAAQ;QAC7B,OAAO,EAAE,OAAO;QAChB,OAAO,EAAE,OAAO;QAChB,KAAK,EAAE,eAAe;KACtB,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,UAAkB;IAC9C,OAAO;QACN,GAAG,EAAE,WAAW;QAChB,IAAI,EAAE,UAAU,GAAG,CAAC;QACpB,YAAY,EAAE,CAAC;KACf,CAAC;AACH,CAAC"}
+{"version":3,"file":"blame.utils.js","names":[],"sources":["../../../../git/src/utils/blame.utils.ts"],"sourcesContent":["import { fnv1aHash } from '@gitlens/utils/hash.js';\nimport type { GitBlame, GitBlameAuthor } from '../models/blame.js';\nimport type { GitCommit, GitCommitLine } from '../models/commit.js';\nimport { uncommitted } from '../models/revision.js';\nimport type { DiffRange } from '../providers/types.js';\n\n/**\n * Filters a {@link GitBlame} object to only include lines within the given range.\n * This is a pure data transform — no I/O or provider access needed.\n *\n * @param blame - The full blame to filter\n * @param range - 1-based line range (inclusive)\n */\nexport function getBlameRange(blame: GitBlame, range: DiffRange): GitBlame | undefined {\n\tif (blame.lines.length === 0) return blame;\n\n\t// DiffRange is 1-based; lines array is 0-indexed\n\tconst startIdx = range.startLine - 1;\n\tconst endIdx = range.endLine; // endLine is inclusive, slice is exclusive\n\n\tif (startIdx === 0 && endIdx >= blame.lines.length) return blame;\n\n\tconst lines = blame.lines.slice(startIdx, endIdx);\n\tconst shas = new Set(lines.map(l => l.sha));\n\n\tconst authors = new Map<string, GitBlameAuthor>();\n\tconst commits = new Map<string, GitCommit>();\n\tfor (const c of blame.commits.values()) {\n\t\tif (!shas.has(c.sha)) continue;\n\n\t\tconst commit = c.with({\n\t\t\tlines: c.lines.filter(l => l.line >= range.startLine && l.line <= range.endLine),\n\t\t});\n\t\tcommits.set(c.sha, commit);\n\n\t\tlet author = authors.get(commit.author.name);\n\t\tif (author == null) {\n\t\t\tauthor = {\n\t\t\t\tname: commit.author.name,\n\t\t\t\tlineCount: 0,\n\t\t\t\tcurrent: commit.author.current,\n\t\t\t};\n\t\t\tauthors.set(author.name, author);\n\t\t}\n\n\t\tauthor.lineCount += commit.lines.length;\n\t}\n\n\tconst sortedAuthors = new Map([...authors.entries()].sort((a, b) => b[1].lineCount - a[1].lineCount));\n\n\treturn {\n\t\trepoPath: blame.repoPath,\n\t\tauthors: sortedAuthors,\n\t\tcommits: commits,\n\t\tlines: lines,\n\t};\n}\n\n/** Result of a line-level diff between baseline and dirty content */\nexport interface LineMappingResult {\n\t/** Number of matching lines at the start */\n\treadonly prefixLen: number;\n\t/** Number of matching lines at the end */\n\treadonly suffixLen: number;\n\t/** Start of changed region in baseline (0-based) */\n\treadonly baseMiddleStart: number;\n\t/** End of changed region in baseline (exclusive) */\n\treadonly baseMiddleEnd: number;\n\t/** Start of changed region in dirty (0-based) */\n\treadonly dirtyMiddleStart: number;\n\t/** End of changed region in dirty (exclusive) */\n\treadonly dirtyMiddleEnd: number;\n\t/**\n\t * For lines in the dirty middle section, maps dirty offset → baseline offset.\n\t * Undefined means the line is new/modified (uncommitted).\n\t * Indices are relative to the middle section starts.\n\t */\n\treadonly middleMapping: (number | undefined)[];\n}\n\n/**\n * Line-level diff optimized for \"mostly unchanged\" content.\n *\n * Strategy:\n * 1. Strip common prefix (hash + string comparison)\n * 2. Strip common suffix (hash + string comparison)\n * 3. For the small middle section, use hash-map matching with string verification\n *\n * Performance: < 0.1ms for typical edits on files up to 5000 lines.\n */\nexport function diffLineMapping(\n\tbaselineHashes: Uint32Array,\n\tbaselineLines: readonly string[],\n\tdirtyLines: readonly string[],\n\tdirtyHashes?: Uint32Array,\n): LineMappingResult {\n\tif (dirtyHashes == null) {\n\t\tdirtyHashes = new Uint32Array(dirtyLines.length);\n\t\tfor (let i = 0; i < dirtyLines.length; i++) {\n\t\t\tdirtyHashes[i] = fnv1aHash(dirtyLines[i]);\n\t\t}\n\t}\n\n\tconst baseLen = baselineHashes.length;\n\tconst dirtyLen = dirtyHashes.length;\n\tconst minLen = Math.min(baseLen, dirtyLen);\n\n\t// Common prefix scan — hash + string verification to avoid silent collision misattribution\n\tlet prefixLen = 0;\n\twhile (\n\t\tprefixLen < minLen &&\n\t\tbaselineHashes[prefixLen] === dirtyHashes[prefixLen] &&\n\t\tbaselineLines[prefixLen] === dirtyLines[prefixLen]\n\t) {\n\t\tprefixLen++;\n\t}\n\n\t// Common suffix scan — hash + string verification\n\tlet suffixLen = 0;\n\tconst maxSuffix = minLen - prefixLen;\n\twhile (\n\t\tsuffixLen < maxSuffix &&\n\t\tbaselineHashes[baseLen - 1 - suffixLen] === dirtyHashes[dirtyLen - 1 - suffixLen] &&\n\t\tbaselineLines[baseLen - 1 - suffixLen] === dirtyLines[dirtyLen - 1 - suffixLen]\n\t) {\n\t\tsuffixLen++;\n\t}\n\n\tconst baseMiddleStart = prefixLen;\n\tconst baseMiddleEnd = baseLen - suffixLen;\n\tconst dirtyMiddleStart = prefixLen;\n\tconst dirtyMiddleEnd = dirtyLen - suffixLen;\n\n\tconst baseMiddleLen = baseMiddleEnd - baseMiddleStart;\n\tconst dirtyMiddleLen = dirtyMiddleEnd - dirtyMiddleStart;\n\n\tconst middleMapping: (number | undefined)[] = new Array(dirtyMiddleLen).fill(undefined);\n\n\tif (baseMiddleLen > 0 && dirtyMiddleLen > 0) {\n\t\t// Build a map from hash → list of baseline middle indices\n\t\tconst hashToBaseIndices = new Map<number, number[]>();\n\t\tfor (let i = 0; i < baseMiddleLen; i++) {\n\t\t\tconst h = baselineHashes[baseMiddleStart + i];\n\t\t\tlet indices = hashToBaseIndices.get(h);\n\t\t\tif (indices == null) {\n\t\t\t\tindices = [];\n\t\t\t\thashToBaseIndices.set(h, indices);\n\t\t\t}\n\t\t\tindices.push(i);\n\t\t}\n\n\t\t// For each dirty middle line, find a matching baseline line.\n\t\t// Prefer same relative position first (handles identical lines like \"}\" or blank\n\t\t// lines staying in place), then fall back to first available hash-map match.\n\t\tconst usedBaseIndices = new Set<number>();\n\t\tfor (let di = 0; di < dirtyMiddleLen; di++) {\n\t\t\tconst dh = dirtyHashes[dirtyMiddleStart + di];\n\n\t\t\t// Positional bias: check same relative position first\n\t\t\tif (\n\t\t\t\tdi < baseMiddleLen &&\n\t\t\t\t!usedBaseIndices.has(di) &&\n\t\t\t\tbaselineHashes[baseMiddleStart + di] === dh &&\n\t\t\t\tbaselineLines[baseMiddleStart + di] === dirtyLines[dirtyMiddleStart + di]\n\t\t\t) {\n\t\t\t\tmiddleMapping[di] = di;\n\t\t\t\tusedBaseIndices.add(di);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Fall back to first available match from hash-map candidates\n\t\t\tconst candidates = hashToBaseIndices.get(dh);\n\t\t\tif (candidates == null) continue;\n\n\t\t\tfor (const bi of candidates) {\n\t\t\t\tif (usedBaseIndices.has(bi)) continue;\n\n\t\t\t\t// Verify with string comparison (in case of hash collision)\n\t\t\t\tif (baselineLines[baseMiddleStart + bi] === dirtyLines[dirtyMiddleStart + di]) {\n\t\t\t\t\tmiddleMapping[di] = bi;\n\t\t\t\t\tusedBaseIndices.add(bi);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn {\n\t\tprefixLen: prefixLen,\n\t\tsuffixLen: suffixLen,\n\t\tbaseMiddleStart: baseMiddleStart,\n\t\tbaseMiddleEnd: baseMiddleEnd,\n\t\tdirtyMiddleStart: dirtyMiddleStart,\n\t\tdirtyMiddleEnd: dirtyMiddleEnd,\n\t\tmiddleMapping: middleMapping,\n\t};\n}\n\n/**\n * Build a dirty blame result from a clean blame and a line mapping.\n */\nexport function buildDirtyBlame(cleanBlame: GitBlame, mapping: LineMappingResult, dirtyLineCount: number): GitBlame {\n\tconst dirtyBlameLines: GitCommitLine[] = new Array(dirtyLineCount);\n\tconst commits = new Map(cleanBlame.commits);\n\n\t// Prefix lines — direct mapping\n\tfor (let i = 0; i < mapping.prefixLen; i++) {\n\t\tconst cleanLine = cleanBlame.lines[i];\n\t\tif (cleanLine != null) {\n\t\t\tdirtyBlameLines[i] = { ...cleanLine, line: i + 1 };\n\t\t} else {\n\t\t\tdirtyBlameLines[i] = makeUncommittedLine(i);\n\t\t}\n\t}\n\n\t// Middle section — use the mapping\n\tconst dirtyMiddleLen = mapping.dirtyMiddleEnd - mapping.dirtyMiddleStart;\n\tfor (let di = 0; di < dirtyMiddleLen; di++) {\n\t\tconst dirtyIdx = mapping.dirtyMiddleStart + di;\n\t\tconst baseOffset = mapping.middleMapping[di];\n\n\t\tif (baseOffset != null) {\n\t\t\tconst baseIdx = mapping.baseMiddleStart + baseOffset;\n\t\t\tconst cleanLine = cleanBlame.lines[baseIdx];\n\t\t\tif (cleanLine != null) {\n\t\t\t\tdirtyBlameLines[dirtyIdx] = { ...cleanLine, line: dirtyIdx + 1 };\n\t\t\t} else {\n\t\t\t\tdirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);\n\t\t\t}\n\t\t} else {\n\t\t\tdirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);\n\t\t}\n\t}\n\n\t// Suffix lines — direct mapping from end\n\tconst baseLen = cleanBlame.lines.length;\n\tfor (let si = 0; si < mapping.suffixLen; si++) {\n\t\tconst dirtyIdx = dirtyLineCount - mapping.suffixLen + si;\n\t\tconst baseIdx = baseLen - mapping.suffixLen + si;\n\t\tconst cleanLine = cleanBlame.lines[baseIdx];\n\t\tif (cleanLine != null) {\n\t\t\tdirtyBlameLines[dirtyIdx] = { ...cleanLine, line: dirtyIdx + 1 };\n\t\t} else {\n\t\t\tdirtyBlameLines[dirtyIdx] = makeUncommittedLine(dirtyIdx);\n\t\t}\n\t}\n\n\t// Recompute line counts per sha and authors\n\tconst lineCountsBySha = new Map<string, number>();\n\tfor (const blameLine of dirtyBlameLines) {\n\t\tif (blameLine == null) continue;\n\n\t\tlineCountsBySha.set(blameLine.sha, (lineCountsBySha.get(blameLine.sha) ?? 0) + 1);\n\t}\n\n\tconst authors = new Map<string, GitBlameAuthor>();\n\tfor (const [sha, lineCount] of lineCountsBySha) {\n\t\tif (sha === uncommitted) {\n\t\t\tconst uncommittedCommit = commits.get(uncommitted);\n\t\t\tconst userName = uncommittedCommit?.author.name ?? '';\n\t\t\tauthors.set(userName, { name: userName, lineCount: lineCount, current: true });\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst c = commits.get(sha);\n\t\tif (!c?.author.name) continue;\n\n\t\tconst existing = authors.get(c.author.name);\n\t\tif (existing != null) {\n\t\t\texisting.lineCount += lineCount;\n\t\t} else {\n\t\t\tauthors.set(c.author.name, { name: c.author.name, lineCount: lineCount, current: c.author.current });\n\t\t}\n\t}\n\n\t// Include authors from commits that have no lines in the dirty blame (zero lineCount)\n\tfor (const [, c] of commits) {\n\t\tif (!c.author.name) continue;\n\t\tif (authors.has(c.author.name)) continue;\n\n\t\tauthors.set(c.author.name, { name: c.author.name, lineCount: 0, current: c.author.current });\n\t}\n\n\treturn {\n\t\trepoPath: cleanBlame.repoPath,\n\t\tauthors: authors,\n\t\tcommits: commits,\n\t\tlines: dirtyBlameLines,\n\t};\n}\n\nfunction makeUncommittedLine(dirtyIndex: number): GitCommitLine {\n\treturn {\n\t\tsha: uncommitted,\n\t\tline: dirtyIndex + 1,\n\t\toriginalLine: 0,\n\t};\n}\n"],"mappings":";;;;;;;;;;AAaA,SAAgB,cAAc,OAAiB,OAAwC;CACtF,IAAI,MAAM,MAAM,WAAW,GAAG,OAAO;CAGrC,MAAM,WAAW,MAAM,YAAY;CACnC,MAAM,SAAS,MAAM;CAErB,IAAI,aAAa,KAAK,UAAU,MAAM,MAAM,QAAQ,OAAO;CAE3D,MAAM,QAAQ,MAAM,MAAM,MAAM,UAAU,MAAM;CAChD,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,MAAK,EAAE,GAAG,CAAC;CAE1C,MAAM,0BAAU,IAAI,IAA4B;CAChD,MAAM,0BAAU,IAAI,IAAuB;CAC3C,KAAK,MAAM,KAAK,MAAM,QAAQ,OAAO,GAAG;EACvC,IAAI,CAAC,KAAK,IAAI,EAAE,GAAG,GAAG;EAEtB,MAAM,SAAS,EAAE,KAAK,EACrB,OAAO,EAAE,MAAM,QAAO,MAAK,EAAE,QAAQ,MAAM,aAAa,EAAE,QAAQ,MAAM,OAAO,EAChF,CAAC;EACD,QAAQ,IAAI,EAAE,KAAK,MAAM;EAEzB,IAAI,SAAS,QAAQ,IAAI,OAAO,OAAO,IAAI;EAC3C,IAAI,UAAU,MAAM;GACnB,SAAS;IACR,MAAM,OAAO,OAAO;IACpB,WAAW;IACX,SAAS,OAAO,OAAO;GACxB;GACA,QAAQ,IAAI,OAAO,MAAM,MAAM;EAChC;EAEA,OAAO,aAAa,OAAO,MAAM;CAClC;CAEA,MAAM,gBAAgB,IAAI,IAAI,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC,YAAY,EAAE,EAAE,CAAC,SAAS,CAAC;CAEpG,OAAO;EACN,UAAU,MAAM;EAChB,SAAS;EACA;EACF;CACR;AACD;;;;;;;;;;;AAkCA,SAAgB,gBACf,gBACA,eACA,YACA,aACoB;CACpB,IAAI,eAAe,MAAM;EACxB,cAAc,IAAI,YAAY,WAAW,MAAM;EAC/C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KACtC,YAAY,KAAK,UAAU,WAAW,EAAE;CAE1C;CAEA,MAAM,UAAU,eAAe;CAC/B,MAAM,WAAW,YAAY;CAC7B,MAAM,SAAS,KAAK,IAAI,SAAS,QAAQ;CAGzC,IAAI,YAAY;CAChB,OACC,YAAY,UACZ,eAAe,eAAe,YAAY,cAC1C,cAAc,eAAe,WAAW,YAExC;CAID,IAAI,YAAY;CAChB,MAAM,YAAY,SAAS;CAC3B,OACC,YAAY,aACZ,eAAe,UAAU,IAAI,eAAe,YAAY,WAAW,IAAI,cACvE,cAAc,UAAU,IAAI,eAAe,WAAW,WAAW,IAAI,YAErE;CAGD,MAAM,kBAAkB;CACxB,MAAM,gBAAgB,UAAU;CAChC,MAAM,mBAAmB;CACzB,MAAM,iBAAiB,WAAW;CAElC,MAAM,gBAAgB,gBAAgB;CACtC,MAAM,iBAAiB,iBAAiB;CAExC,MAAM,gBAAwC,IAAI,MAAM,cAAc,CAAC,CAAC,KAAK,KAAA,CAAS;CAEtF,IAAI,gBAAgB,KAAK,iBAAiB,GAAG;EAE5C,MAAM,oCAAoB,IAAI,IAAsB;EACpD,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,KAAK;GACvC,MAAM,IAAI,eAAe,kBAAkB;GAC3C,IAAI,UAAU,kBAAkB,IAAI,CAAC;GACrC,IAAI,WAAW,MAAM;IACpB,UAAU,CAAC;IACX,kBAAkB,IAAI,GAAG,OAAO;GACjC;GACA,QAAQ,KAAK,CAAC;EACf;EAKA,MAAM,kCAAkB,IAAI,IAAY;EACxC,KAAK,IAAI,KAAK,GAAG,KAAK,gBAAgB,MAAM;GAC3C,MAAM,KAAK,YAAY,mBAAmB;GAG1C,IACC,KAAK,iBACL,CAAC,gBAAgB,IAAI,EAAE,KACvB,eAAe,kBAAkB,QAAQ,MACzC,cAAc,kBAAkB,QAAQ,WAAW,mBAAmB,KACrE;IACD,cAAc,MAAM;IACpB,gBAAgB,IAAI,EAAE;IACtB;GACD;GAGA,MAAM,aAAa,kBAAkB,IAAI,EAAE;GAC3C,IAAI,cAAc,MAAM;GAExB,KAAK,MAAM,MAAM,YAAY;IAC5B,IAAI,gBAAgB,IAAI,EAAE,GAAG;IAG7B,IAAI,cAAc,kBAAkB,QAAQ,WAAW,mBAAmB,KAAK;KAC9E,cAAc,MAAM;KACpB,gBAAgB,IAAI,EAAE;KACtB;IACD;GACD;EACD;CACD;CAEA,OAAO;EACK;EACA;EACM;EACF;EACG;EACF;EACD;CAChB;AACD;;;;AAKA,SAAgB,gBAAgB,YAAsB,SAA4B,gBAAkC;CACnH,MAAM,kBAAmC,IAAI,MAAM,cAAc;CACjE,MAAM,UAAU,IAAI,IAAI,WAAW,OAAO;CAG1C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,WAAW,KAAK;EAC3C,MAAM,YAAY,WAAW,MAAM;EACnC,IAAI,aAAa,MAChB,gBAAgB,KAAK;GAAE,GAAG;GAAW,MAAM,IAAI;EAAE;OAEjD,gBAAgB,KAAK,oBAAoB,CAAC;CAE5C;CAGA,MAAM,iBAAiB,QAAQ,iBAAiB,QAAQ;CACxD,KAAK,IAAI,KAAK,GAAG,KAAK,gBAAgB,MAAM;EAC3C,MAAM,WAAW,QAAQ,mBAAmB;EAC5C,MAAM,aAAa,QAAQ,cAAc;EAEzC,IAAI,cAAc,MAAM;GACvB,MAAM,UAAU,QAAQ,kBAAkB;GAC1C,MAAM,YAAY,WAAW,MAAM;GACnC,IAAI,aAAa,MAChB,gBAAgB,YAAY;IAAE,GAAG;IAAW,MAAM,WAAW;GAAE;QAE/D,gBAAgB,YAAY,oBAAoB,QAAQ;EAE1D,OACC,gBAAgB,YAAY,oBAAoB,QAAQ;CAE1D;CAGA,MAAM,UAAU,WAAW,MAAM;CACjC,KAAK,IAAI,KAAK,GAAG,KAAK,QAAQ,WAAW,MAAM;EAC9C,MAAM,WAAW,iBAAiB,QAAQ,YAAY;EACtD,MAAM,UAAU,UAAU,QAAQ,YAAY;EAC9C,MAAM,YAAY,WAAW,MAAM;EACnC,IAAI,aAAa,MAChB,gBAAgB,YAAY;GAAE,GAAG;GAAW,MAAM,WAAW;EAAE;OAE/D,gBAAgB,YAAY,oBAAoB,QAAQ;CAE1D;CAGA,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,aAAa,iBAAiB;EACxC,IAAI,aAAa,MAAM;EAEvB,gBAAgB,IAAI,UAAU,MAAM,gBAAgB,IAAI,UAAU,GAAG,KAAK,KAAK,CAAC;CACjF;CAEA,MAAM,0BAAU,IAAI,IAA4B;CAChD,KAAK,MAAM,CAAC,KAAK,cAAc,iBAAiB;EAC/C,IAAI,QAAA,4CAAqB;GAExB,MAAM,WADoB,QAAQ,IAAA,0CACD,CAAC,EAAE,OAAO,QAAQ;GACnD,QAAQ,IAAI,UAAU;IAAE,MAAM;IAAqB;IAAW,SAAS;GAAK,CAAC;GAC7E;EACD;EAEA,MAAM,IAAI,QAAQ,IAAI,GAAG;EACzB,IAAI,CAAC,GAAG,OAAO,MAAM;EAErB,MAAM,WAAW,QAAQ,IAAI,EAAE,OAAO,IAAI;EAC1C,IAAI,YAAY,MACf,SAAS,aAAa;OAEtB,QAAQ,IAAI,EAAE,OAAO,MAAM;GAAE,MAAM,EAAE,OAAO;GAAiB;GAAW,SAAS,EAAE,OAAO;EAAQ,CAAC;CAErG;CAGA,KAAK,MAAM,GAAG,MAAM,SAAS;EAC5B,IAAI,CAAC,EAAE,OAAO,MAAM;EACpB,IAAI,QAAQ,IAAI,EAAE,OAAO,IAAI,GAAG;EAEhC,QAAQ,IAAI,EAAE,OAAO,MAAM;GAAE,MAAM,EAAE,OAAO;GAAM,WAAW;GAAG,SAAS,EAAE,OAAO;EAAQ,CAAC;CAC5F;CAEA,OAAO;EACN,UAAU,WAAW;EACZ;EACA;EACT,OAAO;CACR;AACD;AAEA,SAAS,oBAAoB,YAAmC;CAC/D,OAAO;EACN,KAAK;EACL,MAAM,aAAa;EACnB,cAAc;CACf;AACD"}

package/dist/git/utils/branch.utils.d.ts

@@ -1,22 +1,20 @@
-import type { PageableResult } from '../../utils/paging.js';
-import type { GitBranch, GitTrackingUpstream } from '../models/branch.js';
-import type { GitBranchReference, GitReference } from '../models/reference.js';
+import { PageableResult } from "../../utils/paging.js";
+import { GitBranchReference, GitReference } from "../models/reference.js";
+import { GitBranch, GitTrackingUpstream } from "../models/branch.js";
+//#region ../git/src/utils/branch.utils.d.ts
 export declare function formatDetachedHeadName(sha: string): string;
-export declare function getBranchId(repoPath: string, remote: boolean, name: string): string;
 export declare function getBranchNameAndRemote(ref: GitBranchReference): [name: string, remote: string | undefined];
-export declare function getBranchNameWithoutRemote(name: string): string;
 export declare function getBranchTrackingWithoutRemote(ref: GitBranchReference): string | undefined;
-export declare function getRemoteNameFromBranchName(name: string): string;
-export declare function getRemoteNameSlashIndex(name: string): number;
 export declare function isDetachedHead(name: string): boolean;
 export declare function isOfBranchRefType(branch: GitReference | undefined): branch is GitBranchReference;
 export declare function isRemoteBranch(refName: string): boolean;
 export declare function isRemoteHEAD(refName: string): boolean;
 export declare function parseRefName(refName: string): {
-    name: string;
-    remote: boolean;
+  name: string;
+  remote: boolean;
 };
 export declare function getLocalBranchByUpstream(remoteBranchName: string, branches: PageableResult<GitBranch> | ReadonlyMap<unknown, GitBranch>): Promise<GitBranch | undefined>;
 export declare function getLocalBranchUpstreamNames(branches: PageableResult<GitBranch>): Promise<Set<string>>;
 export declare function parseUpstream(upstream: string, tracking: string): GitTrackingUpstream | undefined;
+//#endregion
 //# sourceMappingURL=branch.utils.d.ts.map