git-fs-s3 0.4.0 → 0.6.0

package/dist/ops.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/ops/commit.ts","../src/ops/tree.ts","../src/ops/diff.ts","../src/ops/history.ts","../src/ops/types.ts","../src/ops/file-history.ts","../src/ops/last-commit.ts","../src/ops/merge.ts"],"sourcesContent":["import git from \"isomorphic-git\";\nimport { assertSafeBranchName } from \"./branch.js\";\nimport { deleteFromTree, upsertTree } from \"./tree.js\";\nimport type { Repo } from \"./types.js\";\n\nexport interface CommitAuthor {\n\tname: string;\n\temail: string;\n\ttimestamp: number;\n\ttimezoneOffset: number;\n}\n\n/** An author stamped with the current time. */\nexport function authorNow(name: string, email: string): CommitAuthor {\n\treturn {\n\t\tname,\n\t\temail,\n\t\ttimestamp: Math.floor(Date.now() / 1000),\n\t\ttimezoneOffset: 0,\n\t};\n}\n\n/**\n * Write a commit directly to a bare repository — no worktree, no checkout.\n * `buildTree` receives the parent commit's tree oid (undefined on an empty\n * repo / unborn branch) and returns the new root tree oid; this function\n * writes the commit object and force-updates `refs/heads/<branch>`.\n *\n * Serialize concurrent writers externally (a per-repo lock): the\n * resolve-ref → write-ref sequence is not atomic on object storage.\n */\nexport async function writeCommitToBare(\n\trepo: Repo,\n\toptions: {\n\t\tbranch: string;\n\t\tmessage: string;\n\t\tauthor: CommitAuthor;\n\t\tbuildTree: (parentTreeOid: string | undefined) => Promise<string>;\n\t},\n): Promise<string> {\n\tassertSafeBranchName(options.branch);\n\tlet parentOid: string | undefined;\n\tlet parentTreeOid: string | undefined;\n\ttry {\n\t\tparentOid = await git.resolveRef({\n\t\t\t...repo,\n\t\t\tref: `refs/heads/${options.branch}`,\n\t\t});\n\t\tconst { commit } = await git.readCommit({ ...repo, oid: parentOid });\n\t\tparentTreeOid = commit.tree;\n\t} catch (err) {\n\t\tif ((err as { code?: string })?.code !== \"NotFoundError\") {\n\t\t\tthrow err;\n\t\t}\n\t\t// empty repo — first commit\n\t}\n\tconst treeOid = await options.buildTree(parentTreeOid);\n\tconst commitOid = await git.writeCommit({\n\t\t...repo,\n\t\tcommit: {\n\t\t\tmessage: options.message,\n\t\t\ttree: treeOid,\n\t\t\tparent: parentOid ? [parentOid] : [],\n\t\t\tauthor: options.author,\n\t\t\tcommitter: options.author,\n\t\t},\n\t});\n\tawait git.writeRef({\n\t\t...repo,\n\t\tref: `refs/heads/${options.branch}`,\n\t\tvalue: commitOid,\n\t\tforce: true,\n\t});\n\treturn commitOid;\n}\n\n/**\n * Commit a set of files onto a branch, straight to the bare repo. Each blob\n * is written to its own content-addressed key — no shared state between\n * files, so they're written in parallel.\n */\nexport function commitFilesToBare(\n\trepo: Repo,\n\toptions: {\n\t\tbranch: string;\n\t\tmessage: string;\n\t\tauthor: CommitAuthor;\n\t\tfiles: Array<{ path: string; content: string | Uint8Array }>;\n\t},\n): Promise<string> {\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid) => {\n\t\t\tconst blobs = new Map<string, string>();\n\t\t\tawait Promise.all(\n\t\t\t\toptions.files.map(async (file) => {\n\t\t\t\t\tconst content =\n\t\t\t\t\t\ttypeof file.content === \"string\"\n\t\t\t\t\t\t\t? new TextEncoder().encode(file.content)\n\t\t\t\t\t\t\t: file.content;\n\t\t\t\t\tconst oid = await git.writeBlob({ ...repo, blob: content });\n\t\t\t\t\tblobs.set(file.path, oid);\n\t\t\t\t}),\n\t\t\t);\n\t\t\treturn upsertTree(repo, parentTreeOid, blobs);\n\t\t},\n\t});\n}\n\n/** Commit the removal of one file from a branch, straight to the bare repo. */\nexport function deleteFileFromBare(\n\trepo: Repo,\n\toptions: {\n\t\tbranch: string;\n\t\tfilePath: string;\n\t\tmessage: string;\n\t\tauthor: CommitAuthor;\n\t},\n): Promise<string> {\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid) => {\n\t\t\tif (!parentTreeOid) {\n\t\t\t\tthrow new Error(`Branch ${options.branch} is empty`);\n\t\t\t}\n\t\t\treturn deleteFromTree(repo, parentTreeOid, options.filePath);\n\t\t},\n\t});\n}\n","import git from \"isomorphic-git\";\nimport type { Repo } from \"./types.js\";\n\nexport interface TreeEntry {\n\tpath: string;\n\tmode: string;\n\ttype: \"blob\" | \"tree\";\n\toid: string;\n\tsize?: number;\n}\n\nconst joinPath = (prefix: string, name: string) =>\n\tprefix ? `${prefix.replace(/\\/+$/, \"\")}/${name}` : name;\n\n/**\n * Build/update a git tree by overlaying new blobs onto an existing tree,\n * returning the new root tree oid. `entries` maps relative paths to blob oids.\n */\nexport async function upsertTree(\n\trepo: Repo,\n\ttreeOid: string | undefined,\n\tentries: Map<string, string>,\n): Promise<string> {\n\tconst existing = treeOid\n\t\t? (await git.readTree({ ...repo, oid: treeOid })).tree\n\t\t: [];\n\tconst byName = new Map(existing.map((e) => [e.path, e]));\n\tconst direct = new Map<string, string>();\n\tconst nested = new Map<string, Map<string, string>>();\n\tfor (const [filePath, blobOid] of entries) {\n\t\tconst slash = filePath.indexOf(\"/\");\n\t\tif (slash === -1) {\n\t\t\tdirect.set(filePath, blobOid);\n\t\t} else {\n\t\t\tconst dir = filePath.slice(0, slash);\n\t\t\tconst rest = filePath.slice(slash + 1);\n\t\t\tif (!nested.has(dir)) nested.set(dir, new Map());\n\t\t\tnested.get(dir)?.set(rest, blobOid);\n\t\t}\n\t}\n\tfor (const [name, blobOid] of direct) {\n\t\tbyName.set(name, {\n\t\t\tmode: \"100644\",\n\t\t\tpath: name,\n\t\t\toid: blobOid,\n\t\t\ttype: \"blob\",\n\t\t});\n\t}\n\t// Sibling subdirectories are independent subtree writes — no reason to\n\t// serialize them for multi-file commits touching several directories.\n\tconst nestedResults = await Promise.all(\n\t\tArray.from(nested, async ([dir, subEntries]) => {\n\t\t\tconst entry = byName.get(dir);\n\t\t\tconst subtreeOid = entry?.type === \"tree\" ? entry.oid : undefined;\n\t\t\tconst newOid = await upsertTree(repo, subtreeOid, subEntries);\n\t\t\treturn [dir, newOid] as const;\n\t\t}),\n\t);\n\tfor (const [dir, newOid] of nestedResults) {\n\t\tbyName.set(dir, { mode: \"040000\", path: dir, oid: newOid, type: \"tree\" });\n\t}\n\treturn git.writeTree({ ...repo, tree: Array.from(byName.values()) });\n}\n\n/** Remove a file path from a tree, returning the new root tree oid. */\nexport async function deleteFromTree(\n\trepo: Repo,\n\ttreeOid: string,\n\tfilePath: string,\n): Promise<string> {\n\tconst existing = (await git.readTree({ ...repo, oid: treeOid })).tree;\n\tconst byName = new Map(existing.map((e) => [e.path, e]));\n\tconst slash = filePath.indexOf(\"/\");\n\tif (slash === -1) {\n\t\tbyName.delete(filePath);\n\t} else {\n\t\tconst dir = filePath.slice(0, slash);\n\t\tconst rest = filePath.slice(slash + 1);\n\t\tconst entry = byName.get(dir);\n\t\tif (entry?.type === \"tree\") {\n\t\t\tconst newOid = await deleteFromTree(repo, entry.oid, rest);\n\t\t\tbyName.set(dir, { ...entry, oid: newOid });\n\t\t}\n\t}\n\treturn git.writeTree({ ...repo, tree: Array.from(byName.values()) });\n}\n\n/** Resolve a path inside a tree to its entry, or null when absent. */\nexport async function findTreeEntry(\n\trepo: Repo,\n\trootTreeOid: string,\n\ttreePath: string,\n): Promise<TreeEntry | null> {\n\tif (!treePath) {\n\t\treturn { path: \"\", mode: \"040000\", type: \"tree\", oid: rootTreeOid };\n\t}\n\n\tconst parts = treePath.split(\"/\").filter(Boolean);\n\tlet currentTreeOid = rootTreeOid;\n\tlet currentPath = \"\";\n\n\tfor (const [index, part] of parts.entries()) {\n\t\tconst tree = await git.readTree({ ...repo, oid: currentTreeOid });\n\t\tconst entry = tree.tree.find((candidate) => candidate.path === part);\n\n\t\tif (!entry) return null;\n\n\t\tcurrentPath = currentPath ? joinPath(currentPath, entry.path) : entry.path;\n\n\t\tif (index === parts.length - 1) {\n\t\t\treturn {\n\t\t\t\tpath: currentPath,\n\t\t\t\tmode: entry.mode,\n\t\t\t\ttype: entry.type as \"blob\" | \"tree\",\n\t\t\t\toid: entry.oid,\n\t\t\t};\n\t\t}\n\n\t\tif (entry.type !== \"tree\") return null;\n\n\t\tcurrentTreeOid = entry.oid;\n\t}\n\n\treturn null;\n}\n\n/** List a tree's direct entries, with paths prefixed by `prefix`. */\nexport async function listTreeEntries(\n\trepo: Repo,\n\ttreeOid: string,\n\tprefix = \"\",\n): Promise<TreeEntry[]> {\n\tconst tree = await git.readTree({ ...repo, oid: treeOid });\n\n\treturn tree.tree.map((entry) => ({\n\t\tpath: prefix ? joinPath(prefix, entry.path) : entry.path,\n\t\tmode: entry.mode,\n\t\ttype: entry.type as \"blob\" | \"tree\",\n\t\toid: entry.oid,\n\t}));\n}\n","import { createTwoFilesPatch } from \"diff\";\nimport git from \"isomorphic-git\";\nimport { readBlobContent, toBase64 } from \"../edge-utils.js\";\nimport { qualifyBranchRef } from \"../refs.js\";\nimport { getCommit } from \"./history.js\";\nimport type { Repo } from \"./types.js\";\n\nexport interface DiffFile {\n\tpath: string;\n\tstatus: \"added\" | \"modified\" | \"deleted\" | \"renamed\";\n\tadditions: number;\n\tdeletions: number;\n\tpatch: string;\n\toldPath?: string;\n\tisBinary?: boolean;\n\toldContent?: string;\n\tnewContent?: string;\n\toldSize?: number;\n\tnewSize?: number;\n}\n\nexport interface DiffResult {\n\tfiles: DiffFile[];\n\ttotalAdditions: number;\n\ttotalDeletions: number;\n\ttotalFiles: number;\n}\n\n/** Binary detection via null-byte heuristic. */\nfunction detectBlobContent(blob: Uint8Array): {\n\tisBinary: boolean;\n\ttext: string;\n\tbytes: Uint8Array;\n} {\n\treturn readBlobContent(blob);\n}\n\nfunction countContentLines(content: string): number {\n\tif (content.length === 0) return 0;\n\tconst lines = content.split(\"\\n\");\n\tif (lines[lines.length - 1] === \"\") lines.pop();\n\treturn lines.length;\n}\n\nfunction createUnifiedPatch(params: {\n\tpath: string;\n\tbefore: string;\n\tafter: string;\n\toldPath?: string;\n\tnewPath?: string;\n}): string {\n\tconst oldPath = params.oldPath ?? `a/${params.path}`;\n\tconst newPath = params.newPath ?? `b/${params.path}`;\n\tconst patchBody = createTwoFilesPatch(\n\t\toldPath,\n\t\tnewPath,\n\t\tparams.before,\n\t\tparams.after,\n\t\t\"\",\n\t\t\"\",\n\t\t{ context: 3 },\n\t).replace(/^=+\\n/, \"\");\n\n\treturn `diff --git a/${params.path} b/${params.path}\\n${patchBody}`;\n}\n\nfunction summarizeDiff(files: DiffFile[]): DiffResult {\n\treturn {\n\t\tfiles,\n\t\ttotalAdditions: files.reduce((sum, f) => sum + f.additions, 0),\n\t\ttotalDeletions: files.reduce((sum, f) => sum + f.deletions, 0),\n\t\ttotalFiles: files.length,\n\t};\n}\n\ntype BlobContent = { isBinary: boolean; text: string; bytes: Uint8Array };\n\n/**\n * Build one `DiffFile` from a path's before/after content — `before: null`\n * for an added file, `after: null` for a deleted one, both present for a\n * modification. The shared core of walkTreeDiff's three branches and\n * getCommitDiff's root-commit case (every file is an addition there, with no\n * two-tree walk to drive it), which each used to duplicate this field\n * construction independently.\n */\nfunction buildDiffFile(\n\tpath: string,\n\tstatus: DiffFile[\"status\"],\n\tbefore: BlobContent | null,\n\tafter: BlobContent | null,\n): DiffFile {\n\tconst isBinary = !!(before?.isBinary || after?.isBinary);\n\treturn {\n\t\tpath,\n\t\tstatus,\n\t\tadditions: !isBinary && after ? countContentLines(after.text) : 0,\n\t\tdeletions: !isBinary && before ? countContentLines(before.text) : 0,\n\t\tpatch: isBinary\n\t\t\t? \"\"\n\t\t\t: createUnifiedPatch({\n\t\t\t\t\tpath,\n\t\t\t\t\tbefore: before?.text ?? \"\",\n\t\t\t\t\tafter: after?.text ?? \"\",\n\t\t\t\t\toldPath: before ? undefined : \"/dev/null\",\n\t\t\t\t\tnewPath: after ? undefined : \"/dev/null\",\n\t\t\t\t}),\n\t\tisBinary,\n\t\toldContent: before && isBinary ? toBase64(before.bytes) : undefined,\n\t\tnewContent: after && isBinary ? toBase64(after.bytes) : undefined,\n\t\toldSize: before?.bytes.length,\n\t\tnewSize: after?.bytes.length,\n\t};\n}\n\n/**\n * Walk two trees (oldOid -> newOid) and return one DiffFile per changed path\n * — the shared core of both {@link getCommitDiff} (parent -> commit) and\n * {@link getDiffBetweenRefs} (base -> compare).\n */\nasync function walkTreeDiff(\n\trepo: Repo,\n\toldOid: string,\n\tnewOid: string,\n): Promise<DiffFile[]> {\n\tconst changes = await git.walk({\n\t\t...repo,\n\t\ttrees: [git.TREE({ ref: oldOid }), git.TREE({ ref: newOid })],\n\t\tmap: async (filepath, [A, B]) => {\n\t\t\tconst [typeA, typeB] = await Promise.all([A?.type(), B?.type()]);\n\n\t\t\tif (typeA === \"tree\" || typeB === \"tree\") return;\n\n\t\t\tif (typeA && !typeB) {\n\t\t\t\tconst oidA = A ? await A.oid() : \"\";\n\t\t\t\tconst { blob } = await git.readBlob({ ...repo, oid: oidA });\n\t\t\t\tconst before = detectBlobContent(blob);\n\t\t\t\treturn buildDiffFile(filepath, \"deleted\", before, null);\n\t\t\t}\n\n\t\t\tif (!typeA && typeB) {\n\t\t\t\tconst oidB = B ? await B.oid() : \"\";\n\t\t\t\tconst { blob } = await git.readBlob({ ...repo, oid: oidB });\n\t\t\t\tconst after = detectBlobContent(blob);\n\t\t\t\treturn buildDiffFile(filepath, \"added\", null, after);\n\t\t\t}\n\n\t\t\tconst [oidA, oidB] = await Promise.all([\n\t\t\t\tA ? A.oid() : Promise.resolve(\"\"),\n\t\t\t\tB ? B.oid() : Promise.resolve(\"\"),\n\t\t\t]);\n\n\t\t\tif (oidA !== oidB) {\n\t\t\t\tconst [{ blob: blobA }, { blob: blobB }] = await Promise.all([\n\t\t\t\t\tgit.readBlob({ ...repo, oid: oidA }),\n\t\t\t\t\tgit.readBlob({ ...repo, oid: oidB }),\n\t\t\t\t]);\n\t\t\t\tconst before = detectBlobContent(blobA);\n\t\t\t\tconst after = detectBlobContent(blobB);\n\t\t\t\treturn buildDiffFile(filepath, \"modified\", before, after);\n\t\t\t}\n\n\t\t\treturn null;\n\t\t},\n\t});\n\n\treturn (changes ?? []).filter(\n\t\t(c: DiffFile | null | undefined): c is DiffFile =>\n\t\t\tc !== null && c !== undefined,\n\t);\n}\n\n/** The diff a single commit introduced (against its first parent). */\nexport async function getCommitDiff(\n\trepo: Repo,\n\tcommitSha: string,\n): Promise<DiffResult> {\n\ttry {\n\t\tconst commit = await getCommit(repo, commitSha);\n\t\tconst parent = commit.commit.parent[0];\n\n\t\tif (!parent) {\n\t\t\tconst entries: { path: string; oid: string }[] = [];\n\t\t\tconst stack: { treeOid: string; prefix: string }[] = [\n\t\t\t\t{ treeOid: commit.commit.tree, prefix: \"\" },\n\t\t\t];\n\n\t\t\twhile (stack.length) {\n\t\t\t\tconst { treeOid, prefix } = stack.pop() as {\n\t\t\t\t\ttreeOid: string;\n\t\t\t\t\tprefix: string;\n\t\t\t\t};\n\t\t\t\tconst { tree } = await git.readTree({ ...repo, oid: treeOid });\n\t\t\t\tfor (const entry of tree) {\n\t\t\t\t\tconst full = prefix ? `${prefix}/${entry.path}` : entry.path;\n\t\t\t\t\tif (entry.type === \"tree\") {\n\t\t\t\t\t\tstack.push({ treeOid: entry.oid, prefix: full });\n\t\t\t\t\t} else if (entry.type === \"blob\") {\n\t\t\t\t\t\tentries.push({ path: full, oid: entry.oid });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst files: DiffFile[] = await Promise.all(\n\t\t\t\tentries.map(async ({ path, oid }) => {\n\t\t\t\t\tconst { blob } = await git.readBlob({ ...repo, oid });\n\t\t\t\t\tconst after = detectBlobContent(blob);\n\t\t\t\t\treturn buildDiffFile(path, \"added\", null, after);\n\t\t\t\t}),\n\t\t\t);\n\n\t\t\treturn summarizeDiff(files);\n\t\t}\n\n\t\tconst files = await walkTreeDiff(repo, parent, commitSha);\n\t\treturn summarizeDiff(files);\n\t} catch (error) {\n\t\tthrow new Error(`Failed to get commit diff: ${error}`);\n\t}\n}\n\n/** The diff between two refs (base -> compare). */\nexport async function getDiffBetweenRefs(\n\trepo: Repo,\n\tbaseRef: string,\n\tcompareRef: string,\n): Promise<DiffResult> {\n\tconst [baseOid, compareOid] = await Promise.all([\n\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(baseRef) }),\n\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(compareRef) }),\n\t]);\n\n\tconst files = await walkTreeDiff(repo, baseOid, compareOid);\n\treturn summarizeDiff(files);\n}\n","import git from \"isomorphic-git\";\nimport { decodeUtf8, hasNullByte, toBase64 } from \"../edge-utils.js\";\nimport { GitObjectNotFoundError, GitPathNotFoundError } from \"../git-errors.js\";\nimport { qualifyBranchRef } from \"../refs.js\";\nimport { findTreeEntry, listTreeEntries, type TreeEntry } from \"./tree.js\";\nimport { type OpsHooks, type Repo, runStep } from \"./types.js\";\n\n/**\n * A resolved ref (branch/commit) not existing is a normal, expected condition\n * (empty repo, unborn branch) and is handled by each caller. An object that\n * fails to resolve *underneath* an already-resolved ref (a tree/blob the\n * stored pack doesn't actually contain) means the repo's storage is\n * inconsistent — surface that distinctly so callers don't render it as\n * \"empty\" and clients don't see a raw isomorphic-git NotFoundError.\n */\nfunction wrapMissingObject<T>(\n\tpromise: Promise<T>,\n\tcontext: string,\n): Promise<T> {\n\treturn promise.catch((err: unknown) => {\n\t\tif ((err as { code?: string })?.code === \"NotFoundError\") {\n\t\t\tthrow new GitObjectNotFoundError(\n\t\t\t\t`Git data for ${context} is missing from storage. The repository may need to be re-pushed to repair it.`,\n\t\t\t);\n\t\t}\n\t\tthrow err;\n\t});\n}\n\nconst isNotFound = (err: unknown) =>\n\t(err as { code?: string })?.code === \"NotFoundError\";\n\nexport interface CommitInfo {\n\toid: string;\n\tcommit: {\n\t\tmessage: string;\n\t\ttree: string;\n\t\tparent: string[];\n\t\tauthor: {\n\t\t\tname: string;\n\t\t\temail: string;\n\t\t\ttimestamp: number;\n\t\t\ttimezoneOffset: number;\n\t\t};\n\t\tcommitter: {\n\t\t\tname: string;\n\t\t\temail: string;\n\t\t\ttimestamp: number;\n\t\t\ttimezoneOffset: number;\n\t\t};\n\t};\n\tpayload: string;\n}\n\n/**\n * Resolve a branch name / full ref / sha to its commit. The ref not\n * resolving (unborn branch, genuinely empty repo) and the ref resolving but\n * its commit object being unreadable (storage inconsistency — see\n * `wrapMissingObject` above) are different failures with different meanings,\n * so only the first is left as a raw isomorphic-git NotFoundError for\n * callers to treat as \"empty\"; the second is wrapped into\n * GitObjectNotFoundError specifically so it can't be mistaken for the first\n * by an `isNotFound`-style check downstream (see getTreeFromRef/getCommitLog).\n */\nexport async function resolveCommit(repo: Repo, ref: string) {\n\tconst oid = await git.resolveRef({ ...repo, ref: qualifyBranchRef(ref) });\n\tconst result = await wrapMissingObject(\n\t\tgit.readCommit({ ...repo, oid }),\n\t\t`${repo.gitdir} commit ${oid}`,\n\t);\n\treturn { oid, commit: result.commit };\n}\n\n/** Read a blob's bytes by oid. */\nexport async function getBlob(repo: Repo, sha: string): Promise<Uint8Array> {\n\tconst { blob } = await wrapMissingObject(\n\t\tgit.readBlob({ ...repo, oid: sha }),\n\t\t`${repo.gitdir} blob ${sha}`,\n\t);\n\treturn blob;\n}\n\n/** Read a file's bytes at a ref. Throws GitPathNotFoundError when absent. */\nexport async function getFileContent(\n\trepo: Repo,\n\tfilePath: string,\n\tref = \"main\",\n\thooks?: OpsHooks,\n): Promise<Uint8Array> {\n\t// A blob page needs a commit, one or more tree objects, and the blob. On a\n\t// multi-pack object store, letting isomorphic-git discover those packs one\n\t// at a time turns that otherwise short read into a serial network walk.\n\t// Warm every pack before resolving the ref so every later object lookup can\n\t// use the local parse cache. This is the same structural optimization used\n\t// for tree and history reads, now applied to file reads as well.\n\tif (hooks?.prefetch) {\n\t\tawait runStep(hooks, \"prefetch\", hooks.prefetch);\n\t}\n\tconst { commit } = await resolveCommit(repo, ref);\n\tconst context = `${repo.gitdir}@${ref}:${filePath}`;\n\tconst entry = await wrapMissingObject(\n\t\tfindTreeEntry(repo, commit.tree, filePath),\n\t\tcontext,\n\t);\n\n\tif (entry?.type !== \"blob\") {\n\t\tthrow new GitPathNotFoundError(`File not found: ${filePath}`);\n\t}\n\n\tconst { blob } = await wrapMissingObject(\n\t\tgit.readBlob({ ...repo, oid: entry.oid }),\n\t\tcontext,\n\t);\n\treturn blob;\n}\n\n/** Read one commit by sha. */\nexport async function getCommit(repo: Repo, sha: string): Promise<CommitInfo> {\n\tconst result = await wrapMissingObject(\n\t\tgit.readCommit({ ...repo, oid: sha }),\n\t\t`${repo.gitdir} commit ${sha}`,\n\t);\n\treturn { oid: result.oid, commit: result.commit, payload: result.payload };\n}\n\nfunction isFullyWalked(commits: CommitInfo[]): boolean {\n\tconst last = commits[commits.length - 1];\n\treturn !!last && last.commit.parent.length === 0;\n}\n\nexport interface CommitLogOptions {\n\tref?: string;\n\tdepth?: number;\n\t/**\n\t * Pass the head sha when the caller already resolved `ref` — resolveRef\n\t * tries several candidate paths in sequence and misses the first few every\n\t * time for a normal branch name, which is pure waste when the sha is known.\n\t */\n\tknownHeadSha?: string;\n}\n\n/**\n * The commit chain from a ref, newest first. Walking is inherently sequential\n * (each commit's oid is only discoverable by reading its child first) and\n * network-round-trip-bound against object storage, so the deepest walk seen\n * per head is memoized in `hooks.resultCache` and sliced for shallower or\n * repeated requests — don't bypass this by calling `git.log` directly.\n */\nexport async function getCommitLog(\n\trepo: Repo,\n\toptions: CommitLogOptions = {},\n\thooks?: OpsHooks,\n): Promise<CommitInfo[]> {\n\tconst ref = options.ref ?? \"main\";\n\tconst depth = options.depth ?? 50;\n\n\tlet headSha: string;\n\tif (options.knownHeadSha) {\n\t\theadSha = options.knownHeadSha;\n\t} else {\n\t\ttry {\n\t\t\theadSha = await git.resolveRef({ ...repo, ref: qualifyBranchRef(ref) });\n\t\t} catch (err: unknown) {\n\t\t\tif (isNotFound(err)) return [];\n\t\t\tthrow err;\n\t\t}\n\t}\n\n\tconst cacheKey = `commitlog:${repo.gitdir}:${headSha}`;\n\tconst cached = hooks?.resultCache?.get<CommitInfo[]>(cacheKey);\n\tif (cached && (cached.length >= depth || isFullyWalked(cached))) {\n\t\thooks?.onNote?.(\n\t\t\t`getCommitLog: result-cache HIT for ${cacheKey} (depth=${depth})`,\n\t\t);\n\t\treturn cached.slice(0, depth);\n\t}\n\thooks?.onNote?.(\n\t\t`getCommitLog: result-cache MISS for ${cacheKey} (depth=${depth})`,\n\t);\n\n\tif (hooks?.prefetch && depth >= (hooks.prefetchMinDepth ?? 5)) {\n\t\tawait runStep(hooks, \"prefetch\", hooks.prefetch);\n\t}\n\n\t// headSha is already known-good here (resolveRef above succeeded, or the\n\t// caller passed knownHeadSha) — a NotFoundError from the walk itself means\n\t// a commit/tree/blob it needs is missing from storage, not that the ref\n\t// doesn't exist. Unlike the resolveRef catch above, that's not \"empty\",\n\t// it's storage inconsistency, so wrapMissingObject turns it into a\n\t// GitObjectNotFoundError instead of silently returning [] — an empty\n\t// result here would otherwise get treated as \"this branch has no\n\t// history\" by every caller (and, worse, potentially cached as such).\n\tconst commits = await wrapMissingObject(\n\t\trunStep(hooks, `git.log ${ref} depth=${depth}`, () =>\n\t\t\tgit.log({ ...repo, ref: headSha, depth }),\n\t\t),\n\t\t`${repo.gitdir}@${ref} history`,\n\t);\n\tconst result = commits.map((commit) => ({\n\t\toid: commit.oid,\n\t\tcommit: commit.commit,\n\t\tpayload: commit.payload || \"\",\n\t}));\n\tif (!cached || result.length > cached.length) {\n\t\thooks?.resultCache?.set(cacheKey, result);\n\t}\n\treturn result;\n}\n\n/** A file at a ref, decoded for display: utf8 text or base64 when binary. */\nexport async function getFileFromRef(\n\trepo: Repo,\n\tfilePath: string,\n\tref: string,\n\thooks?: OpsHooks,\n): Promise<{ content: string; size: number; isBinary: boolean }> {\n\tconst bytes = await getFileContent(repo, filePath, ref, hooks);\n\tconst isBinary = hasNullByte(bytes);\n\n\treturn {\n\t\tcontent: isBinary ? toBase64(bytes) : decodeUtf8(bytes),\n\t\tsize: bytes.length,\n\t\tisBinary,\n\t};\n}\n\n/**\n * List a directory at the tip of a ref. Returns [] for an empty repo/unborn\n * branch; throws GitPathNotFoundError when `treePath` doesn't exist. Results\n * are memoized per head sha (auto-invalidates on push).\n */\nexport async function getTreeFromRef(\n\trepo: Repo,\n\toptions: { ref?: string; treePath?: string } = {},\n\thooks?: OpsHooks,\n): Promise<TreeEntry[]> {\n\tconst ref = options.ref ?? \"main\";\n\tconst treePath = options.treePath ?? \"\";\n\n\tlet commit: Awaited<ReturnType<typeof resolveCommit>>[\"commit\"];\n\tlet headSha: string;\n\ttry {\n\t\tconst resolved = await resolveCommit(repo, ref);\n\t\tcommit = resolved.commit;\n\t\theadSha = resolved.oid;\n\t} catch (err: unknown) {\n\t\tif (isNotFound(err)) return [];\n\t\tthrow err;\n\t}\n\n\tconst cacheKey = `tree:${repo.gitdir}:${headSha}:${treePath}`;\n\tconst cached = hooks?.resultCache?.get<TreeEntry[]>(cacheKey);\n\tif (cached) {\n\t\thooks?.onNote?.(`getTreeFromRef: result-cache HIT for ${cacheKey}`);\n\t\treturn cached;\n\t}\n\thooks?.onNote?.(`getTreeFromRef: result-cache MISS for ${cacheKey}`);\n\n\t// Unlike getCommitLog, a tree read has no \"depth\" to gate on — it always\n\t// needs at least the head commit's tree object, and (for a non-root path)\n\t// one object per path segment on top of that, so there's no shallow case\n\t// where prefetching every pack is wasted bandwidth the way a depth=1\n\t// commit-log walk can be. Without this, a cache-miss tree read falls\n\t// through to isomorphic-git's own pack resolution, which probes indexed\n\t// packs one at a time instead of warming them all in parallel up front —\n\t// this was previously the slowest of a tree page's parallel queries in\n\t// production for exactly that reason.\n\tif (hooks?.prefetch) {\n\t\tawait runStep(hooks, \"prefetch\", hooks.prefetch);\n\t}\n\n\tconst context = `${repo.gitdir}@${ref}:${treePath || \"/\"}`;\n\tlet result: TreeEntry[];\n\tif (!treePath) {\n\t\tresult = await wrapMissingObject(\n\t\t\trunStep(hooks, \"listTreeEntries (root)\", () =>\n\t\t\t\tlistTreeEntries(repo, commit.tree),\n\t\t\t),\n\t\t\tcontext,\n\t\t);\n\t} else {\n\t\tconst entry = await wrapMissingObject(\n\t\t\trunStep(hooks, `findTreeEntry ${treePath}`, () =>\n\t\t\t\tfindTreeEntry(repo, commit.tree, treePath),\n\t\t\t),\n\t\t\tcontext,\n\t\t);\n\t\tif (!entry) {\n\t\t\tthrow new GitPathNotFoundError(\n\t\t\t\t`Path \"${treePath}\" does not exist at ${ref}`,\n\t\t\t);\n\t\t}\n\t\tresult =\n\t\t\tentry.type !== \"tree\"\n\t\t\t\t? []\n\t\t\t\t: await wrapMissingObject(\n\t\t\t\t\t\trunStep(hooks, `listTreeEntries ${treePath}`, () =>\n\t\t\t\t\t\t\tlistTreeEntries(repo, entry.oid, entry.path),\n\t\t\t\t\t\t),\n\t\t\t\t\t\tcontext,\n\t\t\t\t\t);\n\t}\n\n\thooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n\n/**\n * A page of commit history from a branch tip. Memoized per head sha; builds\n * on {@link getCommitLog}'s walk cache for the underlying chain.\n */\nexport async function getCommitHistory(\n\trepo: Repo,\n\toptions: { ref: string; limit?: number; skip?: number },\n\thooks?: OpsHooks,\n): Promise<CommitInfo[]> {\n\tconst limit = options.limit ?? 50;\n\tconst skip = options.skip ?? 0;\n\tconst headSha = await git\n\t\t.resolveRef({ ...repo, ref: qualifyBranchRef(options.ref) })\n\t\t.catch(() => null);\n\n\tconst cacheKey = headSha\n\t\t? `commits:${repo.gitdir}:${headSha}:${limit}:${skip}`\n\t\t: null;\n\tif (cacheKey) {\n\t\tconst cached = hooks?.resultCache?.get<CommitInfo[]>(cacheKey);\n\t\tif (cached) {\n\t\t\thooks?.onNote?.(`getCommitHistory: result-cache HIT for ${cacheKey}`);\n\t\t\treturn cached;\n\t\t}\n\t}\n\thooks?.onNote?.(\n\t\t`getCommitHistory: result-cache MISS for ${cacheKey ?? \"(no head)\"}`,\n\t);\n\tif (!headSha) return [];\n\n\tconst all = await getCommitLog(\n\t\trepo,\n\t\t{ ref: options.ref, depth: limit + skip, knownHeadSha: headSha },\n\t\thooks,\n\t);\n\tconst result = all.slice(skip, skip + limit);\n\n\tif (cacheKey) hooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n","import type git from \"isomorphic-git\";\n\n/** The fs shape isomorphic-git accepts, derived from its own signatures. */\nexport type IsoGitFs = Parameters<typeof git.readTree>[0][\"fs\"];\n\n/**\n * A repository handle: everything isomorphic-git needs to address one bare\n * repo. Create it once per request (sharing `cache` across calls is what lets\n * isomorphic-git reuse parsed pack indexes) and pass it to every op.\n */\nexport interface Repo {\n\tfs: IsoGitFs;\n\tgitdir: string;\n\t/** isomorphic-git's shared parse cache — strongly recommended per repo. */\n\tcache?: object;\n}\n\n/**\n * Key/value store for memoizing expensive walk results (commit logs, tree\n * listings, per-file history). Keys are namespaced `kind:gitdir:headSha:…`,\n * so entries self-invalidate on push (new head, new key) — but evict entries\n * under {@link resultKeyPrefixes} after rewriting a repo's storage out of\n * band, or stale walks leak until your store's own eviction.\n */\nexport interface ResultCache {\n\tget<T>(key: string): T | null | undefined;\n\tset(key: string, value: unknown): void;\n}\n\n/** Optional instrumentation and tuning hooks accepted by every op. */\nexport interface OpsHooks {\n\tresultCache?: ResultCache;\n\t/** Wrap a timed sub-step (network walk, tree listing). Default: run directly. */\n\tstep?: <T>(label: string, fn: () => Promise<T>) => Promise<T>;\n\t/** Diagnostic sink for cache hit/miss and walk summaries. */\n\tonNote?: (message: string) => void;\n\t/**\n\t * Wire pack prefetching (e.g. `GitFs.prefetchPacks`) here so a sequential\n\t * walk doesn't pay one network round trip per commit. Called once before\n\t * history walks of depth >= `prefetchMinDepth` (see below), and\n\t * unconditionally on every cache-miss tree read ({@link getTreeFromRef}) —\n\t * a tree read has no shallow case, it always needs at least the head\n\t * commit's tree object.\n\t */\n\tprefetch?: () => Promise<void>;\n\t/** Minimum walk depth before `prefetch` fires for history walks. Default 5. */\n\tprefetchMinDepth?: number;\n}\n\nexport const runStep = <T>(\n\thooks: OpsHooks | undefined,\n\tlabel: string,\n\tfn: () => Promise<T>,\n): Promise<T> => (hooks?.step ? hooks.step(label, fn) : fn());\n\n/**\n * The result-cache key prefixes holding entries for `gitdir` — evict these\n * from your {@link ResultCache} when the repo's storage was rewritten outside\n * a normal push (bulk sync, rename, repack cleanup).\n */\nexport function resultKeyPrefixes(gitdir: string): string[] {\n\treturn [\n\t\t`commitlog:${gitdir}:`,\n\t\t`tree:${gitdir}:`,\n\t\t`commits:${gitdir}:`,\n\t\t`last-commits:${gitdir}:`,\n\t\t`file-history:${gitdir}:`,\n\t];\n}\n","import { type CommitInfo, getCommitLog } from \"./history.js\";\nimport { findTreeEntry } from \"./tree.js\";\nimport type { OpsHooks, Repo } from \"./types.js\";\nimport { runStep } from \"./types.js\";\n\nexport interface FileHistoryEntry {\n\tsha: string;\n\tmessage: string;\n\tauthorName: string;\n\tauthorEmail: string;\n\tcreatedAt: string;\n}\n\nexport interface FileHistoryResult {\n\tentries: FileHistoryEntry[];\n\t/**\n\t * True when the walk hit its depth budget (or the requested `limit`)\n\t * before exhausting the branch's full commit chain — there may be older\n\t * commits touching this file that a deeper walk would surface.\n\t */\n\ttruncated: boolean;\n}\n\n/**\n * Default walk bound for a caller that actually wants deep history (a file's\n * \"History\" tab). Walking the full chain is round-trip-bound on object\n * storage, so cap how far back a single request will look.\n */\nexport const HISTORY_WALK_DEPTH = 400;\n\n/**\n * Much shallower default for a \"latest commit touching this file\" banner that\n * only displays `entries[0]` — trades \"always finds the true last-touching\n * commit\" for \"finds it if it's reasonably recent\", the right call for a\n * banner with a full History view a click away.\n */\nexport const BANNER_WALK_DEPTH = 60;\n\n/** Tree reads are prefetched in parallel windows; see getLastCommitsForTree. */\nconst PREFETCH_WINDOW = 24;\n\nfunction toEntry(commit: CommitInfo): FileHistoryEntry {\n\treturn {\n\t\tsha: commit.oid,\n\t\tmessage: commit.commit.message.trim(),\n\t\tauthorName: commit.commit.author.name,\n\t\tauthorEmail: commit.commit.author.email,\n\t\tcreatedAt: new Date(commit.commit.author.timestamp * 1000).toISOString(),\n\t};\n}\n\n/**\n * All commits (newest first) that changed a single file's blob oid, walking\n * the first-parent chain — same approach as getLastCommitsForTree but for one\n * path and collecting every match instead of stopping at the first.\n */\nexport async function getFileHistory(\n\trepo: Repo,\n\toptions: {\n\t\tref: string;\n\t\tfilePath: string;\n\t\tlimit?: number;\n\t\tmaxDepth?: number;\n\t},\n\thooks?: OpsHooks,\n): Promise<FileHistoryResult> {\n\tconst limit = options.limit ?? 30;\n\tconst maxDepth = options.maxDepth ?? HISTORY_WALK_DEPTH;\n\tconst walkDepth = Math.max(maxDepth, limit);\n\tconst commits = await runStep(hooks, `getCommitLog depth=${walkDepth}`, () =>\n\t\tgetCommitLog(repo, { ref: options.ref, depth: walkDepth }, hooks),\n\t);\n\tconst head = commits[0];\n\tif (!head) return { entries: [], truncated: false };\n\n\tconst cacheKey = `file-history:${repo.gitdir}:${head.oid}:${options.filePath}:${limit}:${maxDepth}`;\n\tconst cached = hooks?.resultCache?.get<FileHistoryResult>(cacheKey);\n\tif (cached) {\n\t\thooks?.onNote?.(\"getFileHistory: result-cache HIT, skipping history walk\");\n\t\treturn cached;\n\t}\n\thooks?.onNote?.(\"getFileHistory: result-cache MISS, walking history\");\n\n\tconst byOid = new Map(commits.map((commit) => [commit.oid, commit]));\n\n\tconst oidByCommitTree = new Map<string, string | null>();\n\tasync function resolveOid(commitTreeOid: string): Promise<string | null> {\n\t\tconst cachedOid = oidByCommitTree.get(commitTreeOid);\n\t\tif (cachedOid !== undefined) return cachedOid;\n\t\tconst entry = await findTreeEntry(repo, commitTreeOid, options.filePath);\n\t\tconst oid = entry?.type === \"blob\" ? entry.oid : null;\n\t\toidByCommitTree.set(commitTreeOid, oid);\n\t\treturn oid;\n\t}\n\n\tconst entries: FileHistoryEntry[] = [];\n\tlet truncated = false;\n\n\touter: for (\n\t\tlet windowStart = 0;\n\t\twindowStart < commits.length;\n\t\twindowStart += PREFETCH_WINDOW\n\t) {\n\t\tconst windowEnd = Math.min(windowStart + PREFETCH_WINDOW, commits.length);\n\t\t// +1 lookahead so the last entry's parent tree is already warm too.\n\t\tconst prefetchEnd = Math.min(windowEnd + 1, commits.length);\n\n\t\tawait Promise.all(\n\t\t\tcommits\n\t\t\t\t.slice(windowStart, prefetchEnd)\n\t\t\t\t.map((commit) => resolveOid(commit.commit.tree)),\n\t\t);\n\n\t\tfor (let i = windowStart; i < windowEnd; i++) {\n\t\t\tconst commit = commits[i];\n\t\t\tif (!commit) break outer;\n\n\t\t\tconst parentSha = commit.commit.parent[0];\n\t\t\tconst parentCommit = parentSha ? byOid.get(parentSha) : undefined;\n\t\t\tif (parentSha && !parentCommit) {\n\t\t\t\t// Walked past the depth cap without reaching this commit's parent —\n\t\t\t\t// can't tell whether it changed the file; stop and report truncated.\n\t\t\t\ttruncated = true;\n\t\t\t\tbreak outer;\n\t\t\t}\n\n\t\t\tconst [oid, parentOid] = await Promise.all([\n\t\t\t\tresolveOid(commit.commit.tree),\n\t\t\t\tparentCommit\n\t\t\t\t\t? resolveOid(parentCommit.commit.tree)\n\t\t\t\t\t: Promise.resolve(null),\n\t\t\t]);\n\n\t\t\tif (oid !== parentOid) {\n\t\t\t\tentries.push(toEntry(commit));\n\t\t\t\tif (entries.length >= limit) {\n\t\t\t\t\ttruncated = i < commits.length - 1;\n\t\t\t\t\tbreak outer;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tconst result = { entries, truncated };\n\thooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n","import { type CommitInfo, getCommitLog } from \"./history.js\";\nimport { findTreeEntry, listTreeEntries } from \"./tree.js\";\nimport type { OpsHooks, Repo } from \"./types.js\";\nimport { runStep } from \"./types.js\";\n\nexport interface LastCommitInfo {\n\tsha: string;\n\tmessage: string;\n\tauthorName: string;\n\tauthorEmail: string;\n\tcreatedAt: string;\n}\n\n/**\n * Bounds how far back the history walk looks to resolve \"last commit touching\n * this path\" for a directory listing. Entries whose last change is older\n * simply show no last-commit info rather than paying an unbounded scan.\n */\nconst HISTORY_WALK_DEPTH = 400;\n\n/**\n * The walk itself is inherently sequential (each step needs to know what's\n * still \"remaining\" from the step before), but the tree-object reads that\n * back it are not — each commit's tree oid is already known upfront from the\n * commit log. Prefetching a window of tree reads in parallel turns ~1 network\n * round trip per commit (serialized) into ~1 round trip per window, which is\n * where nearly all of this function's wall-clock time goes on object storage.\n */\nconst PREFETCH_WINDOW = 24;\n\nfunction toLastCommitInfo(commit: CommitInfo): LastCommitInfo {\n\treturn {\n\t\tsha: commit.oid,\n\t\tmessage: commit.commit.message.trim(),\n\t\tauthorName: commit.commit.author.name,\n\t\tauthorEmail: commit.commit.author.email,\n\t\tcreatedAt: new Date(commit.commit.author.timestamp * 1000).toISOString(),\n\t};\n}\n\n/**\n * For each direct child of `treePath` (at the tip of `ref`), find the most\n * recent commit that changed it — the tree view's \"last commit\" column. Walks\n * history newest-to-oldest, comparing the directory's tree oid\n * commit-to-commit and only descending one level to diff child oids when\n * something under the directory actually changed. Preserve the two-phase\n * structure (parallel prefetch, then sequential resolve) when touching this —\n * the \"which entries are still unresolved\" state must advance\n * commit-by-commit.\n */\nexport async function getLastCommitsForTree(\n\trepo: Repo,\n\toptions: { ref: string; treePath?: string; depth?: number },\n\thooks?: OpsHooks,\n): Promise<Record<string, LastCommitInfo>> {\n\tconst treePath = options.treePath ?? \"\";\n\tconst depth = options.depth ?? HISTORY_WALK_DEPTH;\n\tconst commits = await runStep(hooks, `getCommitLog depth=${depth}`, () =>\n\t\tgetCommitLog(repo, { ref: options.ref, depth }, hooks),\n\t);\n\thooks?.onNote?.(`getLastCommitsForTree: ${commits.length} commits in log`);\n\tconst head = commits[0];\n\tif (!head) return {};\n\n\tconst cacheKey = `last-commits:${repo.gitdir}:${head.oid}:${treePath}`;\n\tconst cachedResult =\n\t\thooks?.resultCache?.get<Record<string, LastCommitInfo>>(cacheKey);\n\tif (cachedResult) {\n\t\thooks?.onNote?.(\n\t\t\t\"getLastCommitsForTree: result-cache HIT, skipping history walk\",\n\t\t);\n\t\treturn cachedResult;\n\t}\n\thooks?.onNote?.(\"getLastCommitsForTree: result-cache MISS, walking history\");\n\n\tconst byOid = new Map(commits.map((commit) => [commit.oid, commit]));\n\n\t// In a linear history, the \"parent tree\" resolved at commit[i] is the same\n\t// tree already resolved as the \"current tree\" at commit[i-1] — memoize by\n\t// commit-tree oid (and by resolved dir oid) so each distinct tree is only\n\t// walked/listed once across the whole scan instead of twice per commit.\n\tconst dirOidByCommitTree = new Map<string, string | null>();\n\tconst childrenByDirOid = new Map<\n\t\tstring,\n\t\tAwaited<ReturnType<typeof listTreeEntries>>\n\t>();\n\n\tasync function resolveDirOid(commitTreeOid: string): Promise<string | null> {\n\t\tconst cached = dirOidByCommitTree.get(commitTreeOid);\n\t\tif (cached !== undefined) return cached;\n\t\tconst entry = await findTreeEntry(repo, commitTreeOid, treePath);\n\t\tconst dirOid = entry?.type === \"tree\" ? entry.oid : null;\n\t\tdirOidByCommitTree.set(commitTreeOid, dirOid);\n\t\treturn dirOid;\n\t}\n\n\tasync function resolveChildren(dirOid: string | null) {\n\t\tif (dirOid === null) return [];\n\t\tconst cached = childrenByDirOid.get(dirOid);\n\t\tif (cached) return cached;\n\t\tconst children = await listTreeEntries(repo, dirOid, treePath);\n\t\tchildrenByDirOid.set(dirOid, children);\n\t\treturn children;\n\t}\n\n\tconst headDirOid = await resolveDirOid(head.commit.tree);\n\tif (headDirOid === null) return {};\n\n\t// listTreeEntries is prefixed with treePath so result keys match the full\n\t// paths that callers key their file listing by.\n\tconst headChildren = await resolveChildren(headDirOid);\n\tconst remaining = new Set(headChildren.map((entry) => entry.path));\n\tconst result: Record<string, LastCommitInfo> = {};\n\n\tlet commitsWalked = 0;\n\tlet prefetchWindows = 0;\n\tconst walkStart = performance.now();\n\n\touter: for (\n\t\tlet windowStart = 0;\n\t\twindowStart < commits.length && remaining.size > 0;\n\t\twindowStart += PREFETCH_WINDOW\n\t) {\n\t\tconst windowEnd = Math.min(windowStart + PREFETCH_WINDOW, commits.length);\n\t\t// +1 lookahead commit so the last entry's parent tree is already warm too.\n\t\tconst prefetchEnd = Math.min(windowEnd + 1, commits.length);\n\t\tprefetchWindows++;\n\n\t\t// Phase A: resolve this window's directory oid for every commit's tree in\n\t\t// parallel (a no-op await when treePath is \"\" — the root tree oid IS the\n\t\t// commit tree, no lookup needed).\n\t\tconst dirOids = await Promise.all(\n\t\t\tcommits\n\t\t\t\t.slice(windowStart, prefetchEnd)\n\t\t\t\t.map((commit) => resolveDirOid(commit.commit.tree)),\n\t\t);\n\n\t\t// Phase B: resolve children for every distinct directory oid the window\n\t\t// touched, in parallel — the actual tree-object read for the common case.\n\t\tawait Promise.all(\n\t\t\t[...new Set(dirOids)].map((dirOid) => resolveChildren(dirOid)),\n\t\t);\n\n\t\tfor (let i = windowStart; i < windowEnd; i++) {\n\t\t\tif (remaining.size === 0) break outer;\n\t\t\tconst commit = commits[i];\n\t\t\tif (!commit) break outer;\n\t\t\tcommitsWalked++;\n\n\t\t\tconst parentSha = commit.commit.parent[0];\n\t\t\tconst parentCommit = parentSha ? byOid.get(parentSha) : undefined;\n\t\t\tif (parentSha && !parentCommit) break outer; // walked past the depth cap\n\n\t\t\t// Already resolved above (or memoized from an earlier window/commit) —\n\t\t\t// these awaits resolve immediately from cache.\n\t\t\tconst [dirOid, parentDirOid] = await Promise.all([\n\t\t\t\tresolveDirOid(commit.commit.tree),\n\t\t\t\tparentCommit\n\t\t\t\t\t? resolveDirOid(parentCommit.commit.tree)\n\t\t\t\t\t: Promise.resolve(null),\n\t\t\t]);\n\n\t\t\tif (dirOid === parentDirOid) continue;\n\n\t\t\tconst [children, parentChildren] = await Promise.all([\n\t\t\t\tresolveChildren(dirOid),\n\t\t\t\tresolveChildren(parentDirOid),\n\t\t\t]);\n\t\t\tconst childByName = new Map(\n\t\t\t\tchildren.map((entry) => [entry.path, entry.oid]),\n\t\t\t);\n\t\t\tconst parentChildByName = new Map(\n\t\t\t\tparentChildren.map((entry) => [entry.path, entry.oid]),\n\t\t\t);\n\n\t\t\tfor (const name of remaining) {\n\t\t\t\tif (childByName.get(name) !== parentChildByName.get(name)) {\n\t\t\t\t\tresult[name] = toLastCommitInfo(commit);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const name of Object.keys(result)) {\n\t\t\t\tremaining.delete(name);\n\t\t\t}\n\t\t}\n\t}\n\n\thooks?.onNote?.(\n\t\t`getLastCommitsForTree: walked ${commitsWalked}/${commits.length} commits across ${prefetchWindows} prefetch windows in ${(performance.now() - walkStart).toFixed(1)}ms, ${dirOidByCommitTree.size} unique tree lookups, ${remaining.size} entries never resolved`,\n\t);\n\n\thooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n","import git from \"isomorphic-git\";\nimport { qualifyBranchRef } from \"../refs.js\";\nimport { assertSafeBranchName } from \"./branch.js\";\nimport type { Repo } from \"./types.js\";\n\nexport interface MergeAnalysis {\n\tcanMerge: boolean;\n\thasConflicts: boolean;\n\tconflictingFiles: string[];\n\tfastForward: boolean;\n}\n\n/**\n * Cheap pre-merge check: do both branches exist, and is this a fast-forward?\n * `canMerge`/`fastForward` are the only fields this actually determines —\n * `hasConflicts`/`conflictingFiles` are NOT a real content-conflict check\n * (isomorphic-git's `git.merge` doesn't expose a dry-run), they only ever\n * reflect \"one of the branches couldn't be resolved\" (`canMerge: false`).\n * Real merge conflicts are only discoverable by actually attempting the\n * merge.\n */\nexport async function analyzeMerge(\n\trepo: Repo,\n\tsourceBranch: string,\n\ttargetBranch: string,\n): Promise<MergeAnalysis> {\n\tassertSafeBranchName(sourceBranch);\n\tassertSafeBranchName(targetBranch);\n\n\ttry {\n\t\tconst [sourceOid, targetOid] = await Promise.all([\n\t\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(sourceBranch) }),\n\t\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(targetBranch) }),\n\t\t]);\n\n\t\tconst isDescendant = await git.isDescendent({\n\t\t\t...repo,\n\t\t\toid: sourceOid,\n\t\t\tancestor: targetOid,\n\t\t});\n\n\t\treturn {\n\t\t\tcanMerge: true,\n\t\t\thasConflicts: false,\n\t\t\tconflictingFiles: [],\n\t\t\tfastForward: isDescendant,\n\t\t};\n\t} catch (err) {\n\t\tif ((err as { code?: string })?.code !== \"NotFoundError\") {\n\t\t\tthrow err;\n\t\t}\n\t\t// A branch ref failed to resolve — not a content conflict, just \"can't\n\t\t// merge because one side doesn't exist.\" hasConflicts here is a\n\t\t// misnomer kept for MergeAnalysis's existing shape; canMerge is the\n\t\t// field that actually matters to callers.\n\t\treturn {\n\t\t\tcanMerge: false,\n\t\t\thasConflicts: true,\n\t\t\tconflictingFiles: [],\n\t\t\tfastForward: false,\n\t\t};\n\t}\n}\n\n/**\n * Attempt a fast-forward merge directly against the bare repo: when source is\n * a descendant of target, just move the target ref — no worktree, no new\n * commit. Returns null when the merge is not a fast-forward (callers fall\n * back to a real three-way merge, which needs a worktree). Serialize with a\n * per-repo lock: resolve → writeRef is not atomic.\n */\nexport async function fastForwardMerge(\n\trepo: Repo,\n\tsourceBranch: string,\n\ttargetBranch: string,\n): Promise<{ success: true; commitSha: string } | null> {\n\tassertSafeBranchName(sourceBranch);\n\tassertSafeBranchName(targetBranch);\n\tconst [sourceOid, targetOid] = await Promise.all([\n\t\tgit.resolveRef({ ...repo, ref: `refs/heads/${sourceBranch}` }),\n\t\tgit.resolveRef({ ...repo, ref: `refs/heads/${targetBranch}` }),\n\t]);\n\tconst isFF = await git.isDescendent({\n\t\t...repo,\n\t\toid: sourceOid,\n\t\tancestor: targetOid,\n\t});\n\tif (!isFF) return null;\n\tawait git.writeRef({\n\t\t...repo,\n\t\tref: `refs/heads/${targetBranch}`,\n\t\tvalue: sourceOid,\n\t\tforce: true,\n\t});\n\treturn { success: true, commitSha: sourceOid };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAAA,OAAOA,UAAS;;;ACAhB,OAAO,SAAS;AAWhB,IAAM,WAAW,CAAC,QAAgB,SACjC,SAAS,GAAG,OAAO,QAAQ,QAAQ,EAAE,CAAC,IAAI,IAAI,KAAK;AAMpD,eAAsB,WACrB,MACA,SACA,SACkB;AAClB,QAAM,WAAW,WACb,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG,OAChD,CAAC;AACJ,QAAM,SAAS,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACvD,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,SAAS,oBAAI,IAAiC;AACpD,aAAW,CAAC,UAAU,OAAO,KAAK,SAAS;AAC1C,UAAM,QAAQ,SAAS,QAAQ,GAAG;AAClC,QAAI,UAAU,IAAI;AACjB,aAAO,IAAI,UAAU,OAAO;AAAA,IAC7B,OAAO;AACN,YAAM,MAAM,SAAS,MAAM,GAAG,KAAK;AACnC,YAAM,OAAO,SAAS,MAAM,QAAQ,CAAC;AACrC,UAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,oBAAI,IAAI,CAAC;AAC/C,aAAO,IAAI,GAAG,GAAG,IAAI,MAAM,OAAO;AAAA,IACnC;AAAA,EACD;AACA,aAAW,CAAC,MAAM,OAAO,KAAK,QAAQ;AACrC,WAAO,IAAI,MAAM;AAAA,MAChB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,KAAK;AAAA,MACL,MAAM;AAAA,IACP,CAAC;AAAA,EACF;AAGA,QAAM,gBAAgB,MAAM,QAAQ;AAAA,IACnC,MAAM,KAAK,QAAQ,OAAO,CAAC,KAAK,UAAU,MAAM;AAC/C,YAAM,QAAQ,OAAO,IAAI,GAAG;AAC5B,YAAM,aAAa,OAAO,SAAS,SAAS,MAAM,MAAM;AACxD,YAAM,SAAS,MAAM,WAAW,MAAM,YAAY,UAAU;AAC5D,aAAO,CAAC,KAAK,MAAM;AAAA,IACpB,CAAC;AAAA,EACF;AACA,aAAW,CAAC,KAAK,MAAM,KAAK,eAAe;AAC1C,WAAO,IAAI,KAAK,EAAE,MAAM,UAAU,MAAM,KAAK,KAAK,QAAQ,MAAM,OAAO,CAAC;AAAA,EACzE;AACA,SAAO,IAAI,UAAU,EAAE,GAAG,MAAM,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC,EAAE,CAAC;AACpE;AAGA,eAAsB,eACrB,MACA,SACA,UACkB;AAClB,QAAM,YAAY,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG;AACjE,QAAM,SAAS,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACvD,QAAM,QAAQ,SAAS,QAAQ,GAAG;AAClC,MAAI,UAAU,IAAI;AACjB,WAAO,OAAO,QAAQ;AAAA,EACvB,OAAO;AACN,UAAM,MAAM,SAAS,MAAM,GAAG,KAAK;AACnC,UAAM,OAAO,SAAS,MAAM,QAAQ,CAAC;AACrC,UAAM,QAAQ,OAAO,IAAI,GAAG;AAC5B,QAAI,OAAO,SAAS,QAAQ;AAC3B,YAAM,SAAS,MAAM,eAAe,MAAM,MAAM,KAAK,IAAI;AACzD,aAAO,IAAI,KAAK,EAAE,GAAG,OAAO,KAAK,OAAO,CAAC;AAAA,IAC1C;AAAA,EACD;AACA,SAAO,IAAI,UAAU,EAAE,GAAG,MAAM,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC,EAAE,CAAC;AACpE;AAGA,eAAsB,cACrB,MACA,aACA,UAC4B;AAC5B,MAAI,CAAC,UAAU;AACd,WAAO,EAAE,MAAM,IAAI,MAAM,UAAU,MAAM,QAAQ,KAAK,YAAY;AAAA,EACnE;AAEA,QAAM,QAAQ,SAAS,MAAM,GAAG,EAAE,OAAO,OAAO;AAChD,MAAI,iBAAiB;AACrB,MAAI,cAAc;AAElB,aAAW,CAAC,OAAO,IAAI,KAAK,MAAM,QAAQ,GAAG;AAC5C,UAAM,OAAO,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,eAAe,CAAC;AAChE,UAAM,QAAQ,KAAK,KAAK,KAAK,CAAC,cAAc,UAAU,SAAS,IAAI;AAEnE,QAAI,CAAC,MAAO,QAAO;AAEnB,kBAAc,cAAc,SAAS,aAAa,MAAM,IAAI,IAAI,MAAM;AAEtE,QAAI,UAAU,MAAM,SAAS,GAAG;AAC/B,aAAO;AAAA,QACN,MAAM;AAAA,QACN,MAAM,MAAM;AAAA,QACZ,MAAM,MAAM;AAAA,QACZ,KAAK,MAAM;AAAA,MACZ;AAAA,IACD;AAEA,QAAI,MAAM,SAAS,OAAQ,QAAO;AAElC,qBAAiB,MAAM;AAAA,EACxB;AAEA,SAAO;AACR;AAGA,eAAsB,gBACrB,MACA,SACA,SAAS,IACc;AACvB,QAAM,OAAO,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC;AAEzD,SAAO,KAAK,KAAK,IAAI,CAAC,WAAW;AAAA,IAChC,MAAM,SAAS,SAAS,QAAQ,MAAM,IAAI,IAAI,MAAM;AAAA,IACpD,MAAM,MAAM;AAAA,IACZ,MAAM,MAAM;AAAA,IACZ,KAAK,MAAM;AAAA,EACZ,EAAE;AACH;;;AD/HO,SAAS,UAAU,MAAc,OAA6B;AACpE,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,WAAW,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AAAA,IACvC,gBAAgB;AAAA,EACjB;AACD;AAWA,eAAsB,kBACrB,MACA,SAMkB;AAClB,uBAAqB,QAAQ,MAAM;AACnC,MAAI;AACJ,MAAI;AACJ,MAAI;AACH,gBAAY,MAAMC,KAAI,WAAW;AAAA,MAChC,GAAG;AAAA,MACH,KAAK,cAAc,QAAQ,MAAM;AAAA,IAClC,CAAC;AACD,UAAM,EAAE,OAAO,IAAI,MAAMA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,UAAU,CAAC;AACnE,oBAAgB,OAAO;AAAA,EACxB,SAAS,KAAK;AACb,QAAK,KAA2B,SAAS,iBAAiB;AACzD,YAAM;AAAA,IACP;AAAA,EAED;AACA,QAAM,UAAU,MAAM,QAAQ,UAAU,aAAa;AACrD,QAAM,YAAY,MAAMA,KAAI,YAAY;AAAA,IACvC,GAAG;AAAA,IACH,QAAQ;AAAA,MACP,SAAS,QAAQ;AAAA,MACjB,MAAM;AAAA,MACN,QAAQ,YAAY,CAAC,SAAS,IAAI,CAAC;AAAA,MACnC,QAAQ,QAAQ;AAAA,MAChB,WAAW,QAAQ;AAAA,IACpB;AAAA,EACD,CAAC;AACD,QAAMA,KAAI,SAAS;AAAA,IAClB,GAAG;AAAA,IACH,KAAK,cAAc,QAAQ,MAAM;AAAA,IACjC,OAAO;AAAA,IACP,OAAO;AAAA,EACR,CAAC;AACD,SAAO;AACR;AAOO,SAAS,kBACf,MACA,SAMkB;AAClB,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,kBAAkB;AACnC,YAAM,QAAQ,oBAAI,IAAoB;AACtC,YAAM,QAAQ;AAAA,QACb,QAAQ,MAAM,IAAI,OAAO,SAAS;AACjC,gBAAM,UACL,OAAO,KAAK,YAAY,WACrB,IAAI,YAAY,EAAE,OAAO,KAAK,OAAO,IACrC,KAAK;AACT,gBAAM,MAAM,MAAMA,KAAI,UAAU,EAAE,GAAG,MAAM,MAAM,QAAQ,CAAC;AAC1D,gBAAM,IAAI,KAAK,MAAM,GAAG;AAAA,QACzB,CAAC;AAAA,MACF;AACA,aAAO,WAAW,MAAM,eAAe,KAAK;AAAA,IAC7C;AAAA,EACD,CAAC;AACF;AAGO,SAAS,mBACf,MACA,SAMkB;AAClB,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,kBAAkB;AACnC,UAAI,CAAC,eAAe;AACnB,cAAM,IAAI,MAAM,UAAU,QAAQ,MAAM,WAAW;AAAA,MACpD;AACA,aAAO,eAAe,MAAM,eAAe,QAAQ,QAAQ;AAAA,IAC5D;AAAA,EACD,CAAC;AACF;;;AEpIA,SAAS,2BAA2B;AACpC,OAAOC,UAAS;;;ACDhB,OAAOC,UAAS;;;ACiDT,IAAM,UAAU,CACtB,OACA,OACA,OACiB,OAAO,OAAO,MAAM,KAAK,OAAO,EAAE,IAAI,GAAG;AAOpD,SAAS,kBAAkB,QAA0B;AAC3D,SAAO;AAAA,IACN,aAAa,MAAM;AAAA,IACnB,QAAQ,MAAM;AAAA,IACd,WAAW,MAAM;AAAA,IACjB,gBAAgB,MAAM;AAAA,IACtB,gBAAgB,MAAM;AAAA,EACvB;AACD;;;ADrDA,SAAS,kBACR,SACA,SACa;AACb,SAAO,QAAQ,MAAM,CAAC,QAAiB;AACtC,QAAK,KAA2B,SAAS,iBAAiB;AACzD,YAAM,IAAI;AAAA,QACT,gBAAgB,OAAO;AAAA,MACxB;AAAA,IACD;AACA,UAAM;AAAA,EACP,CAAC;AACF;AAEA,IAAM,aAAa,CAAC,QAClB,KAA2B,SAAS;AAkCtC,eAAsB,cAAc,MAAY,KAAa;AAC5D,QAAM,MAAM,MAAMC,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,GAAG,EAAE,CAAC;AACxE,QAAM,SAAS,MAAM;AAAA,IACpBA,KAAI,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC;AAAA,IAC/B,GAAG,KAAK,MAAM,WAAW,GAAG;AAAA,EAC7B;AACA,SAAO,EAAE,KAAK,QAAQ,OAAO,OAAO;AACrC;AAGA,eAAsB,QAAQ,MAAY,KAAkC;AAC3E,QAAM,EAAE,KAAK,IAAI,MAAM;AAAA,IACtBA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,IAAI,CAAC;AAAA,IAClC,GAAG,KAAK,MAAM,SAAS,GAAG;AAAA,EAC3B;AACA,SAAO;AACR;AAGA,eAAsB,eACrB,MACA,UACA,MAAM,QACN,OACsB;AAOtB,MAAI,OAAO,UAAU;AACpB,UAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAAA,EAChD;AACA,QAAM,EAAE,OAAO,IAAI,MAAM,cAAc,MAAM,GAAG;AAChD,QAAM,UAAU,GAAG,KAAK,MAAM,IAAI,GAAG,IAAI,QAAQ;AACjD,QAAM,QAAQ,MAAM;AAAA,IACnB,cAAc,MAAM,OAAO,MAAM,QAAQ;AAAA,IACzC;AAAA,EACD;AAEA,MAAI,OAAO,SAAS,QAAQ;AAC3B,UAAM,IAAI,qBAAqB,mBAAmB,QAAQ,EAAE;AAAA,EAC7D;AAEA,QAAM,EAAE,KAAK,IAAI,MAAM;AAAA,IACtBA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,MAAM,IAAI,CAAC;AAAA,IACxC;AAAA,EACD;AACA,SAAO;AACR;AAGA,eAAsB,UAAU,MAAY,KAAkC;AAC7E,QAAM,SAAS,MAAM;AAAA,IACpBA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,IAAI,CAAC;AAAA,IACpC,GAAG,KAAK,MAAM,WAAW,GAAG;AAAA,EAC7B;AACA,SAAO,EAAE,KAAK,OAAO,KAAK,QAAQ,OAAO,QAAQ,SAAS,OAAO,QAAQ;AAC1E;AAEA,SAAS,cAAc,SAAgC;AACtD,QAAM,OAAO,QAAQ,QAAQ,SAAS,CAAC;AACvC,SAAO,CAAC,CAAC,QAAQ,KAAK,OAAO,OAAO,WAAW;AAChD;AAoBA,eAAsB,aACrB,MACA,UAA4B,CAAC,GAC7B,OACwB;AACxB,QAAM,MAAM,QAAQ,OAAO;AAC3B,QAAM,QAAQ,QAAQ,SAAS;AAE/B,MAAI;AACJ,MAAI,QAAQ,cAAc;AACzB,cAAU,QAAQ;AAAA,EACnB,OAAO;AACN,QAAI;AACH,gBAAU,MAAMA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,GAAG,EAAE,CAAC;AAAA,IACvE,SAAS,KAAc;AACtB,UAAI,WAAW,GAAG,EAAG,QAAO,CAAC;AAC7B,YAAM;AAAA,IACP;AAAA,EACD;AAEA,QAAM,WAAW,aAAa,KAAK,MAAM,IAAI,OAAO;AACpD,QAAM,SAAS,OAAO,aAAa,IAAkB,QAAQ;AAC7D,MAAI,WAAW,OAAO,UAAU,SAAS,cAAc,MAAM,IAAI;AAChE,WAAO;AAAA,MACN,sCAAsC,QAAQ,WAAW,KAAK;AAAA,IAC/D;AACA,WAAO,OAAO,MAAM,GAAG,KAAK;AAAA,EAC7B;AACA,SAAO;AAAA,IACN,uCAAuC,QAAQ,WAAW,KAAK;AAAA,EAChE;AAEA,MAAI,OAAO,YAAY,UAAU,MAAM,oBAAoB,IAAI;AAC9D,UAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAAA,EAChD;AAUA,QAAM,UAAU,MAAM;AAAA,IACrB;AAAA,MAAQ;AAAA,MAAO,WAAW,GAAG,UAAU,KAAK;AAAA,MAAI,MAC/CA,KAAI,IAAI,EAAE,GAAG,MAAM,KAAK,SAAS,MAAM,CAAC;AAAA,IACzC;AAAA,IACA,GAAG,KAAK,MAAM,IAAI,GAAG;AAAA,EACtB;AACA,QAAM,SAAS,QAAQ,IAAI,CAAC,YAAY;AAAA,IACvC,KAAK,OAAO;AAAA,IACZ,QAAQ,OAAO;AAAA,IACf,SAAS,OAAO,WAAW;AAAA,EAC5B,EAAE;AACF,MAAI,CAAC,UAAU,OAAO,SAAS,OAAO,QAAQ;AAC7C,WAAO,aAAa,IAAI,UAAU,MAAM;AAAA,EACzC;AACA,SAAO;AACR;AAGA,eAAsB,eACrB,MACA,UACA,KACA,OACgE;AAChE,QAAM,QAAQ,MAAM,eAAe,MAAM,UAAU,KAAK,KAAK;AAC7D,QAAM,WAAW,YAAY,KAAK;AAElC,SAAO;AAAA,IACN,SAAS,WAAW,SAAS,KAAK,IAAI,WAAW,KAAK;AAAA,IACtD,MAAM,MAAM;AAAA,IACZ;AAAA,EACD;AACD;AAOA,eAAsB,eACrB,MACA,UAA+C,CAAC,GAChD,OACuB;AACvB,QAAM,MAAM,QAAQ,OAAO;AAC3B,QAAM,WAAW,QAAQ,YAAY;AAErC,MAAI;AACJ,MAAI;AACJ,MAAI;AACH,UAAM,WAAW,MAAM,cAAc,MAAM,GAAG;AAC9C,aAAS,SAAS;AAClB,cAAU,SAAS;AAAA,EACpB,SAAS,KAAc;AACtB,QAAI,WAAW,GAAG,EAAG,QAAO,CAAC;AAC7B,UAAM;AAAA,EACP;AAEA,QAAM,WAAW,QAAQ,KAAK,MAAM,IAAI,OAAO,IAAI,QAAQ;AAC3D,QAAM,SAAS,OAAO,aAAa,IAAiB,QAAQ;AAC5D,MAAI,QAAQ;AACX,WAAO,SAAS,wCAAwC,QAAQ,EAAE;AAClE,WAAO;AAAA,EACR;AACA,SAAO,SAAS,yCAAyC,QAAQ,EAAE;AAWnE,MAAI,OAAO,UAAU;AACpB,UAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAAA,EAChD;AAEA,QAAM,UAAU,GAAG,KAAK,MAAM,IAAI,GAAG,IAAI,YAAY,GAAG;AACxD,MAAI;AACJ,MAAI,CAAC,UAAU;AACd,aAAS,MAAM;AAAA,MACd;AAAA,QAAQ;AAAA,QAAO;AAAA,QAA0B,MACxC,gBAAgB,MAAM,OAAO,IAAI;AAAA,MAClC;AAAA,MACA;AAAA,IACD;AAAA,EACD,OAAO;AACN,UAAM,QAAQ,MAAM;AAAA,MACnB;AAAA,QAAQ;AAAA,QAAO,iBAAiB,QAAQ;AAAA,QAAI,MAC3C,cAAc,MAAM,OAAO,MAAM,QAAQ;AAAA,MAC1C;AAAA,MACA;AAAA,IACD;AACA,QAAI,CAAC,OAAO;AACX,YAAM,IAAI;AAAA,QACT,SAAS,QAAQ,uBAAuB,GAAG;AAAA,MAC5C;AAAA,IACD;AACA,aACC,MAAM,SAAS,SACZ,CAAC,IACD,MAAM;AAAA,MACN;AAAA,QAAQ;AAAA,QAAO,mBAAmB,QAAQ;AAAA,QAAI,MAC7C,gBAAgB,MAAM,MAAM,KAAK,MAAM,IAAI;AAAA,MAC5C;AAAA,MACA;AAAA,IACD;AAAA,EACJ;AAEA,SAAO,aAAa,IAAI,UAAU,MAAM;AACxC,SAAO;AACR;AAMA,eAAsB,iBACrB,MACA,SACA,OACwB;AACxB,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,UAAU,MAAMA,KACpB,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,QAAQ,GAAG,EAAE,CAAC,EAC1D,MAAM,MAAM,IAAI;AAElB,QAAM,WAAW,UACd,WAAW,KAAK,MAAM,IAAI,OAAO,IAAI,KAAK,IAAI,IAAI,KAClD;AACH,MAAI,UAAU;AACb,UAAM,SAAS,OAAO,aAAa,IAAkB,QAAQ;AAC7D,QAAI,QAAQ;AACX,aAAO,SAAS,0CAA0C,QAAQ,EAAE;AACpE,aAAO;AAAA,IACR;AAAA,EACD;AACA,SAAO;AAAA,IACN,2CAA2C,YAAY,WAAW;AAAA,EACnE;AACA,MAAI,CAAC,QAAS,QAAO,CAAC;AAEtB,QAAM,MAAM,MAAM;AAAA,IACjB;AAAA,IACA,EAAE,KAAK,QAAQ,KAAK,OAAO,QAAQ,MAAM,cAAc,QAAQ;AAAA,IAC/D;AAAA,EACD;AACA,QAAM,SAAS,IAAI,MAAM,MAAM,OAAO,KAAK;AAE3C,MAAI,SAAU,QAAO,aAAa,IAAI,UAAU,MAAM;AACtD,SAAO;AACR;;;AD7TA,SAAS,kBAAkB,MAIzB;AACD,SAAO,gBAAgB,IAAI;AAC5B;AAEA,SAAS,kBAAkB,SAAyB;AACnD,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,GAAI,OAAM,IAAI;AAC9C,SAAO,MAAM;AACd;AAEA,SAAS,mBAAmB,QAMjB;AACV,QAAM,UAAU,OAAO,WAAW,KAAK,OAAO,IAAI;AAClD,QAAM,UAAU,OAAO,WAAW,KAAK,OAAO,IAAI;AAClD,QAAM,YAAY;AAAA,IACjB;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA,EAAE,SAAS,EAAE;AAAA,EACd,EAAE,QAAQ,SAAS,EAAE;AAErB,SAAO,gBAAgB,OAAO,IAAI,MAAM,OAAO,IAAI;AAAA,EAAK,SAAS;AAClE;AAEA,SAAS,cAAc,OAA+B;AACrD,SAAO;AAAA,IACN;AAAA,IACA,gBAAgB,MAAM,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC;AAAA,IAC7D,gBAAgB,MAAM,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC;AAAA,IAC7D,YAAY,MAAM;AAAA,EACnB;AACD;AAYA,SAAS,cACR,MACA,QACA,QACA,OACW;AACX,QAAM,WAAW,CAAC,EAAE,QAAQ,YAAY,OAAO;AAC/C,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,WAAW,CAAC,YAAY,QAAQ,kBAAkB,MAAM,IAAI,IAAI;AAAA,IAChE,WAAW,CAAC,YAAY,SAAS,kBAAkB,OAAO,IAAI,IAAI;AAAA,IAClE,OAAO,WACJ,KACA,mBAAmB;AAAA,MACnB;AAAA,MACA,QAAQ,QAAQ,QAAQ;AAAA,MACxB,OAAO,OAAO,QAAQ;AAAA,MACtB,SAAS,SAAS,SAAY;AAAA,MAC9B,SAAS,QAAQ,SAAY;AAAA,IAC9B,CAAC;AAAA,IACH;AAAA,IACA,YAAY,UAAU,WAAW,SAAS,OAAO,KAAK,IAAI;AAAA,IAC1D,YAAY,SAAS,WAAW,SAAS,MAAM,KAAK,IAAI;AAAA,IACxD,SAAS,QAAQ,MAAM;AAAA,IACvB,SAAS,OAAO,MAAM;AAAA,EACvB;AACD;AAOA,eAAe,aACd,MACA,QACA,QACsB;AACtB,QAAM,UAAU,MAAMC,KAAI,KAAK;AAAA,IAC9B,GAAG;AAAA,IACH,OAAO,CAACA,KAAI,KAAK,EAAE,KAAK,OAAO,CAAC,GAAGA,KAAI,KAAK,EAAE,KAAK,OAAO,CAAC,CAAC;AAAA,IAC5D,KAAK,OAAO,UAAU,CAAC,GAAG,CAAC,MAAM;AAChC,YAAM,CAAC,OAAO,KAAK,IAAI,MAAM,QAAQ,IAAI,CAAC,GAAG,KAAK,GAAG,GAAG,KAAK,CAAC,CAAC;AAE/D,UAAI,UAAU,UAAU,UAAU,OAAQ;AAE1C,UAAI,SAAS,CAAC,OAAO;AACpB,cAAMC,QAAO,IAAI,MAAM,EAAE,IAAI,IAAI;AACjC,cAAM,EAAE,KAAK,IAAI,MAAMD,KAAI,SAAS,EAAE,GAAG,MAAM,KAAKC,MAAK,CAAC;AAC1D,cAAM,SAAS,kBAAkB,IAAI;AACrC,eAAO,cAAc,UAAU,WAAW,QAAQ,IAAI;AAAA,MACvD;AAEA,UAAI,CAAC,SAAS,OAAO;AACpB,cAAMC,QAAO,IAAI,MAAM,EAAE,IAAI,IAAI;AACjC,cAAM,EAAE,KAAK,IAAI,MAAMF,KAAI,SAAS,EAAE,GAAG,MAAM,KAAKE,MAAK,CAAC;AAC1D,cAAM,QAAQ,kBAAkB,IAAI;AACpC,eAAO,cAAc,UAAU,SAAS,MAAM,KAAK;AAAA,MACpD;AAEA,YAAM,CAAC,MAAM,IAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,QACtC,IAAI,EAAE,IAAI,IAAI,QAAQ,QAAQ,EAAE;AAAA,QAChC,IAAI,EAAE,IAAI,IAAI,QAAQ,QAAQ,EAAE;AAAA,MACjC,CAAC;AAED,UAAI,SAAS,MAAM;AAClB,cAAM,CAAC,EAAE,MAAM,MAAM,GAAG,EAAE,MAAM,MAAM,CAAC,IAAI,MAAM,QAAQ,IAAI;AAAA,UAC5DF,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC;AAAA,UACnCA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC;AAAA,QACpC,CAAC;AACD,cAAM,SAAS,kBAAkB,KAAK;AACtC,cAAM,QAAQ,kBAAkB,KAAK;AACrC,eAAO,cAAc,UAAU,YAAY,QAAQ,KAAK;AAAA,MACzD;AAEA,aAAO;AAAA,IACR;AAAA,EACD,CAAC;AAED,UAAQ,WAAW,CAAC,GAAG;AAAA,IACtB,CAAC,MACA,MAAM,QAAQ,MAAM;AAAA,EACtB;AACD;AAGA,eAAsB,cACrB,MACA,WACsB;AACtB,MAAI;AACH,UAAM,SAAS,MAAM,UAAU,MAAM,SAAS;AAC9C,UAAM,SAAS,OAAO,OAAO,OAAO,CAAC;AAErC,QAAI,CAAC,QAAQ;AACZ,YAAM,UAA2C,CAAC;AAClD,YAAM,QAA+C;AAAA,QACpD,EAAE,SAAS,OAAO,OAAO,MAAM,QAAQ,GAAG;AAAA,MAC3C;AAEA,aAAO,MAAM,QAAQ;AACpB,cAAM,EAAE,SAAS,OAAO,IAAI,MAAM,IAAI;AAItC,cAAM,EAAE,KAAK,IAAI,MAAMA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC;AAC7D,mBAAW,SAAS,MAAM;AACzB,gBAAM,OAAO,SAAS,GAAG,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM;AACxD,cAAI,MAAM,SAAS,QAAQ;AAC1B,kBAAM,KAAK,EAAE,SAAS,MAAM,KAAK,QAAQ,KAAK,CAAC;AAAA,UAChD,WAAW,MAAM,SAAS,QAAQ;AACjC,oBAAQ,KAAK,EAAE,MAAM,MAAM,KAAK,MAAM,IAAI,CAAC;AAAA,UAC5C;AAAA,QACD;AAAA,MACD;AAEA,YAAMG,SAAoB,MAAM,QAAQ;AAAA,QACvC,QAAQ,IAAI,OAAO,EAAE,MAAM,IAAI,MAAM;AACpC,gBAAM,EAAE,KAAK,IAAI,MAAMH,KAAI,SAAS,EAAE,GAAG,MAAM,IAAI,CAAC;AACpD,gBAAM,QAAQ,kBAAkB,IAAI;AACpC,iBAAO,cAAc,MAAM,SAAS,MAAM,KAAK;AAAA,QAChD,CAAC;AAAA,MACF;AAEA,aAAO,cAAcG,MAAK;AAAA,IAC3B;AAEA,UAAM,QAAQ,MAAM,aAAa,MAAM,QAAQ,SAAS;AACxD,WAAO,cAAc,KAAK;AAAA,EAC3B,SAAS,OAAO;AACf,UAAM,IAAI,MAAM,8BAA8B,KAAK,EAAE;AAAA,EACtD;AACD;AAGA,eAAsB,mBACrB,MACA,SACA,YACsB;AACtB,QAAM,CAAC,SAAS,UAAU,IAAI,MAAM,QAAQ,IAAI;AAAA,IAC/CH,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,OAAO,EAAE,CAAC;AAAA,IAC1DA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,UAAU,EAAE,CAAC;AAAA,EAC9D,CAAC;AAED,QAAM,QAAQ,MAAM,aAAa,MAAM,SAAS,UAAU;AAC1D,SAAO,cAAc,KAAK;AAC3B;;;AG7MO,IAAM,qBAAqB;AAQ3B,IAAM,oBAAoB;AAGjC,IAAM,kBAAkB;AAExB,SAAS,QAAQ,QAAsC;AACtD,SAAO;AAAA,IACN,KAAK,OAAO;AAAA,IACZ,SAAS,OAAO,OAAO,QAAQ,KAAK;AAAA,IACpC,YAAY,OAAO,OAAO,OAAO;AAAA,IACjC,aAAa,OAAO,OAAO,OAAO;AAAA,IAClC,WAAW,IAAI,KAAK,OAAO,OAAO,OAAO,YAAY,GAAI,EAAE,YAAY;AAAA,EACxE;AACD;AAOA,eAAsB,eACrB,MACA,SAMA,OAC6B;AAC7B,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,YAAY,KAAK,IAAI,UAAU,KAAK;AAC1C,QAAM,UAAU,MAAM;AAAA,IAAQ;AAAA,IAAO,sBAAsB,SAAS;AAAA,IAAI,MACvE,aAAa,MAAM,EAAE,KAAK,QAAQ,KAAK,OAAO,UAAU,GAAG,KAAK;AAAA,EACjE;AACA,QAAM,OAAO,QAAQ,CAAC;AACtB,MAAI,CAAC,KAAM,QAAO,EAAE,SAAS,CAAC,GAAG,WAAW,MAAM;AAElD,QAAM,WAAW,gBAAgB,KAAK,MAAM,IAAI,KAAK,GAAG,IAAI,QAAQ,QAAQ,IAAI,KAAK,IAAI,QAAQ;AACjG,QAAM,SAAS,OAAO,aAAa,IAAuB,QAAQ;AAClE,MAAI,QAAQ;AACX,WAAO,SAAS,yDAAyD;AACzE,WAAO;AAAA,EACR;AACA,SAAO,SAAS,oDAAoD;AAEpE,QAAM,QAAQ,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;AAEnE,QAAM,kBAAkB,oBAAI,IAA2B;AACvD,iBAAe,WAAW,eAA+C;AACxE,UAAM,YAAY,gBAAgB,IAAI,aAAa;AACnD,QAAI,cAAc,OAAW,QAAO;AACpC,UAAM,QAAQ,MAAM,cAAc,MAAM,eAAe,QAAQ,QAAQ;AACvE,UAAM,MAAM,OAAO,SAAS,SAAS,MAAM,MAAM;AACjD,oBAAgB,IAAI,eAAe,GAAG;AACtC,WAAO;AAAA,EACR;AAEA,QAAM,UAA8B,CAAC;AACrC,MAAI,YAAY;AAEhB,QAAO,UACF,cAAc,GAClB,cAAc,QAAQ,QACtB,eAAe,iBACd;AACD,UAAM,YAAY,KAAK,IAAI,cAAc,iBAAiB,QAAQ,MAAM;AAExE,UAAM,cAAc,KAAK,IAAI,YAAY,GAAG,QAAQ,MAAM;AAE1D,UAAM,QAAQ;AAAA,MACb,QACE,MAAM,aAAa,WAAW,EAC9B,IAAI,CAAC,WAAW,WAAW,OAAO,OAAO,IAAI,CAAC;AAAA,IACjD;AAEA,aAAS,IAAI,aAAa,IAAI,WAAW,KAAK;AAC7C,YAAM,SAAS,QAAQ,CAAC;AACxB,UAAI,CAAC,OAAQ,OAAM;AAEnB,YAAM,YAAY,OAAO,OAAO,OAAO,CAAC;AACxC,YAAM,eAAe,YAAY,MAAM,IAAI,SAAS,IAAI;AACxD,UAAI,aAAa,CAAC,cAAc;AAG/B,oBAAY;AACZ,cAAM;AAAA,MACP;AAEA,YAAM,CAAC,KAAK,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,QAC1C,WAAW,OAAO,OAAO,IAAI;AAAA,QAC7B,eACG,WAAW,aAAa,OAAO,IAAI,IACnC,QAAQ,QAAQ,IAAI;AAAA,MACxB,CAAC;AAED,UAAI,QAAQ,WAAW;AACtB,gBAAQ,KAAK,QAAQ,MAAM,CAAC;AAC5B,YAAI,QAAQ,UAAU,OAAO;AAC5B,sBAAY,IAAI,QAAQ,SAAS;AACjC,gBAAM;AAAA,QACP;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,QAAM,SAAS,EAAE,SAAS,UAAU;AACpC,SAAO,aAAa,IAAI,UAAU,MAAM;AACxC,SAAO;AACR;;;AChIA,IAAMI,sBAAqB;AAU3B,IAAMC,mBAAkB;AAExB,SAAS,iBAAiB,QAAoC;AAC7D,SAAO;AAAA,IACN,KAAK,OAAO;AAAA,IACZ,SAAS,OAAO,OAAO,QAAQ,KAAK;AAAA,IACpC,YAAY,OAAO,OAAO,OAAO;AAAA,IACjC,aAAa,OAAO,OAAO,OAAO;AAAA,IAClC,WAAW,IAAI,KAAK,OAAO,OAAO,OAAO,YAAY,GAAI,EAAE,YAAY;AAAA,EACxE;AACD;AAYA,eAAsB,sBACrB,MACA,SACA,OAC0C;AAC1C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,QAAQ,QAAQ,SAASD;AAC/B,QAAM,UAAU,MAAM;AAAA,IAAQ;AAAA,IAAO,sBAAsB,KAAK;AAAA,IAAI,MACnE,aAAa,MAAM,EAAE,KAAK,QAAQ,KAAK,MAAM,GAAG,KAAK;AAAA,EACtD;AACA,SAAO,SAAS,0BAA0B,QAAQ,MAAM,iBAAiB;AACzE,QAAM,OAAO,QAAQ,CAAC;AACtB,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,WAAW,gBAAgB,KAAK,MAAM,IAAI,KAAK,GAAG,IAAI,QAAQ;AACpE,QAAM,eACL,OAAO,aAAa,IAAoC,QAAQ;AACjE,MAAI,cAAc;AACjB,WAAO;AAAA,MACN;AAAA,IACD;AACA,WAAO;AAAA,EACR;AACA,SAAO,SAAS,2DAA2D;AAE3E,QAAM,QAAQ,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;AAMnE,QAAM,qBAAqB,oBAAI,IAA2B;AAC1D,QAAM,mBAAmB,oBAAI,IAG3B;AAEF,iBAAe,cAAc,eAA+C;AAC3E,UAAM,SAAS,mBAAmB,IAAI,aAAa;AACnD,QAAI,WAAW,OAAW,QAAO;AACjC,UAAM,QAAQ,MAAM,cAAc,MAAM,eAAe,QAAQ;AAC/D,UAAM,SAAS,OAAO,SAAS,SAAS,MAAM,MAAM;AACpD,uBAAmB,IAAI,eAAe,MAAM;AAC5C,WAAO;AAAA,EACR;AAEA,iBAAe,gBAAgB,QAAuB;AACrD,QAAI,WAAW,KAAM,QAAO,CAAC;AAC7B,UAAM,SAAS,iBAAiB,IAAI,MAAM;AAC1C,QAAI,OAAQ,QAAO;AACnB,UAAM,WAAW,MAAM,gBAAgB,MAAM,QAAQ,QAAQ;AAC7D,qBAAiB,IAAI,QAAQ,QAAQ;AACrC,WAAO;AAAA,EACR;AAEA,QAAM,aAAa,MAAM,cAAc,KAAK,OAAO,IAAI;AACvD,MAAI,eAAe,KAAM,QAAO,CAAC;AAIjC,QAAM,eAAe,MAAM,gBAAgB,UAAU;AACrD,QAAM,YAAY,IAAI,IAAI,aAAa,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC;AACjE,QAAM,SAAyC,CAAC;AAEhD,MAAI,gBAAgB;AACpB,MAAI,kBAAkB;AACtB,QAAM,YAAY,YAAY,IAAI;AAElC,QAAO,UACF,cAAc,GAClB,cAAc,QAAQ,UAAU,UAAU,OAAO,GACjD,eAAeC,kBACd;AACD,UAAM,YAAY,KAAK,IAAI,cAAcA,kBAAiB,QAAQ,MAAM;AAExE,UAAM,cAAc,KAAK,IAAI,YAAY,GAAG,QAAQ,MAAM;AAC1D;AAKA,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC7B,QACE,MAAM,aAAa,WAAW,EAC9B,IAAI,CAAC,WAAW,cAAc,OAAO,OAAO,IAAI,CAAC;AAAA,IACpD;AAIA,UAAM,QAAQ;AAAA,MACb,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,WAAW,gBAAgB,MAAM,CAAC;AAAA,IAC9D;AAEA,aAAS,IAAI,aAAa,IAAI,WAAW,KAAK;AAC7C,UAAI,UAAU,SAAS,EAAG,OAAM;AAChC,YAAM,SAAS,QAAQ,CAAC;AACxB,UAAI,CAAC,OAAQ,OAAM;AACnB;AAEA,YAAM,YAAY,OAAO,OAAO,OAAO,CAAC;AACxC,YAAM,eAAe,YAAY,MAAM,IAAI,SAAS,IAAI;AACxD,UAAI,aAAa,CAAC,aAAc,OAAM;AAItC,YAAM,CAAC,QAAQ,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,QAChD,cAAc,OAAO,OAAO,IAAI;AAAA,QAChC,eACG,cAAc,aAAa,OAAO,IAAI,IACtC,QAAQ,QAAQ,IAAI;AAAA,MACxB,CAAC;AAED,UAAI,WAAW,aAAc;AAE7B,YAAM,CAAC,UAAU,cAAc,IAAI,MAAM,QAAQ,IAAI;AAAA,QACpD,gBAAgB,MAAM;AAAA,QACtB,gBAAgB,YAAY;AAAA,MAC7B,CAAC;AACD,YAAM,cAAc,IAAI;AAAA,QACvB,SAAS,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,GAAG,CAAC;AAAA,MAChD;AACA,YAAM,oBAAoB,IAAI;AAAA,QAC7B,eAAe,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,GAAG,CAAC;AAAA,MACtD;AAEA,iBAAW,QAAQ,WAAW;AAC7B,YAAI,YAAY,IAAI,IAAI,MAAM,kBAAkB,IAAI,IAAI,GAAG;AAC1D,iBAAO,IAAI,IAAI,iBAAiB,MAAM;AAAA,QACvC;AAAA,MACD;AACA,iBAAW,QAAQ,OAAO,KAAK,MAAM,GAAG;AACvC,kBAAU,OAAO,IAAI;AAAA,MACtB;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AAAA,IACN,iCAAiC,aAAa,IAAI,QAAQ,MAAM,mBAAmB,eAAe,yBAAyB,YAAY,IAAI,IAAI,WAAW,QAAQ,CAAC,CAAC,OAAO,mBAAmB,IAAI,yBAAyB,UAAU,IAAI;AAAA,EAC1O;AAEA,SAAO,aAAa,IAAI,UAAU,MAAM;AACxC,SAAO;AACR;;;AChMA,OAAOC,UAAS;AAqBhB,eAAsB,aACrB,MACA,cACA,cACyB;AACzB,uBAAqB,YAAY;AACjC,uBAAqB,YAAY;AAEjC,MAAI;AACH,UAAM,CAAC,WAAW,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,MAChDC,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,YAAY,EAAE,CAAC;AAAA,MAC/DA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,YAAY,EAAE,CAAC;AAAA,IAChE,CAAC;AAED,UAAM,eAAe,MAAMA,KAAI,aAAa;AAAA,MAC3C,GAAG;AAAA,MACH,KAAK;AAAA,MACL,UAAU;AAAA,IACX,CAAC;AAED,WAAO;AAAA,MACN,UAAU;AAAA,MACV,cAAc;AAAA,MACd,kBAAkB,CAAC;AAAA,MACnB,aAAa;AAAA,IACd;AAAA,EACD,SAAS,KAAK;AACb,QAAK,KAA2B,SAAS,iBAAiB;AACzD,YAAM;AAAA,IACP;AAKA,WAAO;AAAA,MACN,UAAU;AAAA,MACV,cAAc;AAAA,MACd,kBAAkB,CAAC;AAAA,MACnB,aAAa;AAAA,IACd;AAAA,EACD;AACD;AASA,eAAsB,iBACrB,MACA,cACA,cACuD;AACvD,uBAAqB,YAAY;AACjC,uBAAqB,YAAY;AACjC,QAAM,CAAC,WAAW,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,IAChDA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,cAAc,YAAY,GAAG,CAAC;AAAA,IAC7DA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,cAAc,YAAY,GAAG,CAAC;AAAA,EAC9D,CAAC;AACD,QAAM,OAAO,MAAMA,KAAI,aAAa;AAAA,IACnC,GAAG;AAAA,IACH,KAAK;AAAA,IACL,UAAU;AAAA,EACX,CAAC;AACD,MAAI,CAAC,KAAM,QAAO;AAClB,QAAMA,KAAI,SAAS;AAAA,IAClB,GAAG;AAAA,IACH,KAAK,cAAc,YAAY;AAAA,IAC/B,OAAO;AAAA,IACP,OAAO;AAAA,EACR,CAAC;AACD,SAAO,EAAE,SAAS,MAAM,WAAW,UAAU;AAC9C;","names":["git","git","git","git","git","git","oidA","oidB","files","HISTORY_WALK_DEPTH","PREFETCH_WINDOW","git","git"]}
+{"version":3,"sources":["../src/ops/commit.ts","../src/ops/tree.ts","../src/ops/diff.ts","../src/ops/history.ts","../src/ops/types.ts","../src/ops/file-history.ts","../src/ops/last-commit.ts","../src/ops/merge.ts"],"sourcesContent":["import git from \"isomorphic-git\";\nimport { assertSafeBranchName } from \"./branch.js\";\nimport { deleteFromTree, upsertTree } from \"./tree.js\";\nimport type { Repo } from \"./types.js\";\n\nexport interface CommitAuthor {\n\tname: string;\n\temail: string;\n\ttimestamp: number;\n\ttimezoneOffset: number;\n}\n\n/** An author stamped with the current time. */\nexport function authorNow(name: string, email: string): CommitAuthor {\n\treturn {\n\t\tname,\n\t\temail,\n\t\ttimestamp: Math.floor(Date.now() / 1000),\n\t\ttimezoneOffset: 0,\n\t};\n}\n\n/**\n * Write a commit directly to a bare repository — no worktree, no checkout.\n * `buildTree` receives the parent commit's tree oid (undefined on an empty\n * repo / unborn branch) and returns the new root tree oid; this function\n * writes the commit object and force-updates `refs/heads/<branch>`.\n *\n * Serialize concurrent writers externally (a per-repo lock): the\n * resolve-ref → write-ref sequence is not atomic on object storage.\n */\nexport async function writeCommitToBare(\n\trepo: Repo,\n\toptions: {\n\t\tbranch: string;\n\t\tmessage: string;\n\t\tauthor: CommitAuthor;\n\t\tbuildTree: (parentTreeOid: string | undefined) => Promise<string>;\n\t},\n): Promise<string> {\n\tassertSafeBranchName(options.branch);\n\tlet parentOid: string | undefined;\n\tlet parentTreeOid: string | undefined;\n\ttry {\n\t\tparentOid = await git.resolveRef({\n\t\t\t...repo,\n\t\t\tref: `refs/heads/${options.branch}`,\n\t\t});\n\t\tconst { commit } = await git.readCommit({ ...repo, oid: parentOid });\n\t\tparentTreeOid = commit.tree;\n\t} catch (err) {\n\t\tif ((err as { code?: string })?.code !== \"NotFoundError\") {\n\t\t\tthrow err;\n\t\t}\n\t\t// empty repo — first commit\n\t}\n\tconst treeOid = await options.buildTree(parentTreeOid);\n\tconst commitOid = await git.writeCommit({\n\t\t...repo,\n\t\tcommit: {\n\t\t\tmessage: options.message,\n\t\t\ttree: treeOid,\n\t\t\tparent: parentOid ? [parentOid] : [],\n\t\t\tauthor: options.author,\n\t\t\tcommitter: options.author,\n\t\t},\n\t});\n\tawait git.writeRef({\n\t\t...repo,\n\t\tref: `refs/heads/${options.branch}`,\n\t\tvalue: commitOid,\n\t\tforce: true,\n\t});\n\treturn commitOid;\n}\n\n/**\n * Commit a set of files onto a branch, straight to the bare repo. Each blob\n * is written to its own content-addressed key — no shared state between\n * files, so they're written in parallel.\n */\nexport function commitFilesToBare(\n\trepo: Repo,\n\toptions: {\n\t\tbranch: string;\n\t\tmessage: string;\n\t\tauthor: CommitAuthor;\n\t\tfiles: Array<{ path: string; content: string | Uint8Array }>;\n\t},\n): Promise<string> {\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid) => {\n\t\t\tconst blobs = new Map<string, string>();\n\t\t\tawait Promise.all(\n\t\t\t\toptions.files.map(async (file) => {\n\t\t\t\t\tconst content =\n\t\t\t\t\t\ttypeof file.content === \"string\"\n\t\t\t\t\t\t\t? new TextEncoder().encode(file.content)\n\t\t\t\t\t\t\t: file.content;\n\t\t\t\t\tconst oid = await git.writeBlob({ ...repo, blob: content });\n\t\t\t\t\tblobs.set(file.path, oid);\n\t\t\t\t}),\n\t\t\t);\n\t\t\treturn upsertTree(repo, parentTreeOid, blobs);\n\t\t},\n\t});\n}\n\n/** Commit the removal of one file from a branch, straight to the bare repo. */\nexport function deleteFileFromBare(\n\trepo: Repo,\n\toptions: {\n\t\tbranch: string;\n\t\tfilePath: string;\n\t\tmessage: string;\n\t\tauthor: CommitAuthor;\n\t},\n): Promise<string> {\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid) => {\n\t\t\tif (!parentTreeOid) {\n\t\t\t\tthrow new Error(`Branch ${options.branch} is empty`);\n\t\t\t}\n\t\t\treturn deleteFromTree(repo, parentTreeOid, options.filePath);\n\t\t},\n\t});\n}\n","import git from \"isomorphic-git\";\nimport type { Repo } from \"./types.js\";\n\nexport interface TreeEntry {\n\tpath: string;\n\tmode: string;\n\ttype: \"blob\" | \"tree\";\n\toid: string;\n\tsize?: number;\n}\n\nconst joinPath = (prefix: string, name: string) =>\n\tprefix ? `${prefix.replace(/\\/+$/, \"\")}/${name}` : name;\n\n/**\n * Build/update a git tree by overlaying new blobs onto an existing tree,\n * returning the new root tree oid. `entries` maps relative paths to blob oids.\n */\nexport async function upsertTree(\n\trepo: Repo,\n\ttreeOid: string | undefined,\n\tentries: Map<string, string>,\n): Promise<string> {\n\tconst existing = treeOid\n\t\t? (await git.readTree({ ...repo, oid: treeOid })).tree\n\t\t: [];\n\tconst byName = new Map(existing.map((e) => [e.path, e]));\n\tconst direct = new Map<string, string>();\n\tconst nested = new Map<string, Map<string, string>>();\n\tfor (const [filePath, blobOid] of entries) {\n\t\tconst slash = filePath.indexOf(\"/\");\n\t\tif (slash === -1) {\n\t\t\tdirect.set(filePath, blobOid);\n\t\t} else {\n\t\t\tconst dir = filePath.slice(0, slash);\n\t\t\tconst rest = filePath.slice(slash + 1);\n\t\t\tif (!nested.has(dir)) nested.set(dir, new Map());\n\t\t\tnested.get(dir)?.set(rest, blobOid);\n\t\t}\n\t}\n\tfor (const [name, blobOid] of direct) {\n\t\tbyName.set(name, {\n\t\t\tmode: \"100644\",\n\t\t\tpath: name,\n\t\t\toid: blobOid,\n\t\t\ttype: \"blob\",\n\t\t});\n\t}\n\t// Sibling subdirectories are independent subtree writes — no reason to\n\t// serialize them for multi-file commits touching several directories.\n\tconst nestedResults = await Promise.all(\n\t\tArray.from(nested, async ([dir, subEntries]) => {\n\t\t\tconst entry = byName.get(dir);\n\t\t\tconst subtreeOid = entry?.type === \"tree\" ? entry.oid : undefined;\n\t\t\tconst newOid = await upsertTree(repo, subtreeOid, subEntries);\n\t\t\treturn [dir, newOid] as const;\n\t\t}),\n\t);\n\tfor (const [dir, newOid] of nestedResults) {\n\t\tbyName.set(dir, { mode: \"040000\", path: dir, oid: newOid, type: \"tree\" });\n\t}\n\treturn git.writeTree({ ...repo, tree: Array.from(byName.values()) });\n}\n\n/** Remove a file path from a tree, returning the new root tree oid. */\nexport async function deleteFromTree(\n\trepo: Repo,\n\ttreeOid: string,\n\tfilePath: string,\n): Promise<string> {\n\tconst existing = (await git.readTree({ ...repo, oid: treeOid })).tree;\n\tconst byName = new Map(existing.map((e) => [e.path, e]));\n\tconst slash = filePath.indexOf(\"/\");\n\tif (slash === -1) {\n\t\tbyName.delete(filePath);\n\t} else {\n\t\tconst dir = filePath.slice(0, slash);\n\t\tconst rest = filePath.slice(slash + 1);\n\t\tconst entry = byName.get(dir);\n\t\tif (entry?.type === \"tree\") {\n\t\t\tconst newOid = await deleteFromTree(repo, entry.oid, rest);\n\t\t\tbyName.set(dir, { ...entry, oid: newOid });\n\t\t}\n\t}\n\treturn git.writeTree({ ...repo, tree: Array.from(byName.values()) });\n}\n\n/** Resolve a path inside a tree to its entry, or null when absent. */\nexport async function findTreeEntry(\n\trepo: Repo,\n\trootTreeOid: string,\n\ttreePath: string,\n): Promise<TreeEntry | null> {\n\tif (!treePath) {\n\t\treturn { path: \"\", mode: \"040000\", type: \"tree\", oid: rootTreeOid };\n\t}\n\n\tconst parts = treePath.split(\"/\").filter(Boolean);\n\tlet currentTreeOid = rootTreeOid;\n\tlet currentPath = \"\";\n\n\tfor (const [index, part] of parts.entries()) {\n\t\tconst tree = await git.readTree({ ...repo, oid: currentTreeOid });\n\t\tconst entry = tree.tree.find((candidate) => candidate.path === part);\n\n\t\tif (!entry) return null;\n\n\t\tcurrentPath = currentPath ? joinPath(currentPath, entry.path) : entry.path;\n\n\t\tif (index === parts.length - 1) {\n\t\t\treturn {\n\t\t\t\tpath: currentPath,\n\t\t\t\tmode: entry.mode,\n\t\t\t\ttype: entry.type as \"blob\" | \"tree\",\n\t\t\t\toid: entry.oid,\n\t\t\t};\n\t\t}\n\n\t\tif (entry.type !== \"tree\") return null;\n\n\t\tcurrentTreeOid = entry.oid;\n\t}\n\n\treturn null;\n}\n\n/** List a tree's direct entries, with paths prefixed by `prefix`. */\nexport async function listTreeEntries(\n\trepo: Repo,\n\ttreeOid: string,\n\tprefix = \"\",\n): Promise<TreeEntry[]> {\n\tconst tree = await git.readTree({ ...repo, oid: treeOid });\n\n\treturn tree.tree.map((entry) => ({\n\t\tpath: prefix ? joinPath(prefix, entry.path) : entry.path,\n\t\tmode: entry.mode,\n\t\ttype: entry.type as \"blob\" | \"tree\",\n\t\toid: entry.oid,\n\t}));\n}\n","import { createTwoFilesPatch } from \"diff\";\nimport git from \"isomorphic-git\";\nimport { readBlobContent, toBase64 } from \"../edge-utils.js\";\nimport { qualifyBranchRef } from \"../refs.js\";\nimport { getCommit } from \"./history.js\";\nimport type { Repo } from \"./types.js\";\n\nexport interface DiffFile {\n\tpath: string;\n\tstatus: \"added\" | \"modified\" | \"deleted\" | \"renamed\";\n\tadditions: number;\n\tdeletions: number;\n\tpatch: string;\n\toldPath?: string;\n\tisBinary?: boolean;\n\toldContent?: string;\n\tnewContent?: string;\n\toldSize?: number;\n\tnewSize?: number;\n}\n\nexport interface DiffResult {\n\tfiles: DiffFile[];\n\ttotalAdditions: number;\n\ttotalDeletions: number;\n\ttotalFiles: number;\n}\n\n/** Binary detection via null-byte heuristic. */\nfunction detectBlobContent(blob: Uint8Array): {\n\tisBinary: boolean;\n\ttext: string;\n\tbytes: Uint8Array;\n} {\n\treturn readBlobContent(blob);\n}\n\nfunction countContentLines(content: string): number {\n\tif (content.length === 0) return 0;\n\tconst lines = content.split(\"\\n\");\n\tif (lines[lines.length - 1] === \"\") lines.pop();\n\treturn lines.length;\n}\n\nfunction createUnifiedPatch(params: {\n\tpath: string;\n\tbefore: string;\n\tafter: string;\n\toldPath?: string;\n\tnewPath?: string;\n}): string {\n\tconst oldPath = params.oldPath ?? `a/${params.path}`;\n\tconst newPath = params.newPath ?? `b/${params.path}`;\n\tconst patchBody = createTwoFilesPatch(\n\t\toldPath,\n\t\tnewPath,\n\t\tparams.before,\n\t\tparams.after,\n\t\t\"\",\n\t\t\"\",\n\t\t{ context: 3 },\n\t).replace(/^=+\\n/, \"\");\n\n\treturn `diff --git a/${params.path} b/${params.path}\\n${patchBody}`;\n}\n\nfunction summarizeDiff(files: DiffFile[]): DiffResult {\n\treturn {\n\t\tfiles,\n\t\ttotalAdditions: files.reduce((sum, f) => sum + f.additions, 0),\n\t\ttotalDeletions: files.reduce((sum, f) => sum + f.deletions, 0),\n\t\ttotalFiles: files.length,\n\t};\n}\n\ntype BlobContent = { isBinary: boolean; text: string; bytes: Uint8Array };\n\n/**\n * Build one `DiffFile` from a path's before/after content — `before: null`\n * for an added file, `after: null` for a deleted one, both present for a\n * modification. The shared core of walkTreeDiff's three branches and\n * getCommitDiff's root-commit case (every file is an addition there, with no\n * two-tree walk to drive it), which each used to duplicate this field\n * construction independently.\n */\nfunction buildDiffFile(\n\tpath: string,\n\tstatus: DiffFile[\"status\"],\n\tbefore: BlobContent | null,\n\tafter: BlobContent | null,\n): DiffFile {\n\tconst isBinary = !!(before?.isBinary || after?.isBinary);\n\treturn {\n\t\tpath,\n\t\tstatus,\n\t\tadditions: !isBinary && after ? countContentLines(after.text) : 0,\n\t\tdeletions: !isBinary && before ? countContentLines(before.text) : 0,\n\t\tpatch: isBinary\n\t\t\t? \"\"\n\t\t\t: createUnifiedPatch({\n\t\t\t\t\tpath,\n\t\t\t\t\tbefore: before?.text ?? \"\",\n\t\t\t\t\tafter: after?.text ?? \"\",\n\t\t\t\t\toldPath: before ? undefined : \"/dev/null\",\n\t\t\t\t\tnewPath: after ? undefined : \"/dev/null\",\n\t\t\t\t}),\n\t\tisBinary,\n\t\toldContent: before && isBinary ? toBase64(before.bytes) : undefined,\n\t\tnewContent: after && isBinary ? toBase64(after.bytes) : undefined,\n\t\toldSize: before?.bytes.length,\n\t\tnewSize: after?.bytes.length,\n\t};\n}\n\n/**\n * Walk two trees (oldOid -> newOid) and return one DiffFile per changed path\n * — the shared core of both {@link getCommitDiff} (parent -> commit) and\n * {@link getDiffBetweenRefs} (base -> compare).\n */\nasync function walkTreeDiff(\n\trepo: Repo,\n\toldOid: string,\n\tnewOid: string,\n): Promise<DiffFile[]> {\n\tconst changes = await git.walk({\n\t\t...repo,\n\t\ttrees: [git.TREE({ ref: oldOid }), git.TREE({ ref: newOid })],\n\t\tmap: async (filepath, [A, B]) => {\n\t\t\tconst [typeA, typeB] = await Promise.all([A?.type(), B?.type()]);\n\n\t\t\tif (typeA === \"tree\" || typeB === \"tree\") return;\n\n\t\t\tif (typeA && !typeB) {\n\t\t\t\tconst oidA = A ? await A.oid() : \"\";\n\t\t\t\tconst { blob } = await git.readBlob({ ...repo, oid: oidA });\n\t\t\t\tconst before = detectBlobContent(blob);\n\t\t\t\treturn buildDiffFile(filepath, \"deleted\", before, null);\n\t\t\t}\n\n\t\t\tif (!typeA && typeB) {\n\t\t\t\tconst oidB = B ? await B.oid() : \"\";\n\t\t\t\tconst { blob } = await git.readBlob({ ...repo, oid: oidB });\n\t\t\t\tconst after = detectBlobContent(blob);\n\t\t\t\treturn buildDiffFile(filepath, \"added\", null, after);\n\t\t\t}\n\n\t\t\tconst [oidA, oidB] = await Promise.all([\n\t\t\t\tA ? A.oid() : Promise.resolve(\"\"),\n\t\t\t\tB ? B.oid() : Promise.resolve(\"\"),\n\t\t\t]);\n\n\t\t\tif (oidA !== oidB) {\n\t\t\t\tconst [{ blob: blobA }, { blob: blobB }] = await Promise.all([\n\t\t\t\t\tgit.readBlob({ ...repo, oid: oidA }),\n\t\t\t\t\tgit.readBlob({ ...repo, oid: oidB }),\n\t\t\t\t]);\n\t\t\t\tconst before = detectBlobContent(blobA);\n\t\t\t\tconst after = detectBlobContent(blobB);\n\t\t\t\treturn buildDiffFile(filepath, \"modified\", before, after);\n\t\t\t}\n\n\t\t\treturn null;\n\t\t},\n\t});\n\n\treturn (changes ?? []).filter(\n\t\t(c: DiffFile | null | undefined): c is DiffFile =>\n\t\t\tc !== null && c !== undefined,\n\t);\n}\n\n/** The diff a single commit introduced (against its first parent). */\nexport async function getCommitDiff(\n\trepo: Repo,\n\tcommitSha: string,\n): Promise<DiffResult> {\n\ttry {\n\t\tconst commit = await getCommit(repo, commitSha);\n\t\tconst parent = commit.commit.parent[0];\n\n\t\tif (!parent) {\n\t\t\tconst entries: { path: string; oid: string }[] = [];\n\t\t\tconst stack: { treeOid: string; prefix: string }[] = [\n\t\t\t\t{ treeOid: commit.commit.tree, prefix: \"\" },\n\t\t\t];\n\n\t\t\twhile (stack.length) {\n\t\t\t\tconst { treeOid, prefix } = stack.pop() as {\n\t\t\t\t\ttreeOid: string;\n\t\t\t\t\tprefix: string;\n\t\t\t\t};\n\t\t\t\tconst { tree } = await git.readTree({ ...repo, oid: treeOid });\n\t\t\t\tfor (const entry of tree) {\n\t\t\t\t\tconst full = prefix ? `${prefix}/${entry.path}` : entry.path;\n\t\t\t\t\tif (entry.type === \"tree\") {\n\t\t\t\t\t\tstack.push({ treeOid: entry.oid, prefix: full });\n\t\t\t\t\t} else if (entry.type === \"blob\") {\n\t\t\t\t\t\tentries.push({ path: full, oid: entry.oid });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst files: DiffFile[] = await Promise.all(\n\t\t\t\tentries.map(async ({ path, oid }) => {\n\t\t\t\t\tconst { blob } = await git.readBlob({ ...repo, oid });\n\t\t\t\t\tconst after = detectBlobContent(blob);\n\t\t\t\t\treturn buildDiffFile(path, \"added\", null, after);\n\t\t\t\t}),\n\t\t\t);\n\n\t\t\treturn summarizeDiff(files);\n\t\t}\n\n\t\tconst files = await walkTreeDiff(repo, parent, commitSha);\n\t\treturn summarizeDiff(files);\n\t} catch (error) {\n\t\tthrow new Error(`Failed to get commit diff: ${error}`);\n\t}\n}\n\n/** The diff between two refs (base -> compare). */\nexport async function getDiffBetweenRefs(\n\trepo: Repo,\n\tbaseRef: string,\n\tcompareRef: string,\n): Promise<DiffResult> {\n\tconst [baseOid, compareOid] = await Promise.all([\n\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(baseRef) }),\n\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(compareRef) }),\n\t]);\n\n\tconst files = await walkTreeDiff(repo, baseOid, compareOid);\n\treturn summarizeDiff(files);\n}\n","import git from \"isomorphic-git\";\nimport { decodeUtf8, hasNullByte, toBase64 } from \"../edge-utils.js\";\nimport {\n\tGitObjectNotFoundError,\n\tGitPathNotFoundError,\n\tGitRefNotFoundError,\n} from \"../git-errors.js\";\nimport { qualifyBranchRef } from \"../refs.js\";\nimport { findTreeEntry, listTreeEntries, type TreeEntry } from \"./tree.js\";\nimport { type OpsHooks, type Repo, runStep } from \"./types.js\";\n\n/**\n * A resolved ref (branch/commit) not existing is a normal, expected condition\n * (empty repo, unborn branch) and is handled by each caller. An object that\n * fails to resolve *underneath* an already-resolved ref (a tree/blob the\n * stored pack doesn't actually contain) means the repo's storage is\n * inconsistent — surface that distinctly so callers don't render it as\n * \"empty\" and clients don't see a raw isomorphic-git NotFoundError.\n */\nfunction wrapMissingObject<T>(\n\tpromise: Promise<T>,\n\tcontext: string,\n): Promise<T> {\n\treturn promise.catch((err: unknown) => {\n\t\tif ((err as { code?: string })?.code === \"NotFoundError\") {\n\t\t\tthrow new GitObjectNotFoundError(\n\t\t\t\t`Git data for ${context} is missing from storage. The repository may need to be re-pushed to repair it.`,\n\t\t\t);\n\t\t}\n\t\tthrow err;\n\t});\n}\n\nconst isNotFound = (err: unknown) =>\n\t(err as { code?: string })?.code === \"NotFoundError\";\n\nexport interface CommitInfo {\n\toid: string;\n\tcommit: {\n\t\tmessage: string;\n\t\ttree: string;\n\t\tparent: string[];\n\t\tauthor: {\n\t\t\tname: string;\n\t\t\temail: string;\n\t\t\ttimestamp: number;\n\t\t\ttimezoneOffset: number;\n\t\t};\n\t\tcommitter: {\n\t\t\tname: string;\n\t\t\temail: string;\n\t\t\ttimestamp: number;\n\t\t\ttimezoneOffset: number;\n\t\t};\n\t};\n\tpayload: string;\n}\n\n/**\n * Resolve a branch name / full ref / sha to its commit. The ref not\n * resolving (unborn branch, genuinely empty repo) and the ref resolving but\n * its commit object being unreadable (storage inconsistency — see\n * `wrapMissingObject` above) are different failures with different meanings,\n * so only the first is left as a raw isomorphic-git NotFoundError for\n * callers to treat as \"empty\"; the second is wrapped into\n * GitObjectNotFoundError specifically so it can't be mistaken for the first\n * by an `isNotFound`-style check downstream (see getTreeFromRef/getCommitLog).\n */\nexport async function resolveCommit(repo: Repo, ref: string) {\n\tconst oid = await git\n\t\t.resolveRef({ ...repo, ref: qualifyBranchRef(ref) })\n\t\t.catch((err: unknown) => {\n\t\t\tif (isNotFound(err)) {\n\t\t\t\tthrow new GitRefNotFoundError(`Ref ${ref} does not exist`);\n\t\t\t}\n\t\t\tthrow err;\n\t\t});\n\tconst result = await wrapMissingObject(\n\t\tgit.readCommit({ ...repo, oid }),\n\t\t`${repo.gitdir} commit ${oid}`,\n\t);\n\treturn { oid, commit: result.commit };\n}\n\n/** Read a blob's bytes by oid. */\nexport async function getBlob(repo: Repo, sha: string): Promise<Uint8Array> {\n\tconst { blob } = await wrapMissingObject(\n\t\tgit.readBlob({ ...repo, oid: sha }),\n\t\t`${repo.gitdir} blob ${sha}`,\n\t);\n\treturn blob;\n}\n\n/** Read a file's bytes at a ref. Throws GitPathNotFoundError when absent. */\nexport async function getFileContent(\n\trepo: Repo,\n\tfilePath: string,\n\tref: string,\n\thooks?: OpsHooks,\n): Promise<Uint8Array> {\n\t// A blob page needs a commit, one or more tree objects, and the blob. On a\n\t// multi-pack object store, letting isomorphic-git discover those packs one\n\t// at a time turns that otherwise short read into a serial network walk.\n\t// Warm every pack before resolving the ref so every later object lookup can\n\t// use the local parse cache. This is the same structural optimization used\n\t// for tree and history reads, now applied to file reads as well.\n\tif (hooks?.prefetch) {\n\t\tawait runStep(hooks, \"prefetch\", hooks.prefetch);\n\t}\n\tconst { commit } = await resolveCommit(repo, ref);\n\tconst context = `${repo.gitdir}@${ref}:${filePath}`;\n\tconst entry = await wrapMissingObject(\n\t\tfindTreeEntry(repo, commit.tree, filePath),\n\t\tcontext,\n\t);\n\n\tif (entry?.type !== \"blob\") {\n\t\tthrow new GitPathNotFoundError(`File not found: ${filePath}`);\n\t}\n\n\tconst { blob } = await wrapMissingObject(\n\t\tgit.readBlob({ ...repo, oid: entry.oid }),\n\t\tcontext,\n\t);\n\treturn blob;\n}\n\n/** Read one commit by sha. */\nexport async function getCommit(repo: Repo, sha: string): Promise<CommitInfo> {\n\tconst result = await wrapMissingObject(\n\t\tgit.readCommit({ ...repo, oid: sha }),\n\t\t`${repo.gitdir} commit ${sha}`,\n\t);\n\treturn { oid: result.oid, commit: result.commit, payload: result.payload };\n}\n\nfunction isFullyWalked(commits: CommitInfo[]): boolean {\n\tconst last = commits[commits.length - 1];\n\treturn !!last && last.commit.parent.length === 0;\n}\n\nexport interface CommitLogOptions {\n\tref: string;\n\tdepth?: number;\n\t/**\n\t * Pass the head sha when the caller already resolved `ref` — resolveRef\n\t * tries several candidate paths in sequence and misses the first few every\n\t * time for a normal branch name, which is pure waste when the sha is known.\n\t */\n\tknownHeadSha?: string;\n}\n\n/**\n * The commit chain from a ref, newest first. Walking is inherently sequential\n * (each commit's oid is only discoverable by reading its child first) and\n * network-round-trip-bound against object storage, so the deepest walk seen\n * per head is memoized in `hooks.resultCache` and sliced for shallower or\n * repeated requests — don't bypass this by calling `git.log` directly.\n */\nexport async function getCommitLog(\n\trepo: Repo,\n\toptions: CommitLogOptions,\n\thooks?: OpsHooks,\n): Promise<CommitInfo[]> {\n\tconst { ref } = options;\n\tconst depth = options.depth ?? 50;\n\n\tlet headSha: string;\n\tif (options.knownHeadSha) {\n\t\theadSha = options.knownHeadSha;\n\t} else {\n\t\ttry {\n\t\t\theadSha = await git.resolveRef({ ...repo, ref: qualifyBranchRef(ref) });\n\t\t} catch (err: unknown) {\n\t\t\tif (isNotFound(err)) return [];\n\t\t\tthrow err;\n\t\t}\n\t}\n\n\tconst cacheKey = `commitlog:${repo.gitdir}:${headSha}`;\n\tconst cached = hooks?.resultCache?.get<CommitInfo[]>(cacheKey);\n\tif (cached && (cached.length >= depth || isFullyWalked(cached))) {\n\t\thooks?.onNote?.(\n\t\t\t`getCommitLog: result-cache HIT for ${cacheKey} (depth=${depth})`,\n\t\t);\n\t\treturn cached.slice(0, depth);\n\t}\n\thooks?.onNote?.(\n\t\t`getCommitLog: result-cache MISS for ${cacheKey} (depth=${depth})`,\n\t);\n\n\tif (hooks?.prefetch && depth >= (hooks.prefetchMinDepth ?? 5)) {\n\t\tawait runStep(hooks, \"prefetch\", hooks.prefetch);\n\t}\n\n\t// headSha is already known-good here (resolveRef above succeeded, or the\n\t// caller passed knownHeadSha) — a NotFoundError from the walk itself means\n\t// a commit/tree/blob it needs is missing from storage, not that the ref\n\t// doesn't exist. Unlike the resolveRef catch above, that's not \"empty\",\n\t// it's storage inconsistency, so wrapMissingObject turns it into a\n\t// GitObjectNotFoundError instead of silently returning [] — an empty\n\t// result here would otherwise get treated as \"this branch has no\n\t// history\" by every caller (and, worse, potentially cached as such).\n\tconst commits = await wrapMissingObject(\n\t\trunStep(hooks, `git.log ${ref} depth=${depth}`, () =>\n\t\t\tgit.log({ ...repo, ref: headSha, depth }),\n\t\t),\n\t\t`${repo.gitdir}@${ref} history`,\n\t);\n\tconst result = commits.map((commit) => ({\n\t\toid: commit.oid,\n\t\tcommit: commit.commit,\n\t\tpayload: commit.payload || \"\",\n\t}));\n\tif (!cached || result.length > cached.length) {\n\t\thooks?.resultCache?.set(cacheKey, result);\n\t}\n\treturn result;\n}\n\n/** A file at a ref, decoded for display: utf8 text or base64 when binary. */\nexport async function getFileFromRef(\n\trepo: Repo,\n\tfilePath: string,\n\tref: string,\n\thooks?: OpsHooks,\n): Promise<{ content: string; size: number; isBinary: boolean }> {\n\tconst bytes = await getFileContent(repo, filePath, ref, hooks);\n\tconst isBinary = hasNullByte(bytes);\n\n\treturn {\n\t\tcontent: isBinary ? toBase64(bytes) : decodeUtf8(bytes),\n\t\tsize: bytes.length,\n\t\tisBinary,\n\t};\n}\n\n/**\n * List a directory at the tip of a ref. Throws GitRefNotFoundError when the\n * ref doesn't resolve (including an empty repo's unborn branch) and\n * GitPathNotFoundError when `treePath` doesn't exist. Results are memoized per\n * head sha (auto-invalidates on push).\n */\nexport async function getTreeFromRef(\n\trepo: Repo,\n\toptions: { ref: string; treePath?: string },\n\thooks?: OpsHooks,\n): Promise<TreeEntry[]> {\n\tconst { ref } = options;\n\tconst treePath = options.treePath ?? \"\";\n\tconst { commit, oid: headSha } = await resolveCommit(repo, ref);\n\n\tconst cacheKey = `tree:${repo.gitdir}:${headSha}:${treePath}`;\n\tconst cached = hooks?.resultCache?.get<TreeEntry[]>(cacheKey);\n\tif (cached) {\n\t\thooks?.onNote?.(`getTreeFromRef: result-cache HIT for ${cacheKey}`);\n\t\treturn cached;\n\t}\n\thooks?.onNote?.(`getTreeFromRef: result-cache MISS for ${cacheKey}`);\n\n\t// Unlike getCommitLog, a tree read has no \"depth\" to gate on — it always\n\t// needs at least the head commit's tree object, and (for a non-root path)\n\t// one object per path segment on top of that, so there's no shallow case\n\t// where prefetching every pack is wasted bandwidth the way a depth=1\n\t// commit-log walk can be. Without this, a cache-miss tree read falls\n\t// through to isomorphic-git's own pack resolution, which probes indexed\n\t// packs one at a time instead of warming them all in parallel up front —\n\t// this was previously the slowest of a tree page's parallel queries in\n\t// production for exactly that reason.\n\tif (hooks?.prefetch) {\n\t\tawait runStep(hooks, \"prefetch\", hooks.prefetch);\n\t}\n\n\tconst context = `${repo.gitdir}@${ref}:${treePath || \"/\"}`;\n\tlet result: TreeEntry[];\n\tif (!treePath) {\n\t\tresult = await wrapMissingObject(\n\t\t\trunStep(hooks, \"listTreeEntries (root)\", () =>\n\t\t\t\tlistTreeEntries(repo, commit.tree),\n\t\t\t),\n\t\t\tcontext,\n\t\t);\n\t} else {\n\t\tconst entry = await wrapMissingObject(\n\t\t\trunStep(hooks, `findTreeEntry ${treePath}`, () =>\n\t\t\t\tfindTreeEntry(repo, commit.tree, treePath),\n\t\t\t),\n\t\t\tcontext,\n\t\t);\n\t\tif (!entry) {\n\t\t\tthrow new GitPathNotFoundError(\n\t\t\t\t`Path \"${treePath}\" does not exist at ${ref}`,\n\t\t\t);\n\t\t}\n\t\tresult =\n\t\t\tentry.type !== \"tree\"\n\t\t\t\t? []\n\t\t\t\t: await wrapMissingObject(\n\t\t\t\t\t\trunStep(hooks, `listTreeEntries ${treePath}`, () =>\n\t\t\t\t\t\t\tlistTreeEntries(repo, entry.oid, entry.path),\n\t\t\t\t\t\t),\n\t\t\t\t\t\tcontext,\n\t\t\t\t\t);\n\t}\n\n\thooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n\n/**\n * A page of commit history from a branch tip. Memoized per head sha; builds\n * on {@link getCommitLog}'s walk cache for the underlying chain.\n */\nexport async function getCommitHistory(\n\trepo: Repo,\n\toptions: { ref: string; limit?: number; skip?: number },\n\thooks?: OpsHooks,\n): Promise<CommitInfo[]> {\n\tconst limit = options.limit ?? 50;\n\tconst skip = options.skip ?? 0;\n\tconst headSha = await git\n\t\t.resolveRef({ ...repo, ref: qualifyBranchRef(options.ref) })\n\t\t.catch(() => null);\n\n\tconst cacheKey = headSha\n\t\t? `commits:${repo.gitdir}:${headSha}:${limit}:${skip}`\n\t\t: null;\n\tif (cacheKey) {\n\t\tconst cached = hooks?.resultCache?.get<CommitInfo[]>(cacheKey);\n\t\tif (cached) {\n\t\t\thooks?.onNote?.(`getCommitHistory: result-cache HIT for ${cacheKey}`);\n\t\t\treturn cached;\n\t\t}\n\t}\n\thooks?.onNote?.(\n\t\t`getCommitHistory: result-cache MISS for ${cacheKey ?? \"(no head)\"}`,\n\t);\n\tif (!headSha) return [];\n\n\tconst all = await getCommitLog(\n\t\trepo,\n\t\t{ ref: options.ref, depth: limit + skip, knownHeadSha: headSha },\n\t\thooks,\n\t);\n\tconst result = all.slice(skip, skip + limit);\n\n\tif (cacheKey) hooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n","import type git from \"isomorphic-git\";\n\n/** The fs shape isomorphic-git accepts, derived from its own signatures. */\nexport type IsoGitFs = Parameters<typeof git.readTree>[0][\"fs\"];\n\n/**\n * A repository handle: everything isomorphic-git needs to address one bare\n * repo. Create it once per request (sharing `cache` across calls is what lets\n * isomorphic-git reuse parsed pack indexes) and pass it to every op.\n */\nexport interface Repo {\n\tfs: IsoGitFs;\n\tgitdir: string;\n\t/** isomorphic-git's shared parse cache — strongly recommended per repo. */\n\tcache?: object;\n}\n\n/**\n * Key/value store for memoizing expensive walk results (commit logs, tree\n * listings, per-file history). Keys are namespaced `kind:gitdir:headSha:…`,\n * so entries self-invalidate on push (new head, new key) — but evict entries\n * under {@link resultKeyPrefixes} after rewriting a repo's storage out of\n * band, or stale walks leak until your store's own eviction.\n */\nexport interface ResultCache {\n\tget<T>(key: string): T | null | undefined;\n\tset(key: string, value: unknown): void;\n}\n\n/** Optional instrumentation and tuning hooks accepted by every op. */\nexport interface OpsHooks {\n\tresultCache?: ResultCache;\n\t/** Wrap a timed sub-step (network walk, tree listing). Default: run directly. */\n\tstep?: <T>(label: string, fn: () => Promise<T>) => Promise<T>;\n\t/** Diagnostic sink for cache hit/miss and walk summaries. */\n\tonNote?: (message: string) => void;\n\t/**\n\t * Wire pack prefetching (e.g. `GitFs.prefetchPacks`) here so a sequential\n\t * walk doesn't pay one network round trip per commit. Called once before\n\t * history walks of depth >= `prefetchMinDepth` (see below), and\n\t * unconditionally on every cache-miss tree read ({@link getTreeFromRef}) —\n\t * a tree read has no shallow case, it always needs at least the head\n\t * commit's tree object.\n\t */\n\tprefetch?: () => Promise<void>;\n\t/** Minimum walk depth before `prefetch` fires for history walks. Default 5. */\n\tprefetchMinDepth?: number;\n}\n\nexport const runStep = <T>(\n\thooks: OpsHooks | undefined,\n\tlabel: string,\n\tfn: () => Promise<T>,\n): Promise<T> => (hooks?.step ? hooks.step(label, fn) : fn());\n\n/**\n * The result-cache key prefixes holding entries for `gitdir` — evict these\n * from your {@link ResultCache} when the repo's storage was rewritten outside\n * a normal push (bulk sync, rename, repack cleanup).\n */\nexport function resultKeyPrefixes(gitdir: string): string[] {\n\treturn [\n\t\t`commitlog:${gitdir}:`,\n\t\t`tree:${gitdir}:`,\n\t\t`commits:${gitdir}:`,\n\t\t`last-commits:${gitdir}:`,\n\t\t`file-history:${gitdir}:`,\n\t];\n}\n","import { type CommitInfo, getCommitLog } from \"./history.js\";\nimport { findTreeEntry } from \"./tree.js\";\nimport type { OpsHooks, Repo } from \"./types.js\";\nimport { runStep } from \"./types.js\";\n\nexport interface FileHistoryEntry {\n\tsha: string;\n\tmessage: string;\n\tauthorName: string;\n\tauthorEmail: string;\n\tcreatedAt: string;\n}\n\nexport interface FileHistoryResult {\n\tentries: FileHistoryEntry[];\n\t/**\n\t * True when the walk hit its depth budget (or the requested `limit`)\n\t * before exhausting the branch's full commit chain — there may be older\n\t * commits touching this file that a deeper walk would surface.\n\t */\n\ttruncated: boolean;\n}\n\n/**\n * Default walk bound for a caller that actually wants deep history (a file's\n * \"History\" tab). Walking the full chain is round-trip-bound on object\n * storage, so cap how far back a single request will look.\n */\nexport const HISTORY_WALK_DEPTH = 400;\n\n/**\n * Much shallower default for a \"latest commit touching this file\" banner that\n * only displays `entries[0]` — trades \"always finds the true last-touching\n * commit\" for \"finds it if it's reasonably recent\", the right call for a\n * banner with a full History view a click away.\n */\nexport const BANNER_WALK_DEPTH = 60;\n\n/** Tree reads are prefetched in parallel windows; see getLastCommitsForTree. */\nconst PREFETCH_WINDOW = 24;\n\nfunction toEntry(commit: CommitInfo): FileHistoryEntry {\n\treturn {\n\t\tsha: commit.oid,\n\t\tmessage: commit.commit.message.trim(),\n\t\tauthorName: commit.commit.author.name,\n\t\tauthorEmail: commit.commit.author.email,\n\t\tcreatedAt: new Date(commit.commit.author.timestamp * 1000).toISOString(),\n\t};\n}\n\n/**\n * All commits (newest first) that changed a single file's blob oid, walking\n * the first-parent chain — same approach as getLastCommitsForTree but for one\n * path and collecting every match instead of stopping at the first.\n */\nexport async function getFileHistory(\n\trepo: Repo,\n\toptions: {\n\t\tref: string;\n\t\tfilePath: string;\n\t\tlimit?: number;\n\t\tmaxDepth?: number;\n\t},\n\thooks?: OpsHooks,\n): Promise<FileHistoryResult> {\n\tconst limit = options.limit ?? 30;\n\tconst maxDepth = options.maxDepth ?? HISTORY_WALK_DEPTH;\n\tconst walkDepth = Math.max(maxDepth, limit);\n\tconst commits = await runStep(hooks, `getCommitLog depth=${walkDepth}`, () =>\n\t\tgetCommitLog(repo, { ref: options.ref, depth: walkDepth }, hooks),\n\t);\n\tconst head = commits[0];\n\tif (!head) return { entries: [], truncated: false };\n\n\tconst cacheKey = `file-history:${repo.gitdir}:${head.oid}:${options.filePath}:${limit}:${maxDepth}`;\n\tconst cached = hooks?.resultCache?.get<FileHistoryResult>(cacheKey);\n\tif (cached) {\n\t\thooks?.onNote?.(\"getFileHistory: result-cache HIT, skipping history walk\");\n\t\treturn cached;\n\t}\n\thooks?.onNote?.(\"getFileHistory: result-cache MISS, walking history\");\n\n\tconst byOid = new Map(commits.map((commit) => [commit.oid, commit]));\n\n\tconst oidByCommitTree = new Map<string, string | null>();\n\tasync function resolveOid(commitTreeOid: string): Promise<string | null> {\n\t\tconst cachedOid = oidByCommitTree.get(commitTreeOid);\n\t\tif (cachedOid !== undefined) return cachedOid;\n\t\tconst entry = await findTreeEntry(repo, commitTreeOid, options.filePath);\n\t\tconst oid = entry?.type === \"blob\" ? entry.oid : null;\n\t\toidByCommitTree.set(commitTreeOid, oid);\n\t\treturn oid;\n\t}\n\n\tconst entries: FileHistoryEntry[] = [];\n\tlet truncated = false;\n\n\touter: for (\n\t\tlet windowStart = 0;\n\t\twindowStart < commits.length;\n\t\twindowStart += PREFETCH_WINDOW\n\t) {\n\t\tconst windowEnd = Math.min(windowStart + PREFETCH_WINDOW, commits.length);\n\t\t// +1 lookahead so the last entry's parent tree is already warm too.\n\t\tconst prefetchEnd = Math.min(windowEnd + 1, commits.length);\n\n\t\tawait Promise.all(\n\t\t\tcommits\n\t\t\t\t.slice(windowStart, prefetchEnd)\n\t\t\t\t.map((commit) => resolveOid(commit.commit.tree)),\n\t\t);\n\n\t\tfor (let i = windowStart; i < windowEnd; i++) {\n\t\t\tconst commit = commits[i];\n\t\t\tif (!commit) break outer;\n\n\t\t\tconst parentSha = commit.commit.parent[0];\n\t\t\tconst parentCommit = parentSha ? byOid.get(parentSha) : undefined;\n\t\t\tif (parentSha && !parentCommit) {\n\t\t\t\t// Walked past the depth cap without reaching this commit's parent —\n\t\t\t\t// can't tell whether it changed the file; stop and report truncated.\n\t\t\t\ttruncated = true;\n\t\t\t\tbreak outer;\n\t\t\t}\n\n\t\t\tconst [oid, parentOid] = await Promise.all([\n\t\t\t\tresolveOid(commit.commit.tree),\n\t\t\t\tparentCommit\n\t\t\t\t\t? resolveOid(parentCommit.commit.tree)\n\t\t\t\t\t: Promise.resolve(null),\n\t\t\t]);\n\n\t\t\tif (oid !== parentOid) {\n\t\t\t\tentries.push(toEntry(commit));\n\t\t\t\tif (entries.length >= limit) {\n\t\t\t\t\ttruncated = i < commits.length - 1;\n\t\t\t\t\tbreak outer;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tconst result = { entries, truncated };\n\thooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n","import { type CommitInfo, getCommitLog } from \"./history.js\";\nimport { findTreeEntry, listTreeEntries } from \"./tree.js\";\nimport type { OpsHooks, Repo } from \"./types.js\";\nimport { runStep } from \"./types.js\";\n\nexport interface LastCommitInfo {\n\tsha: string;\n\tmessage: string;\n\tauthorName: string;\n\tauthorEmail: string;\n\tcreatedAt: string;\n}\n\n/**\n * Bounds how far back the history walk looks to resolve \"last commit touching\n * this path\" for a directory listing. Entries whose last change is older\n * simply show no last-commit info rather than paying an unbounded scan.\n */\nconst HISTORY_WALK_DEPTH = 400;\n\n/**\n * The walk itself is inherently sequential (each step needs to know what's\n * still \"remaining\" from the step before), but the tree-object reads that\n * back it are not — each commit's tree oid is already known upfront from the\n * commit log. Prefetching a window of tree reads in parallel turns ~1 network\n * round trip per commit (serialized) into ~1 round trip per window, which is\n * where nearly all of this function's wall-clock time goes on object storage.\n */\nconst PREFETCH_WINDOW = 24;\n\nfunction toLastCommitInfo(commit: CommitInfo): LastCommitInfo {\n\treturn {\n\t\tsha: commit.oid,\n\t\tmessage: commit.commit.message.trim(),\n\t\tauthorName: commit.commit.author.name,\n\t\tauthorEmail: commit.commit.author.email,\n\t\tcreatedAt: new Date(commit.commit.author.timestamp * 1000).toISOString(),\n\t};\n}\n\n/**\n * For each direct child of `treePath` (at the tip of `ref`), find the most\n * recent commit that changed it — the tree view's \"last commit\" column. Walks\n * history newest-to-oldest, comparing the directory's tree oid\n * commit-to-commit and only descending one level to diff child oids when\n * something under the directory actually changed. Preserve the two-phase\n * structure (parallel prefetch, then sequential resolve) when touching this —\n * the \"which entries are still unresolved\" state must advance\n * commit-by-commit.\n */\nexport async function getLastCommitsForTree(\n\trepo: Repo,\n\toptions: { ref: string; treePath?: string; depth?: number },\n\thooks?: OpsHooks,\n): Promise<Record<string, LastCommitInfo>> {\n\tconst treePath = options.treePath ?? \"\";\n\tconst depth = options.depth ?? HISTORY_WALK_DEPTH;\n\tconst commits = await runStep(hooks, `getCommitLog depth=${depth}`, () =>\n\t\tgetCommitLog(repo, { ref: options.ref, depth }, hooks),\n\t);\n\thooks?.onNote?.(`getLastCommitsForTree: ${commits.length} commits in log`);\n\tconst head = commits[0];\n\tif (!head) return {};\n\n\tconst cacheKey = `last-commits:${repo.gitdir}:${head.oid}:${treePath}`;\n\tconst cachedResult =\n\t\thooks?.resultCache?.get<Record<string, LastCommitInfo>>(cacheKey);\n\tif (cachedResult) {\n\t\thooks?.onNote?.(\n\t\t\t\"getLastCommitsForTree: result-cache HIT, skipping history walk\",\n\t\t);\n\t\treturn cachedResult;\n\t}\n\thooks?.onNote?.(\"getLastCommitsForTree: result-cache MISS, walking history\");\n\n\tconst byOid = new Map(commits.map((commit) => [commit.oid, commit]));\n\n\t// In a linear history, the \"parent tree\" resolved at commit[i] is the same\n\t// tree already resolved as the \"current tree\" at commit[i-1] — memoize by\n\t// commit-tree oid (and by resolved dir oid) so each distinct tree is only\n\t// walked/listed once across the whole scan instead of twice per commit.\n\tconst dirOidByCommitTree = new Map<string, string | null>();\n\tconst childrenByDirOid = new Map<\n\t\tstring,\n\t\tAwaited<ReturnType<typeof listTreeEntries>>\n\t>();\n\n\tasync function resolveDirOid(commitTreeOid: string): Promise<string | null> {\n\t\tconst cached = dirOidByCommitTree.get(commitTreeOid);\n\t\tif (cached !== undefined) return cached;\n\t\tconst entry = await findTreeEntry(repo, commitTreeOid, treePath);\n\t\tconst dirOid = entry?.type === \"tree\" ? entry.oid : null;\n\t\tdirOidByCommitTree.set(commitTreeOid, dirOid);\n\t\treturn dirOid;\n\t}\n\n\tasync function resolveChildren(dirOid: string | null) {\n\t\tif (dirOid === null) return [];\n\t\tconst cached = childrenByDirOid.get(dirOid);\n\t\tif (cached) return cached;\n\t\tconst children = await listTreeEntries(repo, dirOid, treePath);\n\t\tchildrenByDirOid.set(dirOid, children);\n\t\treturn children;\n\t}\n\n\tconst headDirOid = await resolveDirOid(head.commit.tree);\n\tif (headDirOid === null) return {};\n\n\t// listTreeEntries is prefixed with treePath so result keys match the full\n\t// paths that callers key their file listing by.\n\tconst headChildren = await resolveChildren(headDirOid);\n\tconst remaining = new Set(headChildren.map((entry) => entry.path));\n\tconst result: Record<string, LastCommitInfo> = {};\n\n\tlet commitsWalked = 0;\n\tlet prefetchWindows = 0;\n\tconst walkStart = performance.now();\n\n\touter: for (\n\t\tlet windowStart = 0;\n\t\twindowStart < commits.length && remaining.size > 0;\n\t\twindowStart += PREFETCH_WINDOW\n\t) {\n\t\tconst windowEnd = Math.min(windowStart + PREFETCH_WINDOW, commits.length);\n\t\t// +1 lookahead commit so the last entry's parent tree is already warm too.\n\t\tconst prefetchEnd = Math.min(windowEnd + 1, commits.length);\n\t\tprefetchWindows++;\n\n\t\t// Phase A: resolve this window's directory oid for every commit's tree in\n\t\t// parallel (a no-op await when treePath is \"\" — the root tree oid IS the\n\t\t// commit tree, no lookup needed).\n\t\tconst dirOids = await Promise.all(\n\t\t\tcommits\n\t\t\t\t.slice(windowStart, prefetchEnd)\n\t\t\t\t.map((commit) => resolveDirOid(commit.commit.tree)),\n\t\t);\n\n\t\t// Phase B: resolve children for every distinct directory oid the window\n\t\t// touched, in parallel — the actual tree-object read for the common case.\n\t\tawait Promise.all(\n\t\t\t[...new Set(dirOids)].map((dirOid) => resolveChildren(dirOid)),\n\t\t);\n\n\t\tfor (let i = windowStart; i < windowEnd; i++) {\n\t\t\tif (remaining.size === 0) break outer;\n\t\t\tconst commit = commits[i];\n\t\t\tif (!commit) break outer;\n\t\t\tcommitsWalked++;\n\n\t\t\tconst parentSha = commit.commit.parent[0];\n\t\t\tconst parentCommit = parentSha ? byOid.get(parentSha) : undefined;\n\t\t\tif (parentSha && !parentCommit) break outer; // walked past the depth cap\n\n\t\t\t// Already resolved above (or memoized from an earlier window/commit) —\n\t\t\t// these awaits resolve immediately from cache.\n\t\t\tconst [dirOid, parentDirOid] = await Promise.all([\n\t\t\t\tresolveDirOid(commit.commit.tree),\n\t\t\t\tparentCommit\n\t\t\t\t\t? resolveDirOid(parentCommit.commit.tree)\n\t\t\t\t\t: Promise.resolve(null),\n\t\t\t]);\n\n\t\t\tif (dirOid === parentDirOid) continue;\n\n\t\t\tconst [children, parentChildren] = await Promise.all([\n\t\t\t\tresolveChildren(dirOid),\n\t\t\t\tresolveChildren(parentDirOid),\n\t\t\t]);\n\t\t\tconst childByName = new Map(\n\t\t\t\tchildren.map((entry) => [entry.path, entry.oid]),\n\t\t\t);\n\t\t\tconst parentChildByName = new Map(\n\t\t\t\tparentChildren.map((entry) => [entry.path, entry.oid]),\n\t\t\t);\n\n\t\t\tfor (const name of remaining) {\n\t\t\t\tif (childByName.get(name) !== parentChildByName.get(name)) {\n\t\t\t\t\tresult[name] = toLastCommitInfo(commit);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const name of Object.keys(result)) {\n\t\t\t\tremaining.delete(name);\n\t\t\t}\n\t\t}\n\t}\n\n\thooks?.onNote?.(\n\t\t`getLastCommitsForTree: walked ${commitsWalked}/${commits.length} commits across ${prefetchWindows} prefetch windows in ${(performance.now() - walkStart).toFixed(1)}ms, ${dirOidByCommitTree.size} unique tree lookups, ${remaining.size} entries never resolved`,\n\t);\n\n\thooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n","import git from \"isomorphic-git\";\nimport { qualifyBranchRef } from \"../refs.js\";\nimport { assertSafeBranchName } from \"./branch.js\";\nimport type { Repo } from \"./types.js\";\n\nexport interface MergeAnalysis {\n\tcanMerge: boolean;\n\thasConflicts: boolean;\n\tconflictingFiles: string[];\n\tfastForward: boolean;\n}\n\n/**\n * Cheap pre-merge check: do both branches exist, and is this a fast-forward?\n * `canMerge`/`fastForward` are the only fields this actually determines —\n * `hasConflicts`/`conflictingFiles` are NOT a real content-conflict check\n * (isomorphic-git's `git.merge` doesn't expose a dry-run), they only ever\n * reflect \"one of the branches couldn't be resolved\" (`canMerge: false`).\n * Real merge conflicts are only discoverable by actually attempting the\n * merge.\n */\nexport async function analyzeMerge(\n\trepo: Repo,\n\tsourceBranch: string,\n\ttargetBranch: string,\n): Promise<MergeAnalysis> {\n\tassertSafeBranchName(sourceBranch);\n\tassertSafeBranchName(targetBranch);\n\n\ttry {\n\t\tconst [sourceOid, targetOid] = await Promise.all([\n\t\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(sourceBranch) }),\n\t\t\tgit.resolveRef({ ...repo, ref: qualifyBranchRef(targetBranch) }),\n\t\t]);\n\n\t\tconst isDescendant = await git.isDescendent({\n\t\t\t...repo,\n\t\t\toid: sourceOid,\n\t\t\tancestor: targetOid,\n\t\t});\n\n\t\treturn {\n\t\t\tcanMerge: true,\n\t\t\thasConflicts: false,\n\t\t\tconflictingFiles: [],\n\t\t\tfastForward: isDescendant,\n\t\t};\n\t} catch (err) {\n\t\tif ((err as { code?: string })?.code !== \"NotFoundError\") {\n\t\t\tthrow err;\n\t\t}\n\t\t// A branch ref failed to resolve — not a content conflict, just \"can't\n\t\t// merge because one side doesn't exist.\" hasConflicts here is a\n\t\t// misnomer kept for MergeAnalysis's existing shape; canMerge is the\n\t\t// field that actually matters to callers.\n\t\treturn {\n\t\t\tcanMerge: false,\n\t\t\thasConflicts: true,\n\t\t\tconflictingFiles: [],\n\t\t\tfastForward: false,\n\t\t};\n\t}\n}\n\n/**\n * Attempt a fast-forward merge directly against the bare repo: when source is\n * a descendant of target, just move the target ref — no worktree, no new\n * commit. Returns null when the merge is not a fast-forward (callers fall\n * back to a real three-way merge, which needs a worktree). Serialize with a\n * per-repo lock: resolve → writeRef is not atomic.\n */\nexport async function fastForwardMerge(\n\trepo: Repo,\n\tsourceBranch: string,\n\ttargetBranch: string,\n): Promise<{ success: true; commitSha: string } | null> {\n\tassertSafeBranchName(sourceBranch);\n\tassertSafeBranchName(targetBranch);\n\tconst [sourceOid, targetOid] = await Promise.all([\n\t\tgit.resolveRef({ ...repo, ref: `refs/heads/${sourceBranch}` }),\n\t\tgit.resolveRef({ ...repo, ref: `refs/heads/${targetBranch}` }),\n\t]);\n\tconst isFF = await git.isDescendent({\n\t\t...repo,\n\t\toid: sourceOid,\n\t\tancestor: targetOid,\n\t});\n\tif (!isFF) return null;\n\tawait git.writeRef({\n\t\t...repo,\n\t\tref: `refs/heads/${targetBranch}`,\n\t\tvalue: sourceOid,\n\t\tforce: true,\n\t});\n\treturn { success: true, commitSha: sourceOid };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,OAAOA,UAAS;;;ACAhB,OAAO,SAAS;AAWhB,IAAM,WAAW,CAAC,QAAgB,SACjC,SAAS,GAAG,OAAO,QAAQ,QAAQ,EAAE,CAAC,IAAI,IAAI,KAAK;AAMpD,eAAsB,WACrB,MACA,SACA,SACkB;AAClB,QAAM,WAAW,WACb,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG,OAChD,CAAC;AACJ,QAAM,SAAS,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACvD,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,SAAS,oBAAI,IAAiC;AACpD,aAAW,CAAC,UAAU,OAAO,KAAK,SAAS;AAC1C,UAAM,QAAQ,SAAS,QAAQ,GAAG;AAClC,QAAI,UAAU,IAAI;AACjB,aAAO,IAAI,UAAU,OAAO;AAAA,IAC7B,OAAO;AACN,YAAM,MAAM,SAAS,MAAM,GAAG,KAAK;AACnC,YAAM,OAAO,SAAS,MAAM,QAAQ,CAAC;AACrC,UAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,oBAAI,IAAI,CAAC;AAC/C,aAAO,IAAI,GAAG,GAAG,IAAI,MAAM,OAAO;AAAA,IACnC;AAAA,EACD;AACA,aAAW,CAAC,MAAM,OAAO,KAAK,QAAQ;AACrC,WAAO,IAAI,MAAM;AAAA,MAChB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,KAAK;AAAA,MACL,MAAM;AAAA,IACP,CAAC;AAAA,EACF;AAGA,QAAM,gBAAgB,MAAM,QAAQ;AAAA,IACnC,MAAM,KAAK,QAAQ,OAAO,CAAC,KAAK,UAAU,MAAM;AAC/C,YAAM,QAAQ,OAAO,IAAI,GAAG;AAC5B,YAAM,aAAa,OAAO,SAAS,SAAS,MAAM,MAAM;AACxD,YAAM,SAAS,MAAM,WAAW,MAAM,YAAY,UAAU;AAC5D,aAAO,CAAC,KAAK,MAAM;AAAA,IACpB,CAAC;AAAA,EACF;AACA,aAAW,CAAC,KAAK,MAAM,KAAK,eAAe;AAC1C,WAAO,IAAI,KAAK,EAAE,MAAM,UAAU,MAAM,KAAK,KAAK,QAAQ,MAAM,OAAO,CAAC;AAAA,EACzE;AACA,SAAO,IAAI,UAAU,EAAE,GAAG,MAAM,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC,EAAE,CAAC;AACpE;AAGA,eAAsB,eACrB,MACA,SACA,UACkB;AAClB,QAAM,YAAY,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG;AACjE,QAAM,SAAS,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACvD,QAAM,QAAQ,SAAS,QAAQ,GAAG;AAClC,MAAI,UAAU,IAAI;AACjB,WAAO,OAAO,QAAQ;AAAA,EACvB,OAAO;AACN,UAAM,MAAM,SAAS,MAAM,GAAG,KAAK;AACnC,UAAM,OAAO,SAAS,MAAM,QAAQ,CAAC;AACrC,UAAM,QAAQ,OAAO,IAAI,GAAG;AAC5B,QAAI,OAAO,SAAS,QAAQ;AAC3B,YAAM,SAAS,MAAM,eAAe,MAAM,MAAM,KAAK,IAAI;AACzD,aAAO,IAAI,KAAK,EAAE,GAAG,OAAO,KAAK,OAAO,CAAC;AAAA,IAC1C;AAAA,EACD;AACA,SAAO,IAAI,UAAU,EAAE,GAAG,MAAM,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC,EAAE,CAAC;AACpE;AAGA,eAAsB,cACrB,MACA,aACA,UAC4B;AAC5B,MAAI,CAAC,UAAU;AACd,WAAO,EAAE,MAAM,IAAI,MAAM,UAAU,MAAM,QAAQ,KAAK,YAAY;AAAA,EACnE;AAEA,QAAM,QAAQ,SAAS,MAAM,GAAG,EAAE,OAAO,OAAO;AAChD,MAAI,iBAAiB;AACrB,MAAI,cAAc;AAElB,aAAW,CAAC,OAAO,IAAI,KAAK,MAAM,QAAQ,GAAG;AAC5C,UAAM,OAAO,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,eAAe,CAAC;AAChE,UAAM,QAAQ,KAAK,KAAK,KAAK,CAAC,cAAc,UAAU,SAAS,IAAI;AAEnE,QAAI,CAAC,MAAO,QAAO;AAEnB,kBAAc,cAAc,SAAS,aAAa,MAAM,IAAI,IAAI,MAAM;AAEtE,QAAI,UAAU,MAAM,SAAS,GAAG;AAC/B,aAAO;AAAA,QACN,MAAM;AAAA,QACN,MAAM,MAAM;AAAA,QACZ,MAAM,MAAM;AAAA,QACZ,KAAK,MAAM;AAAA,MACZ;AAAA,IACD;AAEA,QAAI,MAAM,SAAS,OAAQ,QAAO;AAElC,qBAAiB,MAAM;AAAA,EACxB;AAEA,SAAO;AACR;AAGA,eAAsB,gBACrB,MACA,SACA,SAAS,IACc;AACvB,QAAM,OAAO,MAAM,IAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC;AAEzD,SAAO,KAAK,KAAK,IAAI,CAAC,WAAW;AAAA,IAChC,MAAM,SAAS,SAAS,QAAQ,MAAM,IAAI,IAAI,MAAM;AAAA,IACpD,MAAM,MAAM;AAAA,IACZ,MAAM,MAAM;AAAA,IACZ,KAAK,MAAM;AAAA,EACZ,EAAE;AACH;;;AD/HO,SAAS,UAAU,MAAc,OAA6B;AACpE,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,WAAW,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AAAA,IACvC,gBAAgB;AAAA,EACjB;AACD;AAWA,eAAsB,kBACrB,MACA,SAMkB;AAClB,uBAAqB,QAAQ,MAAM;AACnC,MAAI;AACJ,MAAI;AACJ,MAAI;AACH,gBAAY,MAAMC,KAAI,WAAW;AAAA,MAChC,GAAG;AAAA,MACH,KAAK,cAAc,QAAQ,MAAM;AAAA,IAClC,CAAC;AACD,UAAM,EAAE,OAAO,IAAI,MAAMA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,UAAU,CAAC;AACnE,oBAAgB,OAAO;AAAA,EACxB,SAAS,KAAK;AACb,QAAK,KAA2B,SAAS,iBAAiB;AACzD,YAAM;AAAA,IACP;AAAA,EAED;AACA,QAAM,UAAU,MAAM,QAAQ,UAAU,aAAa;AACrD,QAAM,YAAY,MAAMA,KAAI,YAAY;AAAA,IACvC,GAAG;AAAA,IACH,QAAQ;AAAA,MACP,SAAS,QAAQ;AAAA,MACjB,MAAM;AAAA,MACN,QAAQ,YAAY,CAAC,SAAS,IAAI,CAAC;AAAA,MACnC,QAAQ,QAAQ;AAAA,MAChB,WAAW,QAAQ;AAAA,IACpB;AAAA,EACD,CAAC;AACD,QAAMA,KAAI,SAAS;AAAA,IAClB,GAAG;AAAA,IACH,KAAK,cAAc,QAAQ,MAAM;AAAA,IACjC,OAAO;AAAA,IACP,OAAO;AAAA,EACR,CAAC;AACD,SAAO;AACR;AAOO,SAAS,kBACf,MACA,SAMkB;AAClB,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,kBAAkB;AACnC,YAAM,QAAQ,oBAAI,IAAoB;AACtC,YAAM,QAAQ;AAAA,QACb,QAAQ,MAAM,IAAI,OAAO,SAAS;AACjC,gBAAM,UACL,OAAO,KAAK,YAAY,WACrB,IAAI,YAAY,EAAE,OAAO,KAAK,OAAO,IACrC,KAAK;AACT,gBAAM,MAAM,MAAMA,KAAI,UAAU,EAAE,GAAG,MAAM,MAAM,QAAQ,CAAC;AAC1D,gBAAM,IAAI,KAAK,MAAM,GAAG;AAAA,QACzB,CAAC;AAAA,MACF;AACA,aAAO,WAAW,MAAM,eAAe,KAAK;AAAA,IAC7C;AAAA,EACD,CAAC;AACF;AAGO,SAAS,mBACf,MACA,SAMkB;AAClB,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,kBAAkB;AACnC,UAAI,CAAC,eAAe;AACnB,cAAM,IAAI,MAAM,UAAU,QAAQ,MAAM,WAAW;AAAA,MACpD;AACA,aAAO,eAAe,MAAM,eAAe,QAAQ,QAAQ;AAAA,IAC5D;AAAA,EACD,CAAC;AACF;;;AEpIA,SAAS,2BAA2B;AACpC,OAAOC,UAAS;;;ACDhB,OAAOC,UAAS;;;ACiDT,IAAM,UAAU,CACtB,OACA,OACA,OACiB,OAAO,OAAO,MAAM,KAAK,OAAO,EAAE,IAAI,GAAG;AAOpD,SAAS,kBAAkB,QAA0B;AAC3D,SAAO;AAAA,IACN,aAAa,MAAM;AAAA,IACnB,QAAQ,MAAM;AAAA,IACd,WAAW,MAAM;AAAA,IACjB,gBAAgB,MAAM;AAAA,IACtB,gBAAgB,MAAM;AAAA,EACvB;AACD;;;ADjDA,SAAS,kBACR,SACA,SACa;AACb,SAAO,QAAQ,MAAM,CAAC,QAAiB;AACtC,QAAK,KAA2B,SAAS,iBAAiB;AACzD,YAAM,IAAI;AAAA,QACT,gBAAgB,OAAO;AAAA,MACxB;AAAA,IACD;AACA,UAAM;AAAA,EACP,CAAC;AACF;AAEA,IAAM,aAAa,CAAC,QAClB,KAA2B,SAAS;AAkCtC,eAAsB,cAAc,MAAY,KAAa;AAC5D,QAAM,MAAM,MAAMC,KAChB,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,GAAG,EAAE,CAAC,EAClD,MAAM,CAAC,QAAiB;AACxB,QAAI,WAAW,GAAG,GAAG;AACpB,YAAM,IAAI,oBAAoB,OAAO,GAAG,iBAAiB;AAAA,IAC1D;AACA,UAAM;AAAA,EACP,CAAC;AACF,QAAM,SAAS,MAAM;AAAA,IACpBA,KAAI,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC;AAAA,IAC/B,GAAG,KAAK,MAAM,WAAW,GAAG;AAAA,EAC7B;AACA,SAAO,EAAE,KAAK,QAAQ,OAAO,OAAO;AACrC;AAGA,eAAsB,QAAQ,MAAY,KAAkC;AAC3E,QAAM,EAAE,KAAK,IAAI,MAAM;AAAA,IACtBA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,IAAI,CAAC;AAAA,IAClC,GAAG,KAAK,MAAM,SAAS,GAAG;AAAA,EAC3B;AACA,SAAO;AACR;AAGA,eAAsB,eACrB,MACA,UACA,KACA,OACsB;AAOtB,MAAI,OAAO,UAAU;AACpB,UAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAAA,EAChD;AACA,QAAM,EAAE,OAAO,IAAI,MAAM,cAAc,MAAM,GAAG;AAChD,QAAM,UAAU,GAAG,KAAK,MAAM,IAAI,GAAG,IAAI,QAAQ;AACjD,QAAM,QAAQ,MAAM;AAAA,IACnB,cAAc,MAAM,OAAO,MAAM,QAAQ;AAAA,IACzC;AAAA,EACD;AAEA,MAAI,OAAO,SAAS,QAAQ;AAC3B,UAAM,IAAI,qBAAqB,mBAAmB,QAAQ,EAAE;AAAA,EAC7D;AAEA,QAAM,EAAE,KAAK,IAAI,MAAM;AAAA,IACtBA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,MAAM,IAAI,CAAC;AAAA,IACxC;AAAA,EACD;AACA,SAAO;AACR;AAGA,eAAsB,UAAU,MAAY,KAAkC;AAC7E,QAAM,SAAS,MAAM;AAAA,IACpBA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,IAAI,CAAC;AAAA,IACpC,GAAG,KAAK,MAAM,WAAW,GAAG;AAAA,EAC7B;AACA,SAAO,EAAE,KAAK,OAAO,KAAK,QAAQ,OAAO,QAAQ,SAAS,OAAO,QAAQ;AAC1E;AAEA,SAAS,cAAc,SAAgC;AACtD,QAAM,OAAO,QAAQ,QAAQ,SAAS,CAAC;AACvC,SAAO,CAAC,CAAC,QAAQ,KAAK,OAAO,OAAO,WAAW;AAChD;AAoBA,eAAsB,aACrB,MACA,SACA,OACwB;AACxB,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,QAAQ,QAAQ,SAAS;AAE/B,MAAI;AACJ,MAAI,QAAQ,cAAc;AACzB,cAAU,QAAQ;AAAA,EACnB,OAAO;AACN,QAAI;AACH,gBAAU,MAAMA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,GAAG,EAAE,CAAC;AAAA,IACvE,SAAS,KAAc;AACtB,UAAI,WAAW,GAAG,EAAG,QAAO,CAAC;AAC7B,YAAM;AAAA,IACP;AAAA,EACD;AAEA,QAAM,WAAW,aAAa,KAAK,MAAM,IAAI,OAAO;AACpD,QAAM,SAAS,OAAO,aAAa,IAAkB,QAAQ;AAC7D,MAAI,WAAW,OAAO,UAAU,SAAS,cAAc,MAAM,IAAI;AAChE,WAAO;AAAA,MACN,sCAAsC,QAAQ,WAAW,KAAK;AAAA,IAC/D;AACA,WAAO,OAAO,MAAM,GAAG,KAAK;AAAA,EAC7B;AACA,SAAO;AAAA,IACN,uCAAuC,QAAQ,WAAW,KAAK;AAAA,EAChE;AAEA,MAAI,OAAO,YAAY,UAAU,MAAM,oBAAoB,IAAI;AAC9D,UAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAAA,EAChD;AAUA,QAAM,UAAU,MAAM;AAAA,IACrB;AAAA,MAAQ;AAAA,MAAO,WAAW,GAAG,UAAU,KAAK;AAAA,MAAI,MAC/CA,KAAI,IAAI,EAAE,GAAG,MAAM,KAAK,SAAS,MAAM,CAAC;AAAA,IACzC;AAAA,IACA,GAAG,KAAK,MAAM,IAAI,GAAG;AAAA,EACtB;AACA,QAAM,SAAS,QAAQ,IAAI,CAAC,YAAY;AAAA,IACvC,KAAK,OAAO;AAAA,IACZ,QAAQ,OAAO;AAAA,IACf,SAAS,OAAO,WAAW;AAAA,EAC5B,EAAE;AACF,MAAI,CAAC,UAAU,OAAO,SAAS,OAAO,QAAQ;AAC7C,WAAO,aAAa,IAAI,UAAU,MAAM;AAAA,EACzC;AACA,SAAO;AACR;AAGA,eAAsB,eACrB,MACA,UACA,KACA,OACgE;AAChE,QAAM,QAAQ,MAAM,eAAe,MAAM,UAAU,KAAK,KAAK;AAC7D,QAAM,WAAW,YAAY,KAAK;AAElC,SAAO;AAAA,IACN,SAAS,WAAW,SAAS,KAAK,IAAI,WAAW,KAAK;AAAA,IACtD,MAAM,MAAM;AAAA,IACZ;AAAA,EACD;AACD;AAQA,eAAsB,eACrB,MACA,SACA,OACuB;AACvB,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,EAAE,QAAQ,KAAK,QAAQ,IAAI,MAAM,cAAc,MAAM,GAAG;AAE9D,QAAM,WAAW,QAAQ,KAAK,MAAM,IAAI,OAAO,IAAI,QAAQ;AAC3D,QAAM,SAAS,OAAO,aAAa,IAAiB,QAAQ;AAC5D,MAAI,QAAQ;AACX,WAAO,SAAS,wCAAwC,QAAQ,EAAE;AAClE,WAAO;AAAA,EACR;AACA,SAAO,SAAS,yCAAyC,QAAQ,EAAE;AAWnE,MAAI,OAAO,UAAU;AACpB,UAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAAA,EAChD;AAEA,QAAM,UAAU,GAAG,KAAK,MAAM,IAAI,GAAG,IAAI,YAAY,GAAG;AACxD,MAAI;AACJ,MAAI,CAAC,UAAU;AACd,aAAS,MAAM;AAAA,MACd;AAAA,QAAQ;AAAA,QAAO;AAAA,QAA0B,MACxC,gBAAgB,MAAM,OAAO,IAAI;AAAA,MAClC;AAAA,MACA;AAAA,IACD;AAAA,EACD,OAAO;AACN,UAAM,QAAQ,MAAM;AAAA,MACnB;AAAA,QAAQ;AAAA,QAAO,iBAAiB,QAAQ;AAAA,QAAI,MAC3C,cAAc,MAAM,OAAO,MAAM,QAAQ;AAAA,MAC1C;AAAA,MACA;AAAA,IACD;AACA,QAAI,CAAC,OAAO;AACX,YAAM,IAAI;AAAA,QACT,SAAS,QAAQ,uBAAuB,GAAG;AAAA,MAC5C;AAAA,IACD;AACA,aACC,MAAM,SAAS,SACZ,CAAC,IACD,MAAM;AAAA,MACN;AAAA,QAAQ;AAAA,QAAO,mBAAmB,QAAQ;AAAA,QAAI,MAC7C,gBAAgB,MAAM,MAAM,KAAK,MAAM,IAAI;AAAA,MAC5C;AAAA,MACA;AAAA,IACD;AAAA,EACJ;AAEA,SAAO,aAAa,IAAI,UAAU,MAAM;AACxC,SAAO;AACR;AAMA,eAAsB,iBACrB,MACA,SACA,OACwB;AACxB,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,UAAU,MAAMA,KACpB,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,QAAQ,GAAG,EAAE,CAAC,EAC1D,MAAM,MAAM,IAAI;AAElB,QAAM,WAAW,UACd,WAAW,KAAK,MAAM,IAAI,OAAO,IAAI,KAAK,IAAI,IAAI,KAClD;AACH,MAAI,UAAU;AACb,UAAM,SAAS,OAAO,aAAa,IAAkB,QAAQ;AAC7D,QAAI,QAAQ;AACX,aAAO,SAAS,0CAA0C,QAAQ,EAAE;AACpE,aAAO;AAAA,IACR;AAAA,EACD;AACA,SAAO;AAAA,IACN,2CAA2C,YAAY,WAAW;AAAA,EACnE;AACA,MAAI,CAAC,QAAS,QAAO,CAAC;AAEtB,QAAM,MAAM,MAAM;AAAA,IACjB;AAAA,IACA,EAAE,KAAK,QAAQ,KAAK,OAAO,QAAQ,MAAM,cAAc,QAAQ;AAAA,IAC/D;AAAA,EACD;AACA,QAAM,SAAS,IAAI,MAAM,MAAM,OAAO,KAAK;AAE3C,MAAI,SAAU,QAAO,aAAa,IAAI,UAAU,MAAM;AACtD,SAAO;AACR;;;AD/TA,SAAS,kBAAkB,MAIzB;AACD,SAAO,gBAAgB,IAAI;AAC5B;AAEA,SAAS,kBAAkB,SAAyB;AACnD,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,GAAI,OAAM,IAAI;AAC9C,SAAO,MAAM;AACd;AAEA,SAAS,mBAAmB,QAMjB;AACV,QAAM,UAAU,OAAO,WAAW,KAAK,OAAO,IAAI;AAClD,QAAM,UAAU,OAAO,WAAW,KAAK,OAAO,IAAI;AAClD,QAAM,YAAY;AAAA,IACjB;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA,EAAE,SAAS,EAAE;AAAA,EACd,EAAE,QAAQ,SAAS,EAAE;AAErB,SAAO,gBAAgB,OAAO,IAAI,MAAM,OAAO,IAAI;AAAA,EAAK,SAAS;AAClE;AAEA,SAAS,cAAc,OAA+B;AACrD,SAAO;AAAA,IACN;AAAA,IACA,gBAAgB,MAAM,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC;AAAA,IAC7D,gBAAgB,MAAM,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC;AAAA,IAC7D,YAAY,MAAM;AAAA,EACnB;AACD;AAYA,SAAS,cACR,MACA,QACA,QACA,OACW;AACX,QAAM,WAAW,CAAC,EAAE,QAAQ,YAAY,OAAO;AAC/C,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,WAAW,CAAC,YAAY,QAAQ,kBAAkB,MAAM,IAAI,IAAI;AAAA,IAChE,WAAW,CAAC,YAAY,SAAS,kBAAkB,OAAO,IAAI,IAAI;AAAA,IAClE,OAAO,WACJ,KACA,mBAAmB;AAAA,MACnB;AAAA,MACA,QAAQ,QAAQ,QAAQ;AAAA,MACxB,OAAO,OAAO,QAAQ;AAAA,MACtB,SAAS,SAAS,SAAY;AAAA,MAC9B,SAAS,QAAQ,SAAY;AAAA,IAC9B,CAAC;AAAA,IACH;AAAA,IACA,YAAY,UAAU,WAAW,SAAS,OAAO,KAAK,IAAI;AAAA,IAC1D,YAAY,SAAS,WAAW,SAAS,MAAM,KAAK,IAAI;AAAA,IACxD,SAAS,QAAQ,MAAM;AAAA,IACvB,SAAS,OAAO,MAAM;AAAA,EACvB;AACD;AAOA,eAAe,aACd,MACA,QACA,QACsB;AACtB,QAAM,UAAU,MAAMC,KAAI,KAAK;AAAA,IAC9B,GAAG;AAAA,IACH,OAAO,CAACA,KAAI,KAAK,EAAE,KAAK,OAAO,CAAC,GAAGA,KAAI,KAAK,EAAE,KAAK,OAAO,CAAC,CAAC;AAAA,IAC5D,KAAK,OAAO,UAAU,CAAC,GAAG,CAAC,MAAM;AAChC,YAAM,CAAC,OAAO,KAAK,IAAI,MAAM,QAAQ,IAAI,CAAC,GAAG,KAAK,GAAG,GAAG,KAAK,CAAC,CAAC;AAE/D,UAAI,UAAU,UAAU,UAAU,OAAQ;AAE1C,UAAI,SAAS,CAAC,OAAO;AACpB,cAAMC,QAAO,IAAI,MAAM,EAAE,IAAI,IAAI;AACjC,cAAM,EAAE,KAAK,IAAI,MAAMD,KAAI,SAAS,EAAE,GAAG,MAAM,KAAKC,MAAK,CAAC;AAC1D,cAAM,SAAS,kBAAkB,IAAI;AACrC,eAAO,cAAc,UAAU,WAAW,QAAQ,IAAI;AAAA,MACvD;AAEA,UAAI,CAAC,SAAS,OAAO;AACpB,cAAMC,QAAO,IAAI,MAAM,EAAE,IAAI,IAAI;AACjC,cAAM,EAAE,KAAK,IAAI,MAAMF,KAAI,SAAS,EAAE,GAAG,MAAM,KAAKE,MAAK,CAAC;AAC1D,cAAM,QAAQ,kBAAkB,IAAI;AACpC,eAAO,cAAc,UAAU,SAAS,MAAM,KAAK;AAAA,MACpD;AAEA,YAAM,CAAC,MAAM,IAAI,IAAI,MAAM,QAAQ,IAAI;AAAA,QACtC,IAAI,EAAE,IAAI,IAAI,QAAQ,QAAQ,EAAE;AAAA,QAChC,IAAI,EAAE,IAAI,IAAI,QAAQ,QAAQ,EAAE;AAAA,MACjC,CAAC;AAED,UAAI,SAAS,MAAM;AAClB,cAAM,CAAC,EAAE,MAAM,MAAM,GAAG,EAAE,MAAM,MAAM,CAAC,IAAI,MAAM,QAAQ,IAAI;AAAA,UAC5DF,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC;AAAA,UACnCA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC;AAAA,QACpC,CAAC;AACD,cAAM,SAAS,kBAAkB,KAAK;AACtC,cAAM,QAAQ,kBAAkB,KAAK;AACrC,eAAO,cAAc,UAAU,YAAY,QAAQ,KAAK;AAAA,MACzD;AAEA,aAAO;AAAA,IACR;AAAA,EACD,CAAC;AAED,UAAQ,WAAW,CAAC,GAAG;AAAA,IACtB,CAAC,MACA,MAAM,QAAQ,MAAM;AAAA,EACtB;AACD;AAGA,eAAsB,cACrB,MACA,WACsB;AACtB,MAAI;AACH,UAAM,SAAS,MAAM,UAAU,MAAM,SAAS;AAC9C,UAAM,SAAS,OAAO,OAAO,OAAO,CAAC;AAErC,QAAI,CAAC,QAAQ;AACZ,YAAM,UAA2C,CAAC;AAClD,YAAM,QAA+C;AAAA,QACpD,EAAE,SAAS,OAAO,OAAO,MAAM,QAAQ,GAAG;AAAA,MAC3C;AAEA,aAAO,MAAM,QAAQ;AACpB,cAAM,EAAE,SAAS,OAAO,IAAI,MAAM,IAAI;AAItC,cAAM,EAAE,KAAK,IAAI,MAAMA,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,QAAQ,CAAC;AAC7D,mBAAW,SAAS,MAAM;AACzB,gBAAM,OAAO,SAAS,GAAG,MAAM,IAAI,MAAM,IAAI,KAAK,MAAM;AACxD,cAAI,MAAM,SAAS,QAAQ;AAC1B,kBAAM,KAAK,EAAE,SAAS,MAAM,KAAK,QAAQ,KAAK,CAAC;AAAA,UAChD,WAAW,MAAM,SAAS,QAAQ;AACjC,oBAAQ,KAAK,EAAE,MAAM,MAAM,KAAK,MAAM,IAAI,CAAC;AAAA,UAC5C;AAAA,QACD;AAAA,MACD;AAEA,YAAMG,SAAoB,MAAM,QAAQ;AAAA,QACvC,QAAQ,IAAI,OAAO,EAAE,MAAM,IAAI,MAAM;AACpC,gBAAM,EAAE,KAAK,IAAI,MAAMH,KAAI,SAAS,EAAE,GAAG,MAAM,IAAI,CAAC;AACpD,gBAAM,QAAQ,kBAAkB,IAAI;AACpC,iBAAO,cAAc,MAAM,SAAS,MAAM,KAAK;AAAA,QAChD,CAAC;AAAA,MACF;AAEA,aAAO,cAAcG,MAAK;AAAA,IAC3B;AAEA,UAAM,QAAQ,MAAM,aAAa,MAAM,QAAQ,SAAS;AACxD,WAAO,cAAc,KAAK;AAAA,EAC3B,SAAS,OAAO;AACf,UAAM,IAAI,MAAM,8BAA8B,KAAK,EAAE;AAAA,EACtD;AACD;AAGA,eAAsB,mBACrB,MACA,SACA,YACsB;AACtB,QAAM,CAAC,SAAS,UAAU,IAAI,MAAM,QAAQ,IAAI;AAAA,IAC/CH,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,OAAO,EAAE,CAAC;AAAA,IAC1DA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,UAAU,EAAE,CAAC;AAAA,EAC9D,CAAC;AAED,QAAM,QAAQ,MAAM,aAAa,MAAM,SAAS,UAAU;AAC1D,SAAO,cAAc,KAAK;AAC3B;;;AG7MO,IAAM,qBAAqB;AAQ3B,IAAM,oBAAoB;AAGjC,IAAM,kBAAkB;AAExB,SAAS,QAAQ,QAAsC;AACtD,SAAO;AAAA,IACN,KAAK,OAAO;AAAA,IACZ,SAAS,OAAO,OAAO,QAAQ,KAAK;AAAA,IACpC,YAAY,OAAO,OAAO,OAAO;AAAA,IACjC,aAAa,OAAO,OAAO,OAAO;AAAA,IAClC,WAAW,IAAI,KAAK,OAAO,OAAO,OAAO,YAAY,GAAI,EAAE,YAAY;AAAA,EACxE;AACD;AAOA,eAAsB,eACrB,MACA,SAMA,OAC6B;AAC7B,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,YAAY,KAAK,IAAI,UAAU,KAAK;AAC1C,QAAM,UAAU,MAAM;AAAA,IAAQ;AAAA,IAAO,sBAAsB,SAAS;AAAA,IAAI,MACvE,aAAa,MAAM,EAAE,KAAK,QAAQ,KAAK,OAAO,UAAU,GAAG,KAAK;AAAA,EACjE;AACA,QAAM,OAAO,QAAQ,CAAC;AACtB,MAAI,CAAC,KAAM,QAAO,EAAE,SAAS,CAAC,GAAG,WAAW,MAAM;AAElD,QAAM,WAAW,gBAAgB,KAAK,MAAM,IAAI,KAAK,GAAG,IAAI,QAAQ,QAAQ,IAAI,KAAK,IAAI,QAAQ;AACjG,QAAM,SAAS,OAAO,aAAa,IAAuB,QAAQ;AAClE,MAAI,QAAQ;AACX,WAAO,SAAS,yDAAyD;AACzE,WAAO;AAAA,EACR;AACA,SAAO,SAAS,oDAAoD;AAEpE,QAAM,QAAQ,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;AAEnE,QAAM,kBAAkB,oBAAI,IAA2B;AACvD,iBAAe,WAAW,eAA+C;AACxE,UAAM,YAAY,gBAAgB,IAAI,aAAa;AACnD,QAAI,cAAc,OAAW,QAAO;AACpC,UAAM,QAAQ,MAAM,cAAc,MAAM,eAAe,QAAQ,QAAQ;AACvE,UAAM,MAAM,OAAO,SAAS,SAAS,MAAM,MAAM;AACjD,oBAAgB,IAAI,eAAe,GAAG;AACtC,WAAO;AAAA,EACR;AAEA,QAAM,UAA8B,CAAC;AACrC,MAAI,YAAY;AAEhB,QAAO,UACF,cAAc,GAClB,cAAc,QAAQ,QACtB,eAAe,iBACd;AACD,UAAM,YAAY,KAAK,IAAI,cAAc,iBAAiB,QAAQ,MAAM;AAExE,UAAM,cAAc,KAAK,IAAI,YAAY,GAAG,QAAQ,MAAM;AAE1D,UAAM,QAAQ;AAAA,MACb,QACE,MAAM,aAAa,WAAW,EAC9B,IAAI,CAAC,WAAW,WAAW,OAAO,OAAO,IAAI,CAAC;AAAA,IACjD;AAEA,aAAS,IAAI,aAAa,IAAI,WAAW,KAAK;AAC7C,YAAM,SAAS,QAAQ,CAAC;AACxB,UAAI,CAAC,OAAQ,OAAM;AAEnB,YAAM,YAAY,OAAO,OAAO,OAAO,CAAC;AACxC,YAAM,eAAe,YAAY,MAAM,IAAI,SAAS,IAAI;AACxD,UAAI,aAAa,CAAC,cAAc;AAG/B,oBAAY;AACZ,cAAM;AAAA,MACP;AAEA,YAAM,CAAC,KAAK,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,QAC1C,WAAW,OAAO,OAAO,IAAI;AAAA,QAC7B,eACG,WAAW,aAAa,OAAO,IAAI,IACnC,QAAQ,QAAQ,IAAI;AAAA,MACxB,CAAC;AAED,UAAI,QAAQ,WAAW;AACtB,gBAAQ,KAAK,QAAQ,MAAM,CAAC;AAC5B,YAAI,QAAQ,UAAU,OAAO;AAC5B,sBAAY,IAAI,QAAQ,SAAS;AACjC,gBAAM;AAAA,QACP;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,QAAM,SAAS,EAAE,SAAS,UAAU;AACpC,SAAO,aAAa,IAAI,UAAU,MAAM;AACxC,SAAO;AACR;;;AChIA,IAAMI,sBAAqB;AAU3B,IAAMC,mBAAkB;AAExB,SAAS,iBAAiB,QAAoC;AAC7D,SAAO;AAAA,IACN,KAAK,OAAO;AAAA,IACZ,SAAS,OAAO,OAAO,QAAQ,KAAK;AAAA,IACpC,YAAY,OAAO,OAAO,OAAO;AAAA,IACjC,aAAa,OAAO,OAAO,OAAO;AAAA,IAClC,WAAW,IAAI,KAAK,OAAO,OAAO,OAAO,YAAY,GAAI,EAAE,YAAY;AAAA,EACxE;AACD;AAYA,eAAsB,sBACrB,MACA,SACA,OAC0C;AAC1C,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,QAAQ,QAAQ,SAASD;AAC/B,QAAM,UAAU,MAAM;AAAA,IAAQ;AAAA,IAAO,sBAAsB,KAAK;AAAA,IAAI,MACnE,aAAa,MAAM,EAAE,KAAK,QAAQ,KAAK,MAAM,GAAG,KAAK;AAAA,EACtD;AACA,SAAO,SAAS,0BAA0B,QAAQ,MAAM,iBAAiB;AACzE,QAAM,OAAO,QAAQ,CAAC;AACtB,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,WAAW,gBAAgB,KAAK,MAAM,IAAI,KAAK,GAAG,IAAI,QAAQ;AACpE,QAAM,eACL,OAAO,aAAa,IAAoC,QAAQ;AACjE,MAAI,cAAc;AACjB,WAAO;AAAA,MACN;AAAA,IACD;AACA,WAAO;AAAA,EACR;AACA,SAAO,SAAS,2DAA2D;AAE3E,QAAM,QAAQ,IAAI,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;AAMnE,QAAM,qBAAqB,oBAAI,IAA2B;AAC1D,QAAM,mBAAmB,oBAAI,IAG3B;AAEF,iBAAe,cAAc,eAA+C;AAC3E,UAAM,SAAS,mBAAmB,IAAI,aAAa;AACnD,QAAI,WAAW,OAAW,QAAO;AACjC,UAAM,QAAQ,MAAM,cAAc,MAAM,eAAe,QAAQ;AAC/D,UAAM,SAAS,OAAO,SAAS,SAAS,MAAM,MAAM;AACpD,uBAAmB,IAAI,eAAe,MAAM;AAC5C,WAAO;AAAA,EACR;AAEA,iBAAe,gBAAgB,QAAuB;AACrD,QAAI,WAAW,KAAM,QAAO,CAAC;AAC7B,UAAM,SAAS,iBAAiB,IAAI,MAAM;AAC1C,QAAI,OAAQ,QAAO;AACnB,UAAM,WAAW,MAAM,gBAAgB,MAAM,QAAQ,QAAQ;AAC7D,qBAAiB,IAAI,QAAQ,QAAQ;AACrC,WAAO;AAAA,EACR;AAEA,QAAM,aAAa,MAAM,cAAc,KAAK,OAAO,IAAI;AACvD,MAAI,eAAe,KAAM,QAAO,CAAC;AAIjC,QAAM,eAAe,MAAM,gBAAgB,UAAU;AACrD,QAAM,YAAY,IAAI,IAAI,aAAa,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC;AACjE,QAAM,SAAyC,CAAC;AAEhD,MAAI,gBAAgB;AACpB,MAAI,kBAAkB;AACtB,QAAM,YAAY,YAAY,IAAI;AAElC,QAAO,UACF,cAAc,GAClB,cAAc,QAAQ,UAAU,UAAU,OAAO,GACjD,eAAeC,kBACd;AACD,UAAM,YAAY,KAAK,IAAI,cAAcA,kBAAiB,QAAQ,MAAM;AAExE,UAAM,cAAc,KAAK,IAAI,YAAY,GAAG,QAAQ,MAAM;AAC1D;AAKA,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC7B,QACE,MAAM,aAAa,WAAW,EAC9B,IAAI,CAAC,WAAW,cAAc,OAAO,OAAO,IAAI,CAAC;AAAA,IACpD;AAIA,UAAM,QAAQ;AAAA,MACb,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,WAAW,gBAAgB,MAAM,CAAC;AAAA,IAC9D;AAEA,aAAS,IAAI,aAAa,IAAI,WAAW,KAAK;AAC7C,UAAI,UAAU,SAAS,EAAG,OAAM;AAChC,YAAM,SAAS,QAAQ,CAAC;AACxB,UAAI,CAAC,OAAQ,OAAM;AACnB;AAEA,YAAM,YAAY,OAAO,OAAO,OAAO,CAAC;AACxC,YAAM,eAAe,YAAY,MAAM,IAAI,SAAS,IAAI;AACxD,UAAI,aAAa,CAAC,aAAc,OAAM;AAItC,YAAM,CAAC,QAAQ,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,QAChD,cAAc,OAAO,OAAO,IAAI;AAAA,QAChC,eACG,cAAc,aAAa,OAAO,IAAI,IACtC,QAAQ,QAAQ,IAAI;AAAA,MACxB,CAAC;AAED,UAAI,WAAW,aAAc;AAE7B,YAAM,CAAC,UAAU,cAAc,IAAI,MAAM,QAAQ,IAAI;AAAA,QACpD,gBAAgB,MAAM;AAAA,QACtB,gBAAgB,YAAY;AAAA,MAC7B,CAAC;AACD,YAAM,cAAc,IAAI;AAAA,QACvB,SAAS,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,GAAG,CAAC;AAAA,MAChD;AACA,YAAM,oBAAoB,IAAI;AAAA,QAC7B,eAAe,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,MAAM,GAAG,CAAC;AAAA,MACtD;AAEA,iBAAW,QAAQ,WAAW;AAC7B,YAAI,YAAY,IAAI,IAAI,MAAM,kBAAkB,IAAI,IAAI,GAAG;AAC1D,iBAAO,IAAI,IAAI,iBAAiB,MAAM;AAAA,QACvC;AAAA,MACD;AACA,iBAAW,QAAQ,OAAO,KAAK,MAAM,GAAG;AACvC,kBAAU,OAAO,IAAI;AAAA,MACtB;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AAAA,IACN,iCAAiC,aAAa,IAAI,QAAQ,MAAM,mBAAmB,eAAe,yBAAyB,YAAY,IAAI,IAAI,WAAW,QAAQ,CAAC,CAAC,OAAO,mBAAmB,IAAI,yBAAyB,UAAU,IAAI;AAAA,EAC1O;AAEA,SAAO,aAAa,IAAI,UAAU,MAAM;AACxC,SAAO;AACR;;;AChMA,OAAOC,UAAS;AAqBhB,eAAsB,aACrB,MACA,cACA,cACyB;AACzB,uBAAqB,YAAY;AACjC,uBAAqB,YAAY;AAEjC,MAAI;AACH,UAAM,CAAC,WAAW,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,MAChDC,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,YAAY,EAAE,CAAC;AAAA,MAC/DA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,YAAY,EAAE,CAAC;AAAA,IAChE,CAAC;AAED,UAAM,eAAe,MAAMA,KAAI,aAAa;AAAA,MAC3C,GAAG;AAAA,MACH,KAAK;AAAA,MACL,UAAU;AAAA,IACX,CAAC;AAED,WAAO;AAAA,MACN,UAAU;AAAA,MACV,cAAc;AAAA,MACd,kBAAkB,CAAC;AAAA,MACnB,aAAa;AAAA,IACd;AAAA,EACD,SAAS,KAAK;AACb,QAAK,KAA2B,SAAS,iBAAiB;AACzD,YAAM;AAAA,IACP;AAKA,WAAO;AAAA,MACN,UAAU;AAAA,MACV,cAAc;AAAA,MACd,kBAAkB,CAAC;AAAA,MACnB,aAAa;AAAA,IACd;AAAA,EACD;AACD;AASA,eAAsB,iBACrB,MACA,cACA,cACuD;AACvD,uBAAqB,YAAY;AACjC,uBAAqB,YAAY;AACjC,QAAM,CAAC,WAAW,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,IAChDA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,cAAc,YAAY,GAAG,CAAC;AAAA,IAC7DA,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,cAAc,YAAY,GAAG,CAAC;AAAA,EAC9D,CAAC;AACD,QAAM,OAAO,MAAMA,KAAI,aAAa;AAAA,IACnC,GAAG;AAAA,IACH,KAAK;AAAA,IACL,UAAU;AAAA,EACX,CAAC;AACD,MAAI,CAAC,KAAM,QAAO;AAClB,QAAMA,KAAI,SAAS;AAAA,IAClB,GAAG;AAAA,IACH,KAAK,cAAc,YAAY;AAAA,IAC/B,OAAO;AAAA,IACP,OAAO;AAAA,EACR,CAAC;AACD,SAAO,EAAE,SAAS,MAAM,WAAW,UAAU;AAC9C;","names":["git","git","git","git","git","git","oidA","oidB","files","HISTORY_WALK_DEPTH","PREFETCH_WINDOW","git","git"]}

package/dist/types/cache.d.ts

@@ -0,0 +1,81 @@
+import type { ObjectStore } from "./types.js";
+export interface CacheOptions {
+    /** Maximum bytes of object data held in memory. Default 50 MiB. */
+    maxBytes?: number;
+    /**
+     * Largest single entry admitted to the cache. Defaults to a tenth of
+     * `maxBytes` so one huge packfile cannot evict the whole working set.
+     */
+    maxEntryBytes?: number;
+    /** Entry time-to-live in milliseconds. Default 60 000. */
+    ttlMs?: number;
+    /**
+     * Override the TTL for a specific key (get/head) or list prefix (list),
+     * in milliseconds. Return `undefined` to fall back to `ttlMs`. Git refs
+     * (`refs/heads/<branch>`, `HEAD`) are mutable — the same key's value
+     * changes on every push — unlike content-addressed object keys, which
+     * never change for a given key and are safe to cache for the full
+     * `ttlMs`. Without this, a long `ttlMs` tuned for objects also caches
+     * ref reads that long, so a warm process can keep serving a
+     * pre-push ref value for the rest of that TTL even though nothing
+     * changed *this* process's own cache (see `invalidate`) — it just never
+     * knew to. Give ref-like keys a short override (a few seconds) instead:
+     * a ref read is one small object, so re-reading it far more often than
+     * `ttlMs` is cheap, and every read downstream of a fresh ref (tree,
+     * commit, blob — all keyed by the sha it resolves to) still gets the
+     * full-length cache/coalescing benefit.
+     */
+    ttlForKey?: (key: string) => number | undefined;
+    /**
+     * Also cache "key does not exist" results. Loose-object probes on packed
+     * repositories are almost always misses, so this saves many round trips —
+     * but only enable it when a single process is the only writer, otherwise
+     * another instance's push can be masked for up to `ttlMs`.
+     */
+    cacheMisses?: boolean;
+    /**
+     * Also cache `list()` results (directory listings and `limit: 1`
+     * existence probes). Writes through this store keep cached listings
+     * consistent; after writing to the backend by any other means, call
+     * `invalidate()` with the affected prefix. Default false.
+     */
+    cacheLists?: boolean;
+    /**
+     * Collapse concurrent `get`/`head`/`list` calls for the same key into a
+     * single backend request. Default true.
+     */
+    coalesce?: boolean;
+    /**
+     * Return defensive copies from `get` (and copy on admit), so a caller
+     * mutating returned bytes can't corrupt the cache. Default true. Set
+     * false when no reader mutates results (isomorphic-git doesn't): every
+     * hit otherwise copies the whole entry, which for packfiles is megabytes
+     * per read.
+     */
+    copy?: boolean;
+    /** Called when a read is answered from cache. */
+    onHit?: (key: string) => void;
+    /** Called when a read has to go to the backing store. */
+    onMiss?: (key: string) => void;
+}
+/** An {@link ObjectStore} wrapper that also supports explicit invalidation. */
+export interface CachedObjectStore extends ObjectStore {
+    /**
+     * Drop every cached entry — contents, misses, and listings — whose key
+     * falls under `prefix` (exact keys included). Call this after the backing
+     * store was modified by something other than this wrapper.
+     */
+    invalidate(prefix: string): void;
+}
+/**
+ * Wrap an {@link ObjectStore} with an in-process LRU read cache.
+ *
+ * Git object keys are content-addressed and therefore immutable, which makes
+ * them ideal cache entries; mutable keys (refs, packed-refs) are bounded by
+ * `ttlMs`. Writes and deletes through this wrapper invalidate their key and
+ * any cached listings they affect — with one asymmetry: a non-empty `limit: 1`
+ * probe (a "directory exists" answer) survives writes underneath it, because
+ * adding a key below a prefix cannot make that prefix stop existing, while
+ * empty probes and full listings are always dropped.
+ */
+export declare function createCachedStore(store: ObjectStore, options?: CacheOptions): CachedObjectStore;

package/dist/types/edge-utils.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Edge-compatible utilities replacing node:crypto, node:zlib, and Buffer.
+ *
+ * Every function here uses only Web APIs (SubtleCrypto, CompressionStream,
+ * TextEncoder/TextDecoder) — no Node built-ins. They work on Cloudflare
+ * Workers, Vercel Edge, Deno Deploy, and Node >= 18.
+ */
+/**
+ * Encode a UTF-8 string to bytes.
+ *
+ * Return type pinned to `Uint8Array<ArrayBuffer>` (not the bare `Uint8Array`,
+ * whose default type argument differs across TypeScript versions) so it's
+ * always assignable to Fetch API `BodyInit` regardless of a consumer's own
+ * TypeScript/lib version.
+ */
+export declare function encodeUtf8(data: string): Uint8Array<ArrayBuffer>;
+/** Decode bytes as UTF-8. */
+export declare function decodeUtf8(data: Uint8Array): string;
+/** Decode bytes as ASCII. */
+export declare function decodeAscii(data: Uint8Array): string;
+/** Concatenate any number of Uint8Arrays into one. */
+export declare function concat(...parts: Uint8Array[]): Uint8Array<ArrayBuffer>;
+/** Uint8Array → lowercase hex string. */
+export declare function toHex(data: Uint8Array): string;
+/** Uint8Array → base64 string. */
+export declare function toBase64(data: Uint8Array): string;
+/** Hex string → Uint8Array. */
+export declare function fromHex(hex: string): Uint8Array<ArrayBuffer>;
+/** SHA-1 hash via Web Crypto API. Returns a hex string. */
+export declare function sha1(data: Uint8Array<ArrayBuffer> | string): Promise<string>;
+/** Deflate (zlib) via the CompressionStream Web API. */
+export declare function deflate(data: Uint8Array<ArrayBuffer>): Promise<Uint8Array<ArrayBuffer>>;
+/** Check if a Uint8Array contains a null byte. */
+export declare function hasNullByte(data: Uint8Array): boolean;
+/**
+ * Read a blob as text or binary metadata — the edge-compatible replacement
+ * for the `Buffer.from(blob)` pattern used throughout diff.ts and history.ts.
+ */
+export declare function readBlobContent(blob: Uint8Array): {
+    isBinary: boolean;
+    text: string;
+    bytes: Uint8Array;
+};

package/dist/types/errors.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Node-style filesystem error carrying a `code` property, which is what
+ * isomorphic-git inspects to distinguish "file not found" from real failures.
+ */
+export declare class FsError extends Error {
+    readonly code: string;
+    readonly syscall: string;
+    readonly path: string;
+    constructor(code: string, syscall: string, path: string);
+}
+export declare const enoent: (syscall: string, path: string) => FsError;
+export declare const enotdir: (syscall: string, path: string) => FsError;
+export declare const eisdir: (syscall: string, path: string) => FsError;
+export declare const enotempty: (syscall: string, path: string) => FsError;
+export declare const einval: (syscall: string, path: string) => FsError;
+export declare const eperm: (syscall: string, path: string) => FsError;

package/dist/types/git-errors.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Git-server error types carrying an HTTP status and a retryability flag, so
+ * transport layers can map internal failures to responses without inspecting
+ * messages. Extend {@link GitError} for app-specific cases (storage backends,
+ * quota, …) and {@link formatErrorResponse} keeps working for them.
+ */
+export declare class GitError extends Error {
+    statusCode: number;
+    retryable: boolean;
+    constructor(message: string, statusCode?: number, retryable?: boolean);
+    toJSON(): Record<string, unknown>;
+}
+/** A file/directory path not found within a tree (404). */
+export declare class GitPathNotFoundError extends GitError {
+    constructor(message: string);
+}
+/** A git object not found (404). */
+export declare class GitObjectNotFoundError extends GitError {
+    constructor(message: string);
+}
+/** A ref (branch/tag) not found (404). */
+export declare class GitRefNotFoundError extends GitError {
+    constructor(message: string);
+}
+/** The repository itself not found (404). */
+export declare class GitRepositoryNotFoundError extends GitError {
+    constructor(message: string);
+}
+export interface MergeConflictDetail {
+    file: string;
+    baseLines?: string[];
+    sourceLines?: string[];
+    targetLines?: string[];
+}
+/** A merge conflict (409), carrying per-file conflict detail. */
+export declare class GitConflictError extends GitError {
+    conflicts: MergeConflictDetail[];
+    constructor(message: string, conflicts?: MergeConflictDetail[]);
+    toJSON(): Record<string, unknown>;
+}
+/** Authentication failed (401). */
+export declare class GitAuthenticationError extends GitError {
+    constructor(message: string);
+}
+/** Authorization failed (403). */
+export declare class GitAuthorizationError extends GitError {
+    constructor(message: string);
+}
+/** Too many failed attempts (429). */
+export declare class GitRateLimitError extends GitError {
+    constructor(message: string);
+}
+/** Malformed request (400). */
+export declare class GitInvalidRequestError extends GitError {
+    constructor(message: string);
+}
+/** Git wire-protocol violation (400). */
+export declare class GitProtocolError extends GitError {
+    constructor(message: string);
+}
+/**
+ * Map any error to an HTTP response shape. 401s carry the WWW-Authenticate
+ * header git clients need before they will prompt for credentials. Non-GitError
+ * failures are masked as opaque 500s — internal messages don't leak.
+ */
+export declare function formatErrorResponse(error: unknown): {
+    status: number;
+    body: Record<string, unknown>;
+    headers?: Record<string, string>;
+};

package/dist/types/git-fs.d.ts

@@ -0,0 +1,60 @@
+import type { GitdirFacts, GitFsClient, GitFsOptions, ObjectStore } from "./types.js";
+/**
+ * The filesystem returned by {@link createGitFs}: the isomorphic-git client
+ * plus git-aware maintenance hooks.
+ */
+export interface GitFs extends GitFsClient {
+    /**
+     * Return every file below a directory in one object-store listing. Unlike
+     * `readdir`, this deliberately does not use a delimiter: object storage can
+     * enumerate a ref namespace recursively without the stat-per-entry walk a
+     * POSIX filesystem needs to distinguish files from implicit directories.
+     * Paths are relative to `dirpath` and never include directory entries.
+     */
+    listFilesRecursively(dirpath: string): Promise<string[]>;
+    /**
+     * Probe, with one bounded list, whether `gitdir` contains any loose
+     * objects, and remember the answer. This is the only way a loose-object
+     * hint is ever created; call it before full-history walks (commit logs,
+     * reachability traversals) so fully packed repositories skip every
+     * guaranteed-miss loose-object read. A later loose write flips the hint
+     * back, so it cannot go stale mid-push.
+     */
+    detectLooseObjects(gitdir: string): Promise<void>;
+    /**
+     * Warm the cache with every pack file under `gitdir` in parallel (plus
+     * the loose-object hint) before a sequential history walk. Skipped when
+     * the pack directory holds more than `maxPacks * 2` entries — warming
+     * only helps when the cache budget actually fits the packs.
+     */
+    prefetchPacks(gitdir: string, options?: {
+        maxPacks?: number;
+    }): Promise<void>;
+    /**
+     * Clear fs-level state (loose-object hints) under `pathPrefix`, and
+     * forward to the store's `invalidate` when it has one. Call after the
+     * backing store was modified by something other than this fs.
+     */
+    invalidate(pathPrefix: string): void;
+    /**
+     * Declare that `gitdir` exists, so `stat` answers "directory" for it with
+     * zero store calls. isomorphic-git stats the gitdir on every command
+     * (`discoverGitdir`); in object storage that is a HEAD that always misses
+     * plus a listing. Register once the caller has confirmed the repository
+     * exists by other means (e.g. its database row); `invalidate` forgets it.
+     */
+    registerGitdir(gitdir: string, facts?: GitdirFacts): void;
+}
+/**
+ * Create a promise-based filesystem client for isomorphic-git backed by an
+ * {@link ObjectStore}.
+ *
+ * Semantics:
+ * - Directories are implicit, as in object storage: `mkdir` is a no-op and a
+ *   directory "exists" whenever at least one key lives under its prefix.
+ * - Symbolic links are not supported (`readlink`/`symlink` throw). Bare
+ *   repositories never contain them.
+ * - Designed for bare, server-side repositories (`git.init({bare: true})`,
+ *   plumbing commands, ref updates). Worktree checkouts belong on a real disk.
+ */
+export declare function createGitFs(store: ObjectStore, options?: GitFsOptions): GitFs;