git-fs-s3 0.8.0 → 0.9.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (16) hide show
  1. package/README.md +3 -3
  2. package/dist/http.js +5 -3
  3. package/dist/http.js.map +1 -1
  4. package/dist/index.js.map +1 -1
  5. package/dist/ops.js +125 -231
  6. package/dist/ops.js.map +1 -1
  7. package/dist/types/errors.d.ts +0 -1
  8. package/dist/types/http/index.d.ts +2 -2
  9. package/dist/types/http/pack-reuse.d.ts +2 -1
  10. package/dist/types/ops/diff.d.ts +7 -3
  11. package/dist/types/ops/file-history.d.ts +4 -18
  12. package/dist/types/ops/history.d.ts +30 -43
  13. package/dist/types/ops/index.d.ts +3 -3
  14. package/dist/types/ops/last-commit.d.ts +2 -8
  15. package/dist/types/ops/types.d.ts +10 -16
  16. package/package.json +1 -1
package/dist/ops.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/ops/commit.ts","../src/ops/packed-writes.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 { GitInvalidRequestError, GitPathNotFoundError } from \"../git-errors.js\";\nimport { isSafeTreePath } from \"../refs.js\";\nimport { assertSafeBranchName } from \"./branch.js\";\nimport { withPackedWrites } from \"./packed-writes.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 * Every object the commit creates (blobs, trees, the commit) is stored as one\n * pack (see {@link withPackedWrites}), written before the ref.\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\t/**\n\t\t * Writes go through `writeRepo` (the packed-writes view of the repo),\n\t\t * never the outer repo — objects written around it would bypass the\n\t\t * pack and land loose.\n\t\t */\n\t\tbuildTree: (\n\t\t\tparentTreeOid: string | undefined,\n\t\t\twriteRepo: Repo,\n\t\t) => Promise<string>;\n\t},\n): Promise<string> {\n\tassertSafeBranchName(options.branch);\n\treturn withPackedWrites(repo, (packed) => writeCommit(packed, options));\n}\n\nasync function writeCommit(\n\trepo: Repo,\n\toptions: Parameters<typeof writeCommitToBare>[1],\n): Promise<string> {\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, repo);\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 async 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\tconst paths = new Set<string>();\n\tfor (const file of options.files) {\n\t\tif (!isSafeTreePath(file.path)) {\n\t\t\tthrow new GitInvalidRequestError(`Invalid file path: ${file.path}`);\n\t\t}\n\t\tif (paths.has(file.path)) {\n\t\t\tthrow new GitInvalidRequestError(`Duplicate file path: ${file.path}`);\n\t\t}\n\t\tpaths.add(file.path);\n\t}\n\tif (paths.size === 0) {\n\t\tthrow new GitInvalidRequestError(\"A commit needs at least one file\");\n\t}\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid, writeRepo) => {\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({ ...writeRepo, 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(writeRepo, 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 async 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\tif (!isSafeTreePath(options.filePath)) {\n\t\tthrow new GitInvalidRequestError(`Invalid file path: ${options.filePath}`);\n\t}\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid, writeRepo) => {\n\t\t\tif (!parentTreeOid) {\n\t\t\t\tthrow new GitPathNotFoundError(`Branch ${options.branch} is empty`);\n\t\t\t}\n\t\t\treturn deleteFromTree(writeRepo, parentTreeOid, options.filePath);\n\t\t},\n\t});\n}\n","/**\n * Packed writes: run git plumbing (writeBlob/writeTree/writeCommit, and\n * anything built on them) against a repository, but store the objects it\n * creates as one pack instead of one loose object each.\n *\n * Why it matters on object storage: one PUT per object becomes two per\n * operation (pack + index), and a repository that is never given loose\n * objects stays \"fully packed\" forever — which is what makes the loose-object\n * hint (`GitFs.detectLooseObjects`) safe across processes. A process that\n * once saw \"no loose objects\" in a gitdir can't be told when another process\n * writes one; if nothing ever writes loose objects, that answer stays true.\n *\n * Ordering is preserved: the pending objects are flushed (pack, then its\n * index) before any other file is written — so a ref written inside `fn`\n * never becomes visible before the objects it names.\n */\nimport { inflate } from \"../edge-utils.js\";\nimport { parseLooseObjectPath } from \"../git-layout.js\";\nimport {\n\tencodePack,\n\ttype PackObject,\n\ttype PackObjectType,\n\tstorePack,\n} from \"../pack-write.js\";\nimport type { IsoGitFs, Repo } from \"./types.js\";\n\ninterface PromiseFs {\n\treadFile(path: string, options?: unknown): Promise<Uint8Array | string>;\n\twriteFile(\n\t\tpath: string,\n\t\tdata: Uint8Array | string,\n\t\toptions?: unknown,\n\t): Promise<void>;\n\tstat(path: string): Promise<unknown>;\n\tlstat(path: string): Promise<unknown>;\n\t[key: string]: unknown;\n}\n\nconst OBJECT_TYPES = new Set<PackObjectType>([\"commit\", \"tree\", \"blob\", \"tag\"]);\n\n/** Split a loose object's inflated bytes (\"<type> <size>\\0<content>\"). */\nfunction parseLooseObject(raw: Uint8Array<ArrayBuffer>): PackObject {\n\tconst nul = raw.indexOf(0);\n\tconst header = new TextDecoder().decode(raw.subarray(0, nul));\n\tconst [type, size] = header.split(\" \");\n\tconst content = raw.slice(nul + 1);\n\tif (\n\t\t!OBJECT_TYPES.has(type as PackObjectType) ||\n\t\tNumber(size) !== content.length\n\t) {\n\t\tthrow new Error(`packed writes: malformed object header \"${header}\"`);\n\t}\n\treturn { type: type as PackObjectType, content };\n}\n\nfunction fileStat(size: number) {\n\tconst epoch = new Date(0);\n\treturn {\n\t\ttype: \"file\",\n\t\tmode: 0o100644,\n\t\tsize,\n\t\tino: 0,\n\t\tmtimeMs: 0,\n\t\tctimeMs: 0,\n\t\tuid: 0,\n\t\tgid: 0,\n\t\tdev: 0,\n\t\tmtime: epoch,\n\t\tctime: epoch,\n\t\tisFile: () => true,\n\t\tisDirectory: () => false,\n\t\tisSymbolicLink: () => false,\n\t};\n}\n\n/**\n * Run `fn` with a repo whose new objects are buffered and stored as a single\n * pack. Objects are flushed before any non-object write inside `fn`, and once\n * more when `fn` resolves; if `fn` throws, still-unflushed objects are\n * discarded (they'd be unreachable anyway). Serialize concurrent writers to\n * the same repository externally, as for any write.\n */\nexport async function withPackedWrites<T>(\n\trepo: Repo,\n\tfn: (packedRepo: Repo) => Promise<T>,\n): Promise<T> {\n\tconst base = (repo.fs as unknown as { promises: PromiseFs }).promises;\n\tconst pending = new Map<string, Uint8Array<ArrayBuffer>>(); // path → deflated loose bytes\n\n\tasync function flush(): Promise<void> {\n\t\tif (pending.size === 0) return;\n\t\tconst objects = await Promise.all(\n\t\t\t[...pending.values()].map(async (deflated) =>\n\t\t\t\tparseLooseObject(await inflate(deflated)),\n\t\t\t),\n\t\t);\n\t\tawait storePack(repo, await encodePack(objects));\n\t\tpending.clear();\n\t}\n\n\tconst promises: PromiseFs = new Proxy(base, {\n\t\tget(target, property, receiver) {\n\t\t\tswitch (property) {\n\t\t\t\tcase \"writeFile\":\n\t\t\t\t\treturn async (\n\t\t\t\t\t\tpath: string,\n\t\t\t\t\t\tdata: Uint8Array | string,\n\t\t\t\t\t\toptions?: unknown,\n\t\t\t\t\t) => {\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\tparseLooseObjectPath(path) !== null &&\n\t\t\t\t\t\t\ttypeof data !== \"string\"\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tpending.set(path, new Uint8Array(data));\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tawait flush();\n\t\t\t\t\t\treturn target.writeFile(path, data, options);\n\t\t\t\t\t};\n\t\t\t\tcase \"readFile\":\n\t\t\t\t\treturn async (path: string, options?: unknown) => {\n\t\t\t\t\t\tconst data = pending.get(path);\n\t\t\t\t\t\tif (data === undefined) return target.readFile(path, options);\n\t\t\t\t\t\treturn data;\n\t\t\t\t\t};\n\t\t\t\tcase \"stat\":\n\t\t\t\tcase \"lstat\":\n\t\t\t\t\treturn async (path: string) => {\n\t\t\t\t\t\tconst data = pending.get(path);\n\t\t\t\t\t\tif (data !== undefined) return fileStat(data.length);\n\t\t\t\t\t\treturn target[property](path);\n\t\t\t\t\t};\n\t\t\t\tdefault: {\n\t\t\t\t\tconst value = Reflect.get(target, property, receiver);\n\t\t\t\t\treturn typeof value === \"function\" ? value.bind(target) : value;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t});\n\n\tconst packedRepo: Repo = { ...repo, fs: { promises } as unknown as IsoGitFs };\n\tconst result = await fn(packedRepo);\n\tawait flush();\n\treturn result;\n}\n","import git from \"isomorphic-git\";\nimport { GitInvalidRequestError, GitPathNotFoundError } from \"../git-errors.js\";\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/** File modes a blob entry can carry; anything else isn't a regular file. */\nconst BLOB_MODES = new Set([\"100644\", \"100755\", \"120000\"]);\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 *\n * An updated file keeps its existing mode (executable bit, symlink); a path\n * that names an existing directory, or runs through an existing file, is\n * rejected rather than silently replacing what's there.\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\tconst current = byName.get(name);\n\t\tif (current && current.type !== \"blob\") {\n\t\t\tthrow new GitInvalidRequestError(`\"${name}\" is a directory, not a file`);\n\t\t}\n\t\tbyName.set(name, {\n\t\t\tmode: current && BLOB_MODES.has(current.mode) ? current.mode : \"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\tif (entry && entry.type !== \"tree\") {\n\t\t\t\tthrow new GitInvalidRequestError(`\"${dir}\" is a file, not a directory`);\n\t\t\t}\n\t\t\tconst subtreeOid = entry?.oid;\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/**\n * Remove a file path from a tree, returning the new root tree oid. Throws\n * GitPathNotFoundError when there's no such file; directories left empty\n * are dropped, as git never stores an empty subtree.\n */\nexport async function deleteFromTree(\n\trepo: Repo,\n\ttreeOid: string,\n\tfilePath: string,\n): Promise<string> {\n\tconst result = await deleteFromSubtree(repo, treeOid, filePath, filePath);\n\treturn result ?? git.writeTree({ ...repo, tree: [] });\n}\n\n/** The new subtree oid, or null when removing the file left it empty. */\nasync function deleteFromSubtree(\n\trepo: Repo,\n\ttreeOid: string,\n\tfilePath: string,\n\tfullPath: string,\n): Promise<string | null> {\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\tconst name = slash === -1 ? filePath : filePath.slice(0, slash);\n\tconst entry = byName.get(name);\n\tif (slash === -1) {\n\t\tif (entry?.type !== \"blob\") {\n\t\t\tthrow new GitPathNotFoundError(`No such file: ${fullPath}`);\n\t\t}\n\t\tbyName.delete(name);\n\t} else {\n\t\tif (entry?.type !== \"tree\") {\n\t\t\tthrow new GitPathNotFoundError(`No such file: ${fullPath}`);\n\t\t}\n\t\tconst newOid = await deleteFromSubtree(\n\t\t\trepo,\n\t\t\tentry.oid,\n\t\t\tfilePath.slice(slash + 1),\n\t\t\tfullPath,\n\t\t);\n\t\tif (newOid === null) byName.delete(name);\n\t\telse byName.set(name, { ...entry, oid: newOid });\n\t}\n\tif (byName.size === 0) return null;\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 } from \"../edge-utils.js\";\nimport { qualifyBranchRef } from \"../refs.js\";\nimport { getCommit } from \"./history.js\";\nimport type { Repo } from \"./types.js\";\n\n/** Text files larger than this get no patch (kind \"too-large\"). */\nexport const MAX_DIFF_TEXT_BYTES = 1024 * 1024;\n\nexport interface DiffFile {\n\tpath: string;\n\tstatus: \"added\" | \"modified\" | \"deleted\" | \"renamed\";\n\t/**\n\t * \"text\" has a unified `patch`; \"binary\" (a NUL byte on either side) and\n\t * \"too-large\" (text over MAX_DIFF_TEXT_BYTES) don't — fetch the sides by\n\t * path at each ref if they need showing.\n\t */\n\tkind: \"text\" | \"binary\" | \"too-large\";\n\tadditions: number;\n\tdeletions: number;\n\tpatch: string;\n\toldPath?: string;\n\t/** Byte size before the change; absent for an added file. */\n\toldSize?: number;\n\t/** Byte size after the change; absent for a deleted file. */\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 kind: DiffFile[\"kind\"] =\n\t\tbefore?.isBinary || after?.isBinary\n\t\t\t? \"binary\"\n\t\t\t: Math.max(before?.bytes.length ?? 0, after?.bytes.length ?? 0) >\n\t\t\t\t\tMAX_DIFF_TEXT_BYTES\n\t\t\t\t? \"too-large\"\n\t\t\t\t: \"text\";\n\tconst isText = kind === \"text\";\n\treturn {\n\t\tpath,\n\t\tstatus,\n\t\tkind,\n\t\tadditions: isText && after ? countContentLines(after.text) : 0,\n\t\tdeletions: isText && before ? countContentLines(before.text) : 0,\n\t\tpatch: isText\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\t\t: \"\",\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 =\n\t\t\tsourceOid === targetOid ||\n\t\t\t(await git.isDescendent({\n\t\t\t\t...repo,\n\t\t\t\toid: sourceOid,\n\t\t\t\tancestor: targetOid,\n\t\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\t// Nothing to merge when the target already contains the source (same\n\t// commit, or source is an ancestor) — never write a no-op merge commit.\n\tif (\n\t\tsourceOid === targetOid ||\n\t\t(await git.isDescendent({ ...repo, oid: targetOid, ancestor: sourceOid }))\n\t) {\n\t\treturn { success: true, commitSha: targetOid };\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;;;ACsChB,IAAM,eAAe,oBAAI,IAAoB,CAAC,UAAU,QAAQ,QAAQ,KAAK,CAAC;AAG9E,SAAS,iBAAiB,KAA0C;AACnE,QAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,QAAM,SAAS,IAAI,YAAY,EAAE,OAAO,IAAI,SAAS,GAAG,GAAG,CAAC;AAC5D,QAAM,CAAC,MAAM,IAAI,IAAI,OAAO,MAAM,GAAG;AACrC,QAAM,UAAU,IAAI,MAAM,MAAM,CAAC;AACjC,MACC,CAAC,aAAa,IAAI,IAAsB,KACxC,OAAO,IAAI,MAAM,QAAQ,QACxB;AACD,UAAM,IAAI,MAAM,2CAA2C,MAAM,GAAG;AAAA,EACrE;AACA,SAAO,EAAE,MAA8B,QAAQ;AAChD;AAEA,SAAS,SAAS,MAAc;AAC/B,QAAM,QAAQ,oBAAI,KAAK,CAAC;AACxB,SAAO;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN;AAAA,IACA,KAAK;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,QAAQ,MAAM;AAAA,IACd,aAAa,MAAM;AAAA,IACnB,gBAAgB,MAAM;AAAA,EACvB;AACD;AASA,eAAsB,iBACrB,MACA,IACa;AACb,QAAM,OAAQ,KAAK,GAA0C;AAC7D,QAAM,UAAU,oBAAI,IAAqC;AAEzD,iBAAe,QAAuB;AACrC,QAAI,QAAQ,SAAS,EAAG;AACxB,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC7B,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE;AAAA,QAAI,OAAO,aAChC,iBAAiB,MAAM,QAAQ,QAAQ,CAAC;AAAA,MACzC;AAAA,IACD;AACA,UAAM,UAAU,MAAM,MAAM,WAAW,OAAO,CAAC;AAC/C,YAAQ,MAAM;AAAA,EACf;AAEA,QAAM,WAAsB,IAAI,MAAM,MAAM;AAAA,IAC3C,IAAI,QAAQ,UAAU,UAAU;AAC/B,cAAQ,UAAU;AAAA,QACjB,KAAK;AACJ,iBAAO,OACN,MACA,MACA,YACI;AACJ,gBACC,qBAAqB,IAAI,MAAM,QAC/B,OAAO,SAAS,UACf;AACD,sBAAQ,IAAI,MAAM,IAAI,WAAW,IAAI,CAAC;AACtC;AAAA,YACD;AACA,kBAAM,MAAM;AACZ,mBAAO,OAAO,UAAU,MAAM,MAAM,OAAO;AAAA,UAC5C;AAAA,QACD,KAAK;AACJ,iBAAO,OAAO,MAAc,YAAsB;AACjD,kBAAM,OAAO,QAAQ,IAAI,IAAI;AAC7B,gBAAI,SAAS,OAAW,QAAO,OAAO,SAAS,MAAM,OAAO;AAC5D,mBAAO;AAAA,UACR;AAAA,QACD,KAAK;AAAA,QACL,KAAK;AACJ,iBAAO,OAAO,SAAiB;AAC9B,kBAAM,OAAO,QAAQ,IAAI,IAAI;AAC7B,gBAAI,SAAS,OAAW,QAAO,SAAS,KAAK,MAAM;AACnD,mBAAO,OAAO,QAAQ,EAAE,IAAI;AAAA,UAC7B;AAAA,QACD,SAAS;AACR,gBAAM,QAAQ,QAAQ,IAAI,QAAQ,UAAU,QAAQ;AACpD,iBAAO,OAAO,UAAU,aAAa,MAAM,KAAK,MAAM,IAAI;AAAA,QAC3D;AAAA,MACD;AAAA,IACD;AAAA,EACD,CAAC;AAED,QAAM,aAAmB,EAAE,GAAG,MAAM,IAAI,EAAE,SAAS,EAAyB;AAC5E,QAAM,SAAS,MAAM,GAAG,UAAU;AAClC,QAAM,MAAM;AACZ,SAAO;AACR;;;AChJA,OAAO,SAAS;AAYhB,IAAM,WAAW,CAAC,QAAgB,SACjC,SAAS,GAAG,OAAO,QAAQ,QAAQ,EAAE,CAAC,IAAI,IAAI,KAAK;AAGpD,IAAM,aAAa,oBAAI,IAAI,CAAC,UAAU,UAAU,QAAQ,CAAC;AAUzD,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,UAAM,UAAU,OAAO,IAAI,IAAI;AAC/B,QAAI,WAAW,QAAQ,SAAS,QAAQ;AACvC,YAAM,IAAI,uBAAuB,IAAI,IAAI,8BAA8B;AAAA,IACxE;AACA,WAAO,IAAI,MAAM;AAAA,MAChB,MAAM,WAAW,WAAW,IAAI,QAAQ,IAAI,IAAI,QAAQ,OAAO;AAAA,MAC/D,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,UAAI,SAAS,MAAM,SAAS,QAAQ;AACnC,cAAM,IAAI,uBAAuB,IAAI,GAAG,8BAA8B;AAAA,MACvE;AACA,YAAM,aAAa,OAAO;AAC1B,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;AAOA,eAAsB,eACrB,MACA,SACA,UACkB;AAClB,QAAM,SAAS,MAAM,kBAAkB,MAAM,SAAS,UAAU,QAAQ;AACxE,SAAO,UAAU,IAAI,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,EAAE,CAAC;AACrD;AAGA,eAAe,kBACd,MACA,SACA,UACA,UACyB;AACzB,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,QAAM,OAAO,UAAU,KAAK,WAAW,SAAS,MAAM,GAAG,KAAK;AAC9D,QAAM,QAAQ,OAAO,IAAI,IAAI;AAC7B,MAAI,UAAU,IAAI;AACjB,QAAI,OAAO,SAAS,QAAQ;AAC3B,YAAM,IAAI,qBAAqB,iBAAiB,QAAQ,EAAE;AAAA,IAC3D;AACA,WAAO,OAAO,IAAI;AAAA,EACnB,OAAO;AACN,QAAI,OAAO,SAAS,QAAQ;AAC3B,YAAM,IAAI,qBAAqB,iBAAiB,QAAQ,EAAE;AAAA,IAC3D;AACA,UAAM,SAAS,MAAM;AAAA,MACpB;AAAA,MACA,MAAM;AAAA,MACN,SAAS,MAAM,QAAQ,CAAC;AAAA,MACxB;AAAA,IACD;AACA,QAAI,WAAW,KAAM,QAAO,OAAO,IAAI;AAAA,QAClC,QAAO,IAAI,MAAM,EAAE,GAAG,OAAO,KAAK,OAAO,CAAC;AAAA,EAChD;AACA,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,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;;;AFpKO,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;AAcA,eAAsB,kBACrB,MACA,SAckB;AAClB,uBAAqB,QAAQ,MAAM;AACnC,SAAO,iBAAiB,MAAM,CAAC,WAAW,YAAY,QAAQ,OAAO,CAAC;AACvE;AAEA,eAAe,YACd,MACA,SACkB;AAClB,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,eAAe,IAAI;AAC3D,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;AAOA,eAAsB,kBACrB,MACA,SAMkB;AAClB,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,QAAQ,QAAQ,OAAO;AACjC,QAAI,CAAC,eAAe,KAAK,IAAI,GAAG;AAC/B,YAAM,IAAI,uBAAuB,sBAAsB,KAAK,IAAI,EAAE;AAAA,IACnE;AACA,QAAI,MAAM,IAAI,KAAK,IAAI,GAAG;AACzB,YAAM,IAAI,uBAAuB,wBAAwB,KAAK,IAAI,EAAE;AAAA,IACrE;AACA,UAAM,IAAI,KAAK,IAAI;AAAA,EACpB;AACA,MAAI,MAAM,SAAS,GAAG;AACrB,UAAM,IAAI,uBAAuB,kCAAkC;AAAA,EACpE;AACA,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,eAAe,cAAc;AAC9C,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,WAAW,MAAM,QAAQ,CAAC;AAC/D,gBAAM,IAAI,KAAK,MAAM,GAAG;AAAA,QACzB,CAAC;AAAA,MACF;AACA,aAAO,WAAW,WAAW,eAAe,KAAK;AAAA,IAClD;AAAA,EACD,CAAC;AACF;AAGA,eAAsB,mBACrB,MACA,SAMkB;AAClB,MAAI,CAAC,eAAe,QAAQ,QAAQ,GAAG;AACtC,UAAM,IAAI,uBAAuB,sBAAsB,QAAQ,QAAQ,EAAE;AAAA,EAC1E;AACA,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,eAAe,cAAc;AAC9C,UAAI,CAAC,eAAe;AACnB,cAAM,IAAI,qBAAqB,UAAU,QAAQ,MAAM,WAAW;AAAA,MACnE;AACA,aAAO,eAAe,WAAW,eAAe,QAAQ,QAAQ;AAAA,IACjE;AAAA,EACD,CAAC;AACF;;;AGzKA,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;;;ADpVO,IAAM,sBAAsB,OAAO;AA6B1C,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,OACL,QAAQ,YAAY,OAAO,WACxB,WACA,KAAK,IAAI,QAAQ,MAAM,UAAU,GAAG,OAAO,MAAM,UAAU,CAAC,IAC5D,sBACC,cACA;AACL,QAAM,SAAS,SAAS;AACxB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,UAAU,QAAQ,kBAAkB,MAAM,IAAI,IAAI;AAAA,IAC7D,WAAW,UAAU,SAAS,kBAAkB,OAAO,IAAI,IAAI;AAAA,IAC/D,OAAO,SACJ,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,IACA;AAAA,IACH,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;;;AG1NO,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,eACL,cAAc,aACb,MAAMA,KAAI,aAAa;AAAA,MACvB,GAAG;AAAA,MACH,KAAK;AAAA,MACL,UAAU;AAAA,IACX,CAAC;AAEF,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;AAGD,MACC,cAAc,aACb,MAAMA,KAAI,aAAa,EAAE,GAAG,MAAM,KAAK,WAAW,UAAU,UAAU,CAAC,GACvE;AACD,WAAO,EAAE,SAAS,MAAM,WAAW,UAAU;AAAA,EAC9C;AACA,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"]}
1
+ {"version":3,"sources":["../src/ops/commit.ts","../src/ops/packed-writes.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 { GitInvalidRequestError, GitPathNotFoundError } from \"../git-errors.js\";\nimport { isSafeTreePath } from \"../refs.js\";\nimport { assertSafeBranchName } from \"./branch.js\";\nimport { withPackedWrites } from \"./packed-writes.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 * Every object the commit creates (blobs, trees, the commit) is stored as one\n * pack (see {@link withPackedWrites}), written before the ref.\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\t/**\n\t\t * Writes go through `writeRepo` (the packed-writes view of the repo),\n\t\t * never the outer repo — objects written around it would bypass the\n\t\t * pack and land loose.\n\t\t */\n\t\tbuildTree: (\n\t\t\tparentTreeOid: string | undefined,\n\t\t\twriteRepo: Repo,\n\t\t) => Promise<string>;\n\t},\n): Promise<string> {\n\tassertSafeBranchName(options.branch);\n\treturn withPackedWrites(repo, (packed) => writeCommit(packed, options));\n}\n\nasync function writeCommit(\n\trepo: Repo,\n\toptions: Parameters<typeof writeCommitToBare>[1],\n): Promise<string> {\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, repo);\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 async 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\tconst paths = new Set<string>();\n\tfor (const file of options.files) {\n\t\tif (!isSafeTreePath(file.path)) {\n\t\t\tthrow new GitInvalidRequestError(`Invalid file path: ${file.path}`);\n\t\t}\n\t\tif (paths.has(file.path)) {\n\t\t\tthrow new GitInvalidRequestError(`Duplicate file path: ${file.path}`);\n\t\t}\n\t\tpaths.add(file.path);\n\t}\n\tif (paths.size === 0) {\n\t\tthrow new GitInvalidRequestError(\"A commit needs at least one file\");\n\t}\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid, writeRepo) => {\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({ ...writeRepo, 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(writeRepo, 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 async 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\tif (!isSafeTreePath(options.filePath)) {\n\t\tthrow new GitInvalidRequestError(`Invalid file path: ${options.filePath}`);\n\t}\n\treturn writeCommitToBare(repo, {\n\t\tbranch: options.branch,\n\t\tmessage: options.message,\n\t\tauthor: options.author,\n\t\tbuildTree: async (parentTreeOid, writeRepo) => {\n\t\t\tif (!parentTreeOid) {\n\t\t\t\tthrow new GitPathNotFoundError(`Branch ${options.branch} is empty`);\n\t\t\t}\n\t\t\treturn deleteFromTree(writeRepo, parentTreeOid, options.filePath);\n\t\t},\n\t});\n}\n","/**\n * Packed writes: run git plumbing (writeBlob/writeTree/writeCommit, and\n * anything built on them) against a repository, but store the objects it\n * creates as one pack instead of one loose object each.\n *\n * Why it matters on object storage: one PUT per object becomes two per\n * operation (pack + index), and a repository that is never given loose\n * objects stays \"fully packed\" forever — which is what makes the loose-object\n * hint (`GitFs.detectLooseObjects`) safe across processes. A process that\n * once saw \"no loose objects\" in a gitdir can't be told when another process\n * writes one; if nothing ever writes loose objects, that answer stays true.\n *\n * Ordering is preserved: the pending objects are flushed (pack, then its\n * index) before any other file is written — so a ref written inside `fn`\n * never becomes visible before the objects it names.\n */\nimport { inflate } from \"../edge-utils.js\";\nimport { parseLooseObjectPath } from \"../git-layout.js\";\nimport {\n\tencodePack,\n\ttype PackObject,\n\ttype PackObjectType,\n\tstorePack,\n} from \"../pack-write.js\";\nimport type { IsoGitFs, Repo } from \"./types.js\";\n\ninterface PromiseFs {\n\treadFile(path: string, options?: unknown): Promise<Uint8Array | string>;\n\twriteFile(\n\t\tpath: string,\n\t\tdata: Uint8Array | string,\n\t\toptions?: unknown,\n\t): Promise<void>;\n\tstat(path: string): Promise<unknown>;\n\tlstat(path: string): Promise<unknown>;\n\t[key: string]: unknown;\n}\n\nconst OBJECT_TYPES = new Set<PackObjectType>([\"commit\", \"tree\", \"blob\", \"tag\"]);\n\n/** Split a loose object's inflated bytes (\"<type> <size>\\0<content>\"). */\nfunction parseLooseObject(raw: Uint8Array<ArrayBuffer>): PackObject {\n\tconst nul = raw.indexOf(0);\n\tconst header = new TextDecoder().decode(raw.subarray(0, nul));\n\tconst [type, size] = header.split(\" \");\n\tconst content = raw.slice(nul + 1);\n\tif (\n\t\t!OBJECT_TYPES.has(type as PackObjectType) ||\n\t\tNumber(size) !== content.length\n\t) {\n\t\tthrow new Error(`packed writes: malformed object header \"${header}\"`);\n\t}\n\treturn { type: type as PackObjectType, content };\n}\n\nfunction fileStat(size: number) {\n\tconst epoch = new Date(0);\n\treturn {\n\t\ttype: \"file\",\n\t\tmode: 0o100644,\n\t\tsize,\n\t\tino: 0,\n\t\tmtimeMs: 0,\n\t\tctimeMs: 0,\n\t\tuid: 0,\n\t\tgid: 0,\n\t\tdev: 0,\n\t\tmtime: epoch,\n\t\tctime: epoch,\n\t\tisFile: () => true,\n\t\tisDirectory: () => false,\n\t\tisSymbolicLink: () => false,\n\t};\n}\n\n/**\n * Run `fn` with a repo whose new objects are buffered and stored as a single\n * pack. Objects are flushed before any non-object write inside `fn`, and once\n * more when `fn` resolves; if `fn` throws, still-unflushed objects are\n * discarded (they'd be unreachable anyway). Serialize concurrent writers to\n * the same repository externally, as for any write.\n */\nexport async function withPackedWrites<T>(\n\trepo: Repo,\n\tfn: (packedRepo: Repo) => Promise<T>,\n): Promise<T> {\n\tconst base = (repo.fs as unknown as { promises: PromiseFs }).promises;\n\tconst pending = new Map<string, Uint8Array<ArrayBuffer>>(); // path → deflated loose bytes\n\n\tasync function flush(): Promise<void> {\n\t\tif (pending.size === 0) return;\n\t\tconst objects = await Promise.all(\n\t\t\t[...pending.values()].map(async (deflated) =>\n\t\t\t\tparseLooseObject(await inflate(deflated)),\n\t\t\t),\n\t\t);\n\t\tawait storePack(repo, await encodePack(objects));\n\t\tpending.clear();\n\t}\n\n\tconst promises: PromiseFs = new Proxy(base, {\n\t\tget(target, property, receiver) {\n\t\t\tswitch (property) {\n\t\t\t\tcase \"writeFile\":\n\t\t\t\t\treturn async (\n\t\t\t\t\t\tpath: string,\n\t\t\t\t\t\tdata: Uint8Array | string,\n\t\t\t\t\t\toptions?: unknown,\n\t\t\t\t\t) => {\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\tparseLooseObjectPath(path) !== null &&\n\t\t\t\t\t\t\ttypeof data !== \"string\"\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tpending.set(path, new Uint8Array(data));\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tawait flush();\n\t\t\t\t\t\treturn target.writeFile(path, data, options);\n\t\t\t\t\t};\n\t\t\t\tcase \"readFile\":\n\t\t\t\t\treturn async (path: string, options?: unknown) => {\n\t\t\t\t\t\tconst data = pending.get(path);\n\t\t\t\t\t\tif (data === undefined) return target.readFile(path, options);\n\t\t\t\t\t\treturn data;\n\t\t\t\t\t};\n\t\t\t\tcase \"stat\":\n\t\t\t\tcase \"lstat\":\n\t\t\t\t\treturn async (path: string) => {\n\t\t\t\t\t\tconst data = pending.get(path);\n\t\t\t\t\t\tif (data !== undefined) return fileStat(data.length);\n\t\t\t\t\t\treturn target[property](path);\n\t\t\t\t\t};\n\t\t\t\tdefault: {\n\t\t\t\t\tconst value = Reflect.get(target, property, receiver);\n\t\t\t\t\treturn typeof value === \"function\" ? value.bind(target) : value;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t});\n\n\tconst packedRepo: Repo = { ...repo, fs: { promises } as unknown as IsoGitFs };\n\tconst result = await fn(packedRepo);\n\tawait flush();\n\treturn result;\n}\n","import git from \"isomorphic-git\";\nimport { GitInvalidRequestError, GitPathNotFoundError } from \"../git-errors.js\";\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/** File modes a blob entry can carry; anything else isn't a regular file. */\nconst BLOB_MODES = new Set([\"100644\", \"100755\", \"120000\"]);\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 *\n * An updated file keeps its existing mode (executable bit, symlink); a path\n * that names an existing directory, or runs through an existing file, is\n * rejected rather than silently replacing what's there.\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\tconst current = byName.get(name);\n\t\tif (current && current.type !== \"blob\") {\n\t\t\tthrow new GitInvalidRequestError(`\"${name}\" is a directory, not a file`);\n\t\t}\n\t\tbyName.set(name, {\n\t\t\tmode: current && BLOB_MODES.has(current.mode) ? current.mode : \"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\tif (entry && entry.type !== \"tree\") {\n\t\t\t\tthrow new GitInvalidRequestError(`\"${dir}\" is a file, not a directory`);\n\t\t\t}\n\t\t\tconst subtreeOid = entry?.oid;\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/**\n * Remove a file path from a tree, returning the new root tree oid. Throws\n * GitPathNotFoundError when there's no such file; directories left empty\n * are dropped, as git never stores an empty subtree.\n */\nexport async function deleteFromTree(\n\trepo: Repo,\n\ttreeOid: string,\n\tfilePath: string,\n): Promise<string> {\n\tconst result = await deleteFromSubtree(repo, treeOid, filePath, filePath);\n\treturn result ?? git.writeTree({ ...repo, tree: [] });\n}\n\n/** The new subtree oid, or null when removing the file left it empty. */\nasync function deleteFromSubtree(\n\trepo: Repo,\n\ttreeOid: string,\n\tfilePath: string,\n\tfullPath: string,\n): Promise<string | null> {\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\tconst name = slash === -1 ? filePath : filePath.slice(0, slash);\n\tconst entry = byName.get(name);\n\tif (slash === -1) {\n\t\tif (entry?.type !== \"blob\") {\n\t\t\tthrow new GitPathNotFoundError(`No such file: ${fullPath}`);\n\t\t}\n\t\tbyName.delete(name);\n\t} else {\n\t\tif (entry?.type !== \"tree\") {\n\t\t\tthrow new GitPathNotFoundError(`No such file: ${fullPath}`);\n\t\t}\n\t\tconst newOid = await deleteFromSubtree(\n\t\t\trepo,\n\t\t\tentry.oid,\n\t\t\tfilePath.slice(slash + 1),\n\t\t\tfullPath,\n\t\t);\n\t\tif (newOid === null) byName.delete(name);\n\t\telse byName.set(name, { ...entry, oid: newOid });\n\t}\n\tif (byName.size === 0) return null;\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, { type WalkerEntry } from \"isomorphic-git\";\nimport { readBlobContent } from \"../edge-utils.js\";\nimport { getCommit, resolveCommit } from \"./history.js\";\nimport type { Repo } from \"./types.js\";\n\n/** Text files larger than this get no patch (kind \"too-large\"). */\nexport const MAX_DIFF_TEXT_BYTES = 1024 * 1024;\n\nexport interface DiffFile {\n\tpath: string;\n\tstatus: \"added\" | \"modified\" | \"deleted\";\n\t/**\n\t * \"text\" has a unified `patch`; \"binary\" (a NUL byte on either side) and\n\t * \"too-large\" (text over MAX_DIFF_TEXT_BYTES) don't — fetch the sides by\n\t * path at each ref if they need showing.\n\t */\n\tkind: \"text\" | \"binary\" | \"too-large\";\n\tadditions: number;\n\tdeletions: number;\n\tpatch: string;\n\t/** Byte size before the change; absent for an added file. */\n\toldSize?: number;\n\t/** Byte size after the change; absent for a deleted file. */\n\tnewSize?: number;\n}\n\nexport interface DiffResult {\n\tfiles: DiffFile[];\n\ttotalAdditions: number;\n\ttotalDeletions: number;\n\ttotalFiles: number;\n}\n\ntype BlobContent = ReturnType<typeof readBlobContent>;\n\nfunction countContentLines(content: string): number {\n\tif (content.length === 0) return 0;\n\tconst lines = content.split(\"\\n\");\n\tif (lines.at(-1) === \"\") lines.pop();\n\treturn lines.length;\n}\n\nfunction unifiedPatch(\n\tpath: string,\n\tbefore: BlobContent | null,\n\tafter: BlobContent | null,\n): string {\n\tconst body = createTwoFilesPatch(\n\t\tbefore ? `a/${path}` : \"/dev/null\",\n\t\tafter ? `b/${path}` : \"/dev/null\",\n\t\tbefore?.text ?? \"\",\n\t\tafter?.text ?? \"\",\n\t\t\"\",\n\t\t\"\",\n\t\t{ context: 3 },\n\t).replace(/^=+\\n/, \"\");\n\treturn `diff --git a/${path} b/${path}\\n${body}`;\n}\n\n/** One changed path: `before` null for an addition, `after` null for a deletion. */\nfunction buildDiffFile(\n\tpath: string,\n\tbefore: BlobContent | null,\n\tafter: BlobContent | null,\n): DiffFile {\n\tconst kind: DiffFile[\"kind\"] =\n\t\tbefore?.isBinary || after?.isBinary\n\t\t\t? \"binary\"\n\t\t\t: Math.max(before?.bytes.length ?? 0, after?.bytes.length ?? 0) >\n\t\t\t\t\tMAX_DIFF_TEXT_BYTES\n\t\t\t\t? \"too-large\"\n\t\t\t\t: \"text\";\n\tconst isText = kind === \"text\";\n\treturn {\n\t\tpath,\n\t\tstatus: !before ? \"added\" : !after ? \"deleted\" : \"modified\",\n\t\tkind,\n\t\tadditions: isText && after ? countContentLines(after.text) : 0,\n\t\tdeletions: isText && before ? countContentLines(before.text) : 0,\n\t\tpatch: isText ? unifiedPatch(path, before, after) : \"\",\n\t\toldSize: before?.bytes.length,\n\t\tnewSize: after?.bytes.length,\n\t};\n}\n\n/**\n * Every file that differs between two trees; `oldTreeOid` null diffs against\n * nothing (a root commit: every file is an addition).\n */\nasync function diffTrees(\n\trepo: Repo,\n\toldTreeOid: string | null,\n\tnewTreeOid: string,\n): Promise<DiffResult> {\n\tconst readSide = async (entry: WalkerEntry | null) => {\n\t\tif (!entry || (await entry.type()) !== \"blob\") return null;\n\t\tconst { blob } = await git.readBlob({ ...repo, oid: await entry.oid() });\n\t\treturn readBlobContent(blob);\n\t};\n\tconst trees = oldTreeOid\n\t\t? [git.TREE({ ref: oldTreeOid }), git.TREE({ ref: newTreeOid })]\n\t\t: [git.TREE({ ref: newTreeOid })];\n\tconst changes: (DiffFile | undefined)[] = await git.walk({\n\t\t...repo,\n\t\ttrees,\n\t\tmap: async (filepath, entries) => {\n\t\t\tconst [oldEntry, newEntry] = oldTreeOid\n\t\t\t\t? [entries[0] ?? null, entries[1] ?? null]\n\t\t\t\t: [null, entries[0] ?? null];\n\t\t\tconst [oldType, newType] = await Promise.all([\n\t\t\t\toldEntry?.type(),\n\t\t\t\tnewEntry?.type(),\n\t\t\t]);\n\t\t\t// Directories recurse; only blobs become diff entries.\n\t\t\tif (oldType !== \"blob\" && newType !== \"blob\") return undefined;\n\t\t\tif (oldEntry && newEntry && oldType === newType) {\n\t\t\t\tconst [oldOid, newOid] = await Promise.all([\n\t\t\t\t\toldEntry.oid(),\n\t\t\t\t\tnewEntry.oid(),\n\t\t\t\t]);\n\t\t\t\tif (oldOid === newOid) return undefined;\n\t\t\t}\n\t\t\tconst [before, after] = await Promise.all([\n\t\t\t\treadSide(oldEntry),\n\t\t\t\treadSide(newEntry),\n\t\t\t]);\n\t\t\treturn before || after\n\t\t\t\t? buildDiffFile(filepath, before, after)\n\t\t\t\t: undefined;\n\t\t},\n\t});\n\tconst files = (changes ?? []).filter((file): file is DiffFile => !!file);\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\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\tconst { commit } = await getCommit(repo, commitSha);\n\tconst parent = commit.parent[0];\n\tconst parentTree = parent\n\t\t? (await getCommit(repo, parent)).commit.tree\n\t\t: null;\n\treturn diffTrees(repo, parentTree, commit.tree);\n}\n\n/**\n * What `compareRef` changed since it diverged from `baseRef` — a pull\n * request's diff (git's three-dot `base...compare`): compared against their\n * merge base, so commits that landed on `baseRef` since the branch point\n * don't show up as reverted. Throws GitRefNotFoundError for a missing ref.\n */\nexport async function getDiffBetweenRefs(\n\trepo: Repo,\n\tbaseRef: string,\n\tcompareRef: string,\n): Promise<DiffResult> {\n\tconst [base, compare] = await Promise.all([\n\t\tresolveCommit(repo, baseRef),\n\t\tresolveCommit(repo, compareRef),\n\t]);\n\tconst [mergeBase] = await git.findMergeBase({\n\t\t...repo,\n\t\toids: [base.oid, compare.oid],\n\t});\n\tconst baseTree =\n\t\tmergeBase === undefined\n\t\t\t? null\n\t\t\t: mergeBase === base.oid\n\t\t\t\t? base.commit.tree\n\t\t\t\t: (await getCommit(repo, mergeBase)).commit.tree;\n\treturn diffTrees(repo, baseTree, compare.commit.tree);\n}\n","import git from \"isomorphic-git\";\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/** How far back history walks look by default (commit count). */\nexport const HISTORY_WALK_DEPTH = 400;\n\nexport interface GitIdentity {\n\tname: string;\n\temail: string;\n\ttimestamp: number;\n\ttimezoneOffset: number;\n}\n\nexport interface CommitInfo {\n\toid: string;\n\tcommit: {\n\t\tmessage: string;\n\t\ttree: string;\n\t\tparent: string[];\n\t\tauthor: GitIdentity;\n\t\tcommitter: GitIdentity;\n\t};\n\tpayload: string;\n}\n\n/** The display summary of a commit (history lists, \"last commit\" columns). */\nexport interface CommitSummary {\n\tsha: string;\n\tmessage: string;\n\tauthorName: string;\n\tauthorEmail: string;\n\t/** ISO 8601 author date. */\n\tcreatedAt: string;\n}\n\nexport function summarizeCommit(commit: CommitInfo): CommitSummary {\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\nconst isNotFound = (err: unknown) =>\n\t(err as { code?: string } | null)?.code === \"NotFoundError\";\n\n/**\n * A ref that doesn't resolve is an expected condition (empty repo, unborn\n * branch) each caller handles. An object missing *underneath* a resolved ref\n * means storage is inconsistent — raised as GitObjectNotFoundError so it is\n * never mistaken for \"empty\".\n */\nfunction wrapMissingObject<T>(\n\tpromise: Promise<T>,\n\tcontext: string,\n): Promise<T> {\n\treturn promise.catch((err: unknown) => {\n\t\tif (isNotFound(err)) {\n\t\t\tthrow new GitObjectNotFoundError(\n\t\t\t\t`Git data for ${context} is missing from storage`,\n\t\t\t);\n\t\t}\n\t\tthrow err;\n\t});\n}\n\n/** The commit a branch name, full ref or sha points at; GitRefNotFoundError if none. */\nasync function resolveRefOid(repo: Repo, ref: string): Promise<string> {\n\ttry {\n\t\treturn await git.resolveRef({ ...repo, ref: qualifyBranchRef(ref) });\n\t} catch (err) {\n\t\tif (isNotFound(err))\n\t\t\tthrow new GitRefNotFoundError(`Ref ${ref} does not exist`);\n\t\tthrow err;\n\t}\n}\n\n/** Resolve a branch name / full ref / sha to its commit. */\nexport async function resolveCommit(repo: Repo, ref: string) {\n\tconst oid = await resolveRefOid(repo, ref);\n\tconst { commit } = await wrapMissingObject(\n\t\tgit.readCommit({ ...repo, oid }),\n\t\t`${repo.gitdir} commit ${oid}`,\n\t);\n\treturn { oid, 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 commit, a tree per path segment, then the blob: warm every pack first\n\t// rather than discovering them one round trip at a time.\n\tif (hooks?.prefetch) await runStep(hooks, \"prefetch\", hooks.prefetch);\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\tif (entry?.type !== \"blob\") {\n\t\tthrow new GitPathNotFoundError(`File not found: ${filePath}`);\n\t}\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\nexport interface CommitLogOptions {\n\tref: string;\n\tdepth?: number;\n\t/** The ref's commit, when the caller already resolved it (saves a lookup). */\n\tknownHeadSha?: string;\n}\n\n/**\n * The commit chain from a ref, newest first; [] when the ref doesn't exist.\n * Walking is sequential and round-trip-bound on object storage, so the\n * deepest walk seen per head is memoized in `hooks.resultCache` and sliced\n * for shallower requests.\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\tlet headSha = options.knownHeadSha;\n\tif (headSha === undefined) {\n\t\ttry {\n\t\t\theadSha = await resolveRefOid(repo, ref);\n\t\t} catch (err) {\n\t\t\tif (err instanceof GitRefNotFoundError) 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\tconst fullyWalked = cached?.at(-1)?.commit.parent.length === 0;\n\tif (cached && (cached.length >= depth || fullyWalked)) {\n\t\thooks?.onNote?.(`getCommitLog: cache hit ${cacheKey} (depth=${depth})`);\n\t\treturn cached.slice(0, depth);\n\t}\n\thooks?.onNote?.(`getCommitLog: cache miss ${cacheKey} (depth=${depth})`);\n\tif (hooks?.prefetch) await runStep(hooks, \"prefetch\", hooks.prefetch);\n\n\tconst log = 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 = log.map(({ oid, commit, payload }) => ({\n\t\toid,\n\t\tcommit,\n\t\tpayload: 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/**\n * List a directory at the tip of a ref. Throws GitRefNotFoundError when the\n * ref doesn't resolve and GitPathNotFoundError when `treePath` doesn't exist.\n * Memoized per head sha.\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: cache hit ${cacheKey}`);\n\t\treturn cached;\n\t}\n\thooks?.onNote?.(`getTreeFromRef: cache miss ${cacheKey}`);\n\tif (hooks?.prefetch) await runStep(hooks, \"prefetch\", hooks.prefetch);\n\n\tconst context = `${repo.gitdir}@${ref}:${treePath || \"/\"}`;\n\tconst dir = treePath\n\t\t? await wrapMissingObject(\n\t\t\t\trunStep(hooks, `findTreeEntry ${treePath}`, () =>\n\t\t\t\t\tfindTreeEntry(repo, commit.tree, treePath),\n\t\t\t\t),\n\t\t\t\tcontext,\n\t\t\t)\n\t\t: { path: \"\", type: \"tree\" as const, oid: commit.tree };\n\tif (!dir) {\n\t\tthrow new GitPathNotFoundError(\n\t\t\t`Path \"${treePath}\" does not exist at ${ref}`,\n\t\t);\n\t}\n\tconst result =\n\t\tdir.type === \"tree\"\n\t\t\t? await wrapMissingObject(\n\t\t\t\t\trunStep(hooks, `listTreeEntries ${treePath || \"/\"}`, () =>\n\t\t\t\t\t\tlistTreeEntries(repo, dir.oid, dir.path),\n\t\t\t\t\t),\n\t\t\t\t\tcontext,\n\t\t\t\t)\n\t\t\t: [];\n\thooks?.resultCache?.set(cacheKey, result);\n\treturn result;\n}\n\n/**\n * A page of commit history from a ref tip; [] when the ref doesn't exist.\n * Pages are slices of {@link getCommitLog}'s memoized walk.\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 log = await getCommitLog(\n\t\trepo,\n\t\t{ ref: options.ref, depth: limit + skip },\n\t\thooks,\n\t);\n\treturn log.slice(skip, skip + limit);\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-path history). Keys are namespaced `kind:gitdir:headSha:…`,\n * so entries self-invalidate on push (new head, new key); evict\n * {@link resultKeyPrefixes} to drop a repo's superseded entries early.\n * Values are always objects (arrays or records).\n */\nexport interface ResultCache {\n\tget<T extends object>(key: string): T | null | undefined;\n\tset(key: string, value: object): void;\n}\n\n/** Optional instrumentation 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 * Warm every pack (e.g. `GitFs.prefetchPacks`) before a cache-miss read,\n\t * so a sequential walk doesn't discover packs one round trip at a time.\n\t */\n\tprefetch?: () => Promise<void>;\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 (rename, repack).\n */\nexport function resultKeyPrefixes(gitdir: string): string[] {\n\treturn [\n\t\t`commitlog:${gitdir}:`,\n\t\t`tree:${gitdir}:`,\n\t\t`last-commits:${gitdir}:`,\n\t\t`file-history:${gitdir}:`,\n\t];\n}\n","import {\n\ttype CommitSummary,\n\tgetCommitLog,\n\tHISTORY_WALK_DEPTH,\n\tsummarizeCommit,\n} from \"./history.js\";\nimport { findTreeEntry } from \"./tree.js\";\nimport type { OpsHooks, Repo } from \"./types.js\";\nimport { runStep } from \"./types.js\";\n\nexport interface FileHistoryResult {\n\tentries: CommitSummary[];\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 * A shallow walk for a \"latest commit touching this file\" banner, which only\n * shows `entries[0]`; a full History view is 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\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: CommitSummary[] = [];\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(summarizeCommit(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 {\n\ttype CommitSummary,\n\tgetCommitLog,\n\tHISTORY_WALK_DEPTH,\n\tsummarizeCommit,\n} from \"./history.js\";\nimport { findTreeEntry, listTreeEntries } from \"./tree.js\";\nimport type { OpsHooks, Repo } from \"./types.js\";\nimport { runStep } from \"./types.js\";\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\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, CommitSummary>> {\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, CommitSummary>>(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, CommitSummary> = {};\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] = summarizeCommit(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 =\n\t\t\tsourceOid === targetOid ||\n\t\t\t(await git.isDescendent({\n\t\t\t\t...repo,\n\t\t\t\toid: sourceOid,\n\t\t\t\tancestor: targetOid,\n\t\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\t// Nothing to merge when the target already contains the source (same\n\t// commit, or source is an ancestor) — never write a no-op merge commit.\n\tif (\n\t\tsourceOid === targetOid ||\n\t\t(await git.isDescendent({ ...repo, oid: targetOid, ancestor: sourceOid }))\n\t) {\n\t\treturn { success: true, commitSha: targetOid };\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;;;ACsChB,IAAM,eAAe,oBAAI,IAAoB,CAAC,UAAU,QAAQ,QAAQ,KAAK,CAAC;AAG9E,SAAS,iBAAiB,KAA0C;AACnE,QAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,QAAM,SAAS,IAAI,YAAY,EAAE,OAAO,IAAI,SAAS,GAAG,GAAG,CAAC;AAC5D,QAAM,CAAC,MAAM,IAAI,IAAI,OAAO,MAAM,GAAG;AACrC,QAAM,UAAU,IAAI,MAAM,MAAM,CAAC;AACjC,MACC,CAAC,aAAa,IAAI,IAAsB,KACxC,OAAO,IAAI,MAAM,QAAQ,QACxB;AACD,UAAM,IAAI,MAAM,2CAA2C,MAAM,GAAG;AAAA,EACrE;AACA,SAAO,EAAE,MAA8B,QAAQ;AAChD;AAEA,SAAS,SAAS,MAAc;AAC/B,QAAM,QAAQ,oBAAI,KAAK,CAAC;AACxB,SAAO;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN;AAAA,IACA,KAAK;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,QAAQ,MAAM;AAAA,IACd,aAAa,MAAM;AAAA,IACnB,gBAAgB,MAAM;AAAA,EACvB;AACD;AASA,eAAsB,iBACrB,MACA,IACa;AACb,QAAM,OAAQ,KAAK,GAA0C;AAC7D,QAAM,UAAU,oBAAI,IAAqC;AAEzD,iBAAe,QAAuB;AACrC,QAAI,QAAQ,SAAS,EAAG;AACxB,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC7B,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE;AAAA,QAAI,OAAO,aAChC,iBAAiB,MAAM,QAAQ,QAAQ,CAAC;AAAA,MACzC;AAAA,IACD;AACA,UAAM,UAAU,MAAM,MAAM,WAAW,OAAO,CAAC;AAC/C,YAAQ,MAAM;AAAA,EACf;AAEA,QAAM,WAAsB,IAAI,MAAM,MAAM;AAAA,IAC3C,IAAI,QAAQ,UAAU,UAAU;AAC/B,cAAQ,UAAU;AAAA,QACjB,KAAK;AACJ,iBAAO,OACN,MACA,MACA,YACI;AACJ,gBACC,qBAAqB,IAAI,MAAM,QAC/B,OAAO,SAAS,UACf;AACD,sBAAQ,IAAI,MAAM,IAAI,WAAW,IAAI,CAAC;AACtC;AAAA,YACD;AACA,kBAAM,MAAM;AACZ,mBAAO,OAAO,UAAU,MAAM,MAAM,OAAO;AAAA,UAC5C;AAAA,QACD,KAAK;AACJ,iBAAO,OAAO,MAAc,YAAsB;AACjD,kBAAM,OAAO,QAAQ,IAAI,IAAI;AAC7B,gBAAI,SAAS,OAAW,QAAO,OAAO,SAAS,MAAM,OAAO;AAC5D,mBAAO;AAAA,UACR;AAAA,QACD,KAAK;AAAA,QACL,KAAK;AACJ,iBAAO,OAAO,SAAiB;AAC9B,kBAAM,OAAO,QAAQ,IAAI,IAAI;AAC7B,gBAAI,SAAS,OAAW,QAAO,SAAS,KAAK,MAAM;AACnD,mBAAO,OAAO,QAAQ,EAAE,IAAI;AAAA,UAC7B;AAAA,QACD,SAAS;AACR,gBAAM,QAAQ,QAAQ,IAAI,QAAQ,UAAU,QAAQ;AACpD,iBAAO,OAAO,UAAU,aAAa,MAAM,KAAK,MAAM,IAAI;AAAA,QAC3D;AAAA,MACD;AAAA,IACD;AAAA,EACD,CAAC;AAED,QAAM,aAAmB,EAAE,GAAG,MAAM,IAAI,EAAE,SAAS,EAAyB;AAC5E,QAAM,SAAS,MAAM,GAAG,UAAU;AAClC,QAAM,MAAM;AACZ,SAAO;AACR;;;AChJA,OAAO,SAAS;AAYhB,IAAM,WAAW,CAAC,QAAgB,SACjC,SAAS,GAAG,OAAO,QAAQ,QAAQ,EAAE,CAAC,IAAI,IAAI,KAAK;AAGpD,IAAM,aAAa,oBAAI,IAAI,CAAC,UAAU,UAAU,QAAQ,CAAC;AAUzD,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,UAAM,UAAU,OAAO,IAAI,IAAI;AAC/B,QAAI,WAAW,QAAQ,SAAS,QAAQ;AACvC,YAAM,IAAI,uBAAuB,IAAI,IAAI,8BAA8B;AAAA,IACxE;AACA,WAAO,IAAI,MAAM;AAAA,MAChB,MAAM,WAAW,WAAW,IAAI,QAAQ,IAAI,IAAI,QAAQ,OAAO;AAAA,MAC/D,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,UAAI,SAAS,MAAM,SAAS,QAAQ;AACnC,cAAM,IAAI,uBAAuB,IAAI,GAAG,8BAA8B;AAAA,MACvE;AACA,YAAM,aAAa,OAAO;AAC1B,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;AAOA,eAAsB,eACrB,MACA,SACA,UACkB;AAClB,QAAM,SAAS,MAAM,kBAAkB,MAAM,SAAS,UAAU,QAAQ;AACxE,SAAO,UAAU,IAAI,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,EAAE,CAAC;AACrD;AAGA,eAAe,kBACd,MACA,SACA,UACA,UACyB;AACzB,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,QAAM,OAAO,UAAU,KAAK,WAAW,SAAS,MAAM,GAAG,KAAK;AAC9D,QAAM,QAAQ,OAAO,IAAI,IAAI;AAC7B,MAAI,UAAU,IAAI;AACjB,QAAI,OAAO,SAAS,QAAQ;AAC3B,YAAM,IAAI,qBAAqB,iBAAiB,QAAQ,EAAE;AAAA,IAC3D;AACA,WAAO,OAAO,IAAI;AAAA,EACnB,OAAO;AACN,QAAI,OAAO,SAAS,QAAQ;AAC3B,YAAM,IAAI,qBAAqB,iBAAiB,QAAQ,EAAE;AAAA,IAC3D;AACA,UAAM,SAAS,MAAM;AAAA,MACpB;AAAA,MACA,MAAM;AAAA,MACN,SAAS,MAAM,QAAQ,CAAC;AAAA,MACxB;AAAA,IACD;AACA,QAAI,WAAW,KAAM,QAAO,OAAO,IAAI;AAAA,QAClC,QAAO,IAAI,MAAM,EAAE,GAAG,OAAO,KAAK,OAAO,CAAC;AAAA,EAChD;AACA,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,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;;;AFpKO,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;AAcA,eAAsB,kBACrB,MACA,SAckB;AAClB,uBAAqB,QAAQ,MAAM;AACnC,SAAO,iBAAiB,MAAM,CAAC,WAAW,YAAY,QAAQ,OAAO,CAAC;AACvE;AAEA,eAAe,YACd,MACA,SACkB;AAClB,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,eAAe,IAAI;AAC3D,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;AAOA,eAAsB,kBACrB,MACA,SAMkB;AAClB,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,QAAQ,QAAQ,OAAO;AACjC,QAAI,CAAC,eAAe,KAAK,IAAI,GAAG;AAC/B,YAAM,IAAI,uBAAuB,sBAAsB,KAAK,IAAI,EAAE;AAAA,IACnE;AACA,QAAI,MAAM,IAAI,KAAK,IAAI,GAAG;AACzB,YAAM,IAAI,uBAAuB,wBAAwB,KAAK,IAAI,EAAE;AAAA,IACrE;AACA,UAAM,IAAI,KAAK,IAAI;AAAA,EACpB;AACA,MAAI,MAAM,SAAS,GAAG;AACrB,UAAM,IAAI,uBAAuB,kCAAkC;AAAA,EACpE;AACA,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,eAAe,cAAc;AAC9C,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,WAAW,MAAM,QAAQ,CAAC;AAC/D,gBAAM,IAAI,KAAK,MAAM,GAAG;AAAA,QACzB,CAAC;AAAA,MACF;AACA,aAAO,WAAW,WAAW,eAAe,KAAK;AAAA,IAClD;AAAA,EACD,CAAC;AACF;AAGA,eAAsB,mBACrB,MACA,SAMkB;AAClB,MAAI,CAAC,eAAe,QAAQ,QAAQ,GAAG;AACtC,UAAM,IAAI,uBAAuB,sBAAsB,QAAQ,QAAQ,EAAE;AAAA,EAC1E;AACA,SAAO,kBAAkB,MAAM;AAAA,IAC9B,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,WAAW,OAAO,eAAe,cAAc;AAC9C,UAAI,CAAC,eAAe;AACnB,cAAM,IAAI,qBAAqB,UAAU,QAAQ,MAAM,WAAW;AAAA,MACnE;AACA,aAAO,eAAe,WAAW,eAAe,QAAQ,QAAQ;AAAA,IACjE;AAAA,EACD,CAAC;AACF;;;AGzKA,SAAS,2BAA2B;AACpC,OAAOC,UAA+B;;;ACDtC,OAAOC,UAAS;;;AC2CT,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,gBAAgB,MAAM;AAAA,IACtB,gBAAgB,MAAM;AAAA,EACvB;AACD;;;ADlDO,IAAM,qBAAqB;AA+B3B,SAAS,gBAAgB,QAAmC;AAClE,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;AAEA,IAAM,aAAa,CAAC,QAClB,KAAkC,SAAS;AAQ7C,SAAS,kBACR,SACA,SACa;AACb,SAAO,QAAQ,MAAM,CAAC,QAAiB;AACtC,QAAI,WAAW,GAAG,GAAG;AACpB,YAAM,IAAI;AAAA,QACT,gBAAgB,OAAO;AAAA,MACxB;AAAA,IACD;AACA,UAAM;AAAA,EACP,CAAC;AACF;AAGA,eAAe,cAAc,MAAY,KAA8B;AACtE,MAAI;AACH,WAAO,MAAMC,KAAI,WAAW,EAAE,GAAG,MAAM,KAAK,iBAAiB,GAAG,EAAE,CAAC;AAAA,EACpE,SAAS,KAAK;AACb,QAAI,WAAW,GAAG;AACjB,YAAM,IAAI,oBAAoB,OAAO,GAAG,iBAAiB;AAC1D,UAAM;AAAA,EACP;AACD;AAGA,eAAsB,cAAc,MAAY,KAAa;AAC5D,QAAM,MAAM,MAAM,cAAc,MAAM,GAAG;AACzC,QAAM,EAAE,OAAO,IAAI,MAAM;AAAA,IACxBA,KAAI,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC;AAAA,IAC/B,GAAG,KAAK,MAAM,WAAW,GAAG;AAAA,EAC7B;AACA,SAAO,EAAE,KAAK,OAAO;AACtB;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;AAGtB,MAAI,OAAO,SAAU,OAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AACpE,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;AACA,MAAI,OAAO,SAAS,QAAQ;AAC3B,UAAM,IAAI,qBAAqB,mBAAmB,QAAQ,EAAE;AAAA,EAC7D;AACA,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,eAAsB,aACrB,MACA,SACA,OACwB;AACxB,QAAM,EAAE,IAAI,IAAI;AAChB,QAAM,QAAQ,QAAQ,SAAS;AAC/B,MAAI,UAAU,QAAQ;AACtB,MAAI,YAAY,QAAW;AAC1B,QAAI;AACH,gBAAU,MAAM,cAAc,MAAM,GAAG;AAAA,IACxC,SAAS,KAAK;AACb,UAAI,eAAe,oBAAqB,QAAO,CAAC;AAChD,YAAM;AAAA,IACP;AAAA,EACD;AAEA,QAAM,WAAW,aAAa,KAAK,MAAM,IAAI,OAAO;AACpD,QAAM,SAAS,OAAO,aAAa,IAAkB,QAAQ;AAC7D,QAAM,cAAc,QAAQ,GAAG,EAAE,GAAG,OAAO,OAAO,WAAW;AAC7D,MAAI,WAAW,OAAO,UAAU,SAAS,cAAc;AACtD,WAAO,SAAS,2BAA2B,QAAQ,WAAW,KAAK,GAAG;AACtE,WAAO,OAAO,MAAM,GAAG,KAAK;AAAA,EAC7B;AACA,SAAO,SAAS,4BAA4B,QAAQ,WAAW,KAAK,GAAG;AACvE,MAAI,OAAO,SAAU,OAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAEpE,QAAM,MAAM,MAAM;AAAA,IACjB;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,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ,QAAQ,OAAO;AAAA,IACrD;AAAA,IACA;AAAA,IACA,SAAS,WAAW;AAAA,EACrB,EAAE;AACF,MAAI,CAAC,UAAU,OAAO,SAAS,OAAO,QAAQ;AAC7C,WAAO,aAAa,IAAI,UAAU,MAAM;AAAA,EACzC;AACA,SAAO;AACR;AAOA,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,6BAA6B,QAAQ,EAAE;AACvD,WAAO;AAAA,EACR;AACA,SAAO,SAAS,8BAA8B,QAAQ,EAAE;AACxD,MAAI,OAAO,SAAU,OAAM,QAAQ,OAAO,YAAY,MAAM,QAAQ;AAEpE,QAAM,UAAU,GAAG,KAAK,MAAM,IAAI,GAAG,IAAI,YAAY,GAAG;AACxD,QAAM,MAAM,WACT,MAAM;AAAA,IACN;AAAA,MAAQ;AAAA,MAAO,iBAAiB,QAAQ;AAAA,MAAI,MAC3C,cAAc,MAAM,OAAO,MAAM,QAAQ;AAAA,IAC1C;AAAA,IACA;AAAA,EACD,IACC,EAAE,MAAM,IAAI,MAAM,QAAiB,KAAK,OAAO,KAAK;AACvD,MAAI,CAAC,KAAK;AACT,UAAM,IAAI;AAAA,MACT,SAAS,QAAQ,uBAAuB,GAAG;AAAA,IAC5C;AAAA,EACD;AACA,QAAM,SACL,IAAI,SAAS,SACV,MAAM;AAAA,IACN;AAAA,MAAQ;AAAA,MAAO,mBAAmB,YAAY,GAAG;AAAA,MAAI,MACpD,gBAAgB,MAAM,IAAI,KAAK,IAAI,IAAI;AAAA,IACxC;AAAA,IACA;AAAA,EACD,IACC,CAAC;AACL,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,MAAM,MAAM;AAAA,IACjB;AAAA,IACA,EAAE,KAAK,QAAQ,KAAK,OAAO,QAAQ,KAAK;AAAA,IACxC;AAAA,EACD;AACA,SAAO,IAAI,MAAM,MAAM,OAAO,KAAK;AACpC;;;ADjQO,IAAM,sBAAsB,OAAO;AA6B1C,SAAS,kBAAkB,SAAyB;AACnD,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,MAAM,GAAG,EAAE,MAAM,GAAI,OAAM,IAAI;AACnC,SAAO,MAAM;AACd;AAEA,SAAS,aACR,MACA,QACA,OACS;AACT,QAAM,OAAO;AAAA,IACZ,SAAS,KAAK,IAAI,KAAK;AAAA,IACvB,QAAQ,KAAK,IAAI,KAAK;AAAA,IACtB,QAAQ,QAAQ;AAAA,IAChB,OAAO,QAAQ;AAAA,IACf;AAAA,IACA;AAAA,IACA,EAAE,SAAS,EAAE;AAAA,EACd,EAAE,QAAQ,SAAS,EAAE;AACrB,SAAO,gBAAgB,IAAI,MAAM,IAAI;AAAA,EAAK,IAAI;AAC/C;AAGA,SAAS,cACR,MACA,QACA,OACW;AACX,QAAM,OACL,QAAQ,YAAY,OAAO,WACxB,WACA,KAAK,IAAI,QAAQ,MAAM,UAAU,GAAG,OAAO,MAAM,UAAU,CAAC,IAC5D,sBACC,cACA;AACL,QAAM,SAAS,SAAS;AACxB,SAAO;AAAA,IACN;AAAA,IACA,QAAQ,CAAC,SAAS,UAAU,CAAC,QAAQ,YAAY;AAAA,IACjD;AAAA,IACA,WAAW,UAAU,QAAQ,kBAAkB,MAAM,IAAI,IAAI;AAAA,IAC7D,WAAW,UAAU,SAAS,kBAAkB,OAAO,IAAI,IAAI;AAAA,IAC/D,OAAO,SAAS,aAAa,MAAM,QAAQ,KAAK,IAAI;AAAA,IACpD,SAAS,QAAQ,MAAM;AAAA,IACvB,SAAS,OAAO,MAAM;AAAA,EACvB;AACD;AAMA,eAAe,UACd,MACA,YACA,YACsB;AACtB,QAAM,WAAW,OAAO,UAA8B;AACrD,QAAI,CAAC,SAAU,MAAM,MAAM,KAAK,MAAO,OAAQ,QAAO;AACtD,UAAM,EAAE,KAAK,IAAI,MAAMC,KAAI,SAAS,EAAE,GAAG,MAAM,KAAK,MAAM,MAAM,IAAI,EAAE,CAAC;AACvE,WAAO,gBAAgB,IAAI;AAAA,EAC5B;AACA,QAAM,QAAQ,aACX,CAACA,KAAI,KAAK,EAAE,KAAK,WAAW,CAAC,GAAGA,KAAI,KAAK,EAAE,KAAK,WAAW,CAAC,CAAC,IAC7D,CAACA,KAAI,KAAK,EAAE,KAAK,WAAW,CAAC,CAAC;AACjC,QAAM,UAAoC,MAAMA,KAAI,KAAK;AAAA,IACxD,GAAG;AAAA,IACH;AAAA,IACA,KAAK,OAAO,UAAU,YAAY;AACjC,YAAM,CAAC,UAAU,QAAQ,IAAI,aAC1B,CAAC,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,KAAK,IAAI,IACvC,CAAC,MAAM,QAAQ,CAAC,KAAK,IAAI;AAC5B,YAAM,CAAC,SAAS,OAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,QAC5C,UAAU,KAAK;AAAA,QACf,UAAU,KAAK;AAAA,MAChB,CAAC;AAED,UAAI,YAAY,UAAU,YAAY,OAAQ,QAAO;AACrD,UAAI,YAAY,YAAY,YAAY,SAAS;AAChD,cAAM,CAAC,QAAQ,MAAM,IAAI,MAAM,QAAQ,IAAI;AAAA,UAC1C,SAAS,IAAI;AAAA,UACb,SAAS,IAAI;AAAA,QACd,CAAC;AACD,YAAI,WAAW,OAAQ,QAAO;AAAA,MAC/B;AACA,YAAM,CAAC,QAAQ,KAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,QACzC,SAAS,QAAQ;AAAA,QACjB,SAAS,QAAQ;AAAA,MAClB,CAAC;AACD,aAAO,UAAU,QACd,cAAc,UAAU,QAAQ,KAAK,IACrC;AAAA,IACJ;AAAA,EACD,CAAC;AACD,QAAM,SAAS,WAAW,CAAC,GAAG,OAAO,CAAC,SAA2B,CAAC,CAAC,IAAI;AACvE,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;AAGA,eAAsB,cACrB,MACA,WACsB;AACtB,QAAM,EAAE,OAAO,IAAI,MAAM,UAAU,MAAM,SAAS;AAClD,QAAM,SAAS,OAAO,OAAO,CAAC;AAC9B,QAAM,aAAa,UACf,MAAM,UAAU,MAAM,MAAM,GAAG,OAAO,OACvC;AACH,SAAO,UAAU,MAAM,YAAY,OAAO,IAAI;AAC/C;AAQA,eAAsB,mBACrB,MACA,SACA,YACsB;AACtB,QAAM,CAAC,MAAM,OAAO,IAAI,MAAM,QAAQ,IAAI;AAAA,IACzC,cAAc,MAAM,OAAO;AAAA,IAC3B,cAAc,MAAM,UAAU;AAAA,EAC/B,CAAC;AACD,QAAM,CAAC,SAAS,IAAI,MAAMA,KAAI,cAAc;AAAA,IAC3C,GAAG;AAAA,IACH,MAAM,CAAC,KAAK,KAAK,QAAQ,GAAG;AAAA,EAC7B,CAAC;AACD,QAAM,WACL,cAAc,SACX,OACA,cAAc,KAAK,MAClB,KAAK,OAAO,QACX,MAAM,UAAU,MAAM,SAAS,GAAG,OAAO;AAC/C,SAAO,UAAU,MAAM,UAAU,QAAQ,OAAO,IAAI;AACrD;;;AG5JO,IAAM,oBAAoB;AAGjC,IAAM,kBAAkB;AAOxB,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,UAA2B,CAAC;AAClC,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,gBAAgB,MAAM,CAAC;AACpC,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;;;AC1GA,IAAMC,mBAAkB;AAYxB,eAAsB,sBACrB,MACA,SACA,OACyC;AACzC,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,QAAQ,QAAQ,SAAS;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,IAAmC,QAAQ;AAChE,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,SAAwC,CAAC;AAE/C,MAAI,gBAAgB;AACpB,MAAI,kBAAkB;AACtB,QAAM,YAAY,YAAY,IAAI;AAElC,QAAO,UACF,cAAc,GAClB,cAAc,QAAQ,UAAU,UAAU,OAAO,GACjD,eAAeA,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,gBAAgB,MAAM;AAAA,QACtC;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;;;AC5KA,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,eACL,cAAc,aACb,MAAMA,KAAI,aAAa;AAAA,MACvB,GAAG;AAAA,MACH,KAAK;AAAA,MACL,UAAU;AAAA,IACX,CAAC;AAEF,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;AAGD,MACC,cAAc,aACb,MAAMA,KAAI,aAAa,EAAE,GAAG,MAAM,KAAK,WAAW,UAAU,UAAU,CAAC,GACvE;AACD,WAAO,EAAE,SAAS,MAAM,WAAW,UAAU;AAAA,EAC9C;AACA,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","PREFETCH_WINDOW","git","git"]}
package/dist/types/errors.d.ts CHANGED
@@ -10,7 +10,6 @@ export declare class FsError extends Error {
10
10
  }
11
11
  export declare const enoent: (syscall: string, path: string) => FsError;
12
12
  export declare const enotdir: (syscall: string, path: string) => FsError;
13
- export declare const eisdir: (syscall: string, path: string) => FsError;
14
13
  export declare const enotempty: (syscall: string, path: string) => FsError;
15
14
  export declare const einval: (syscall: string, path: string) => FsError;
16
15
  export declare const eperm: (syscall: string, path: string) => FsError;
package/dist/types/http/index.d.ts CHANGED
@@ -1,7 +1,7 @@
1
1
  export { type GitService, handleInfoRefs, type InfoRefsOptions, listAllRefs, } from "./info-refs.js";
2
2
  export { FLUSH, parsePktLines, pktLine, pktLineBuffer, sideBandPackfile, } from "./pkt-line.js";
3
3
  export { collectReachableOids, type ReachabilityResult, } from "./reachability.js";
4
- export { type ApplyReceivePackOptions, applyReceivePack, applyRefUpdates, ensureRepoInitialized, indexIncomingPack, parseReceivePackBody, type RefUpdateCommand, type RefUpdateResult, receivePackResponse, } from "./receive-pack.js";
4
+ export { type ApplyReceivePackOptions, type ApplyReceivePackResult, applyReceivePack, applyRefUpdates, ensureRepoInitialized, indexIncomingPack, type ParsedReceivePack, parseReceivePackBody, type RefUpdateCommand, type RefUpdateResult, receivePackResponse, } from "./receive-pack.js";
5
5
  export { REPACK_PACK_COUNT_THRESHOLD, type RepackOptions, repackRepository, } from "./repack.js";
6
6
  export { type GitHttpResult, type HttpHooks, type RawFsPromises, rawFs, } from "./types.js";
7
- export { handleUploadPack, type UploadPackOptions } from "./upload-pack.js";
7
+ export { handleUploadPack, parseUploadPackRequest, type UploadPackOptions, } from "./upload-pack.js";
package/dist/types/http/pack-reuse.d.ts CHANGED
@@ -12,7 +12,7 @@
12
12
  */
13
13
  import type { Repo } from "../ops/types.js";
14
14
  /** An object's position in a pack, as listed by its `.idx`. */
15
- export interface PackIndexEntry {
15
+ interface PackIndexEntry {
16
16
  readonly oid: string;
17
17
  readonly offset: number;
18
18
  }
@@ -24,3 +24,4 @@ export declare function readPackIndex(idx: Uint8Array): PackIndexEntry[] | null;
24
24
  * loose object — so the caller should build the pack another way.
25
25
  */
26
26
  export declare function buildPackFromExistingPacks(repo: Repo, oids: readonly string[]): Promise<Uint8Array | null>;
27
+ export {};
package/dist/types/ops/diff.d.ts CHANGED
@@ -3,7 +3,7 @@ import type { Repo } from "./types.js";
3
3
  export declare const MAX_DIFF_TEXT_BYTES: number;
4
4
  export interface DiffFile {
5
5
  path: string;
6
- status: "added" | "modified" | "deleted" | "renamed";
6
+ status: "added" | "modified" | "deleted";
7
7
  /**
8
8
  * "text" has a unified `patch`; "binary" (a NUL byte on either side) and
9
9
  * "too-large" (text over MAX_DIFF_TEXT_BYTES) don't — fetch the sides by
@@ -13,7 +13,6 @@ export interface DiffFile {
13
13
  additions: number;
14
14
  deletions: number;
15
15
  patch: string;
16
- oldPath?: string;
17
16
  /** Byte size before the change; absent for an added file. */
18
17
  oldSize?: number;
19
18
  /** Byte size after the change; absent for a deleted file. */
@@ -27,5 +26,10 @@ export interface DiffResult {
27
26
  }
28
27
  /** The diff a single commit introduced (against its first parent). */
29
28
  export declare function getCommitDiff(repo: Repo, commitSha: string): Promise<DiffResult>;
30
- /** The diff between two refs (base -> compare). */
29
+ /**
30
+ * What `compareRef` changed since it diverged from `baseRef` — a pull
31
+ * request's diff (git's three-dot `base...compare`): compared against their
32
+ * merge base, so commits that landed on `baseRef` since the branch point
33
+ * don't show up as reverted. Throws GitRefNotFoundError for a missing ref.
34
+ */
31
35
  export declare function getDiffBetweenRefs(repo: Repo, baseRef: string, compareRef: string): Promise<DiffResult>;
package/dist/types/ops/file-history.d.ts CHANGED
@@ -1,13 +1,7 @@
1
+ import { type CommitSummary } from "./history.js";
1
2
  import type { OpsHooks, Repo } from "./types.js";
2
- export interface FileHistoryEntry {
3
- sha: string;
4
- message: string;
5
- authorName: string;
6
- authorEmail: string;
7
- createdAt: string;
8
- }
9
3
  export interface FileHistoryResult {
10
- entries: FileHistoryEntry[];
4
+ entries: CommitSummary[];
11
5
  /**
12
6
  * True when the walk hit its depth budget (or the requested `limit`)
13
7
  * before exhausting the branch's full commit chain — there may be older
@@ -16,16 +10,8 @@ export interface FileHistoryResult {
16
10
  truncated: boolean;
17
11
  }
18
12
  /**
19
- * Default walk bound for a caller that actually wants deep history (a file's
20
- * "History" tab). Walking the full chain is round-trip-bound on object
21
- * storage, so cap how far back a single request will look.
22
- */
23
- export declare const HISTORY_WALK_DEPTH = 400;
24
- /**
25
- * Much shallower default for a "latest commit touching this file" banner that
26
- * only displays `entries[0]` — trades "always finds the true last-touching
27
- * commit" for "finds it if it's reasonably recent", the right call for a
28
- * banner with a full History view a click away.
13
+ * A shallow walk for a "latest commit touching this file" banner, which only
14
+ * shows `entries[0]`; a full History view is a click away.
29
15
  */
30
16
  export declare const BANNER_WALK_DEPTH = 60;
31
17
  /**
package/dist/types/ops/history.d.ts CHANGED
@@ -1,36 +1,35 @@
1
1
  import { type TreeEntry } from "./tree.js";
2
2
  import { type OpsHooks, type Repo } from "./types.js";
3
+ /** How far back history walks look by default (commit count). */
4
+ export declare const HISTORY_WALK_DEPTH = 400;
5
+ export interface GitIdentity {
6
+ name: string;
7
+ email: string;
8
+ timestamp: number;
9
+ timezoneOffset: number;
10
+ }
3
11
  export interface CommitInfo {
4
12
  oid: string;
5
13
  commit: {
6
14
  message: string;
7
15
  tree: string;
8
16
  parent: string[];
9
- author: {
10
- name: string;
11
- email: string;
12
- timestamp: number;
13
- timezoneOffset: number;
14
- };
15
- committer: {
16
- name: string;
17
- email: string;
18
- timestamp: number;
19
- timezoneOffset: number;
20
- };
17
+ author: GitIdentity;
18
+ committer: GitIdentity;
21
19
  };
22
20
  payload: string;
23
21
  }
24
- /**
25
- * Resolve a branch name / full ref / sha to its commit. The ref not
26
- * resolving (unborn branch, genuinely empty repo) and the ref resolving but
27
- * its commit object being unreadable (storage inconsistency — see
28
- * `wrapMissingObject` above) are different failures with different meanings,
29
- * so only the first is left as a raw isomorphic-git NotFoundError for
30
- * callers to treat as "empty"; the second is wrapped into
31
- * GitObjectNotFoundError specifically so it can't be mistaken for the first
32
- * by an `isNotFound`-style check downstream (see getTreeFromRef/getCommitLog).
33
- */
22
+ /** The display summary of a commit (history lists, "last commit" columns). */
23
+ export interface CommitSummary {
24
+ sha: string;
25
+ message: string;
26
+ authorName: string;
27
+ authorEmail: string;
28
+ /** ISO 8601 author date. */
29
+ createdAt: string;
30
+ }
31
+ export declare function summarizeCommit(commit: CommitInfo): CommitSummary;
32
+ /** Resolve a branch name / full ref / sha to its commit. */
34
33
  export declare function resolveCommit(repo: Repo, ref: string): Promise<{
35
34
  oid: string;
36
35
  commit: import("isomorphic-git").CommitObject;
@@ -44,40 +43,28 @@ export declare function getCommit(repo: Repo, sha: string): Promise<CommitInfo>;
44
43
  export interface CommitLogOptions {
45
44
  ref: string;
46
45
  depth?: number;
47
- /**
48
- * Pass the head sha when the caller already resolved `ref` — resolveRef
49
- * tries several candidate paths in sequence and misses the first few every
50
- * time for a normal branch name, which is pure waste when the sha is known.
51
- */
46
+ /** The ref's commit, when the caller already resolved it (saves a lookup). */
52
47
  knownHeadSha?: string;
53
48
  }
54
49
  /**
55
- * The commit chain from a ref, newest first. Walking is inherently sequential
56
- * (each commit's oid is only discoverable by reading its child first) and
57
- * network-round-trip-bound against object storage, so the deepest walk seen
58
- * per head is memoized in `hooks.resultCache` and sliced for shallower or
59
- * repeated requests — don't bypass this by calling `git.log` directly.
50
+ * The commit chain from a ref, newest first; [] when the ref doesn't exist.
51
+ * Walking is sequential and round-trip-bound on object storage, so the
52
+ * deepest walk seen per head is memoized in `hooks.resultCache` and sliced
53
+ * for shallower requests.
60
54
  */
61
55
  export declare function getCommitLog(repo: Repo, options: CommitLogOptions, hooks?: OpsHooks): Promise<CommitInfo[]>;
62
- /** A file at a ref, decoded for display: utf8 text or base64 when binary. */
63
- export declare function getFileFromRef(repo: Repo, filePath: string, ref: string, hooks?: OpsHooks): Promise<{
64
- content: string;
65
- size: number;
66
- isBinary: boolean;
67
- }>;
68
56
  /**
69
57
  * List a directory at the tip of a ref. Throws GitRefNotFoundError when the
70
- * ref doesn't resolve (including an empty repo's unborn branch) and
71
- * GitPathNotFoundError when `treePath` doesn't exist. Results are memoized per
72
- * head sha (auto-invalidates on push).
58
+ * ref doesn't resolve and GitPathNotFoundError when `treePath` doesn't exist.
59
+ * Memoized per head sha.
73
60
  */
74
61
  export declare function getTreeFromRef(repo: Repo, options: {
75
62
  ref: string;
76
63
  treePath?: string;
77
64
  }, hooks?: OpsHooks): Promise<TreeEntry[]>;
78
65
  /**
79
- * A page of commit history from a branch tip. Memoized per head sha; builds
80
- * on {@link getCommitLog}'s walk cache for the underlying chain.
66
+ * A page of commit history from a ref tip; [] when the ref doesn't exist.
67
+ * Pages are slices of {@link getCommitLog}'s memoized walk.
81
68
  */
82
69
  export declare function getCommitHistory(repo: Repo, options: {
83
70
  ref: string;
package/dist/types/ops/index.d.ts CHANGED
@@ -1,9 +1,9 @@
1
1
  export { assertBranchExists, assertSafeBranchName, type Branch, createBranchFrom, deleteBranchByName, listBranches, resolveLooseRefFast, } from "./branch.js";
2
2
  export { authorNow, type CommitAuthor, commitFilesToBare, deleteFileFromBare, writeCommitToBare, } from "./commit.js";
3
3
  export { type DiffFile, type DiffResult, getCommitDiff, getDiffBetweenRefs, MAX_DIFF_TEXT_BYTES, } from "./diff.js";
4
- export { BANNER_WALK_DEPTH, type FileHistoryEntry, type FileHistoryResult, getFileHistory, HISTORY_WALK_DEPTH, } from "./file-history.js";
5
- export { type CommitInfo, type CommitLogOptions, getBlob, getCommit, getCommitHistory, getCommitLog, getFileContent, getFileFromRef, getTreeFromRef, resolveCommit, } from "./history.js";
6
- export { getLastCommitsForTree, type LastCommitInfo, } from "./last-commit.js";
4
+ export { BANNER_WALK_DEPTH, type FileHistoryResult, getFileHistory, } from "./file-history.js";
5
+ export { type CommitInfo, type CommitLogOptions, type CommitSummary, type GitIdentity, getBlob, getCommit, getCommitHistory, getCommitLog, getFileContent, getTreeFromRef, HISTORY_WALK_DEPTH, resolveCommit, summarizeCommit, } from "./history.js";
6
+ export { getLastCommitsForTree } from "./last-commit.js";
7
7
  export { analyzeMerge, fastForwardMerge, type MergeAnalysis } from "./merge.js";
8
8
  export { withPackedWrites } from "./packed-writes.js";
9
9
  export { deleteFromTree, findTreeEntry, listTreeEntries, type TreeEntry, upsertTree, } from "./tree.js";
package/dist/types/ops/last-commit.d.ts CHANGED
@@ -1,11 +1,5 @@
1
+ import { type CommitSummary } from "./history.js";
1
2
  import type { OpsHooks, Repo } from "./types.js";
2
- export interface LastCommitInfo {
3
- sha: string;
4
- message: string;
5
- authorName: string;
6
- authorEmail: string;
7
- createdAt: string;
8
- }
9
3
  /**
10
4
  * For each direct child of `treePath` (at the tip of `ref`), find the most
11
5
  * recent commit that changed it — the tree view's "last commit" column. Walks
@@ -20,4 +14,4 @@ export declare function getLastCommitsForTree(repo: Repo, options: {
20
14
  ref: string;
21
15
  treePath?: string;
22
16
  depth?: number;
23
- }, hooks?: OpsHooks): Promise<Record<string, LastCommitInfo>>;
17
+ }, hooks?: OpsHooks): Promise<Record<string, CommitSummary>>;