@oharness/server 0.1.0

package/dist/changes.d.ts

@@ -0,0 +1,54 @@
+import type { HookRegistry } from "@oharness/engine/agent/hooks.ts";
+/**
+ * What the agent has actually done to the working tree this session.
+ *
+ * A coding agent's deliverable is the diff, not the transcript, so the review
+ * pane needs the real before and after of every file it touched — not a
+ * reconstruction from tool arguments. `write` carries only the new content and
+ * `edit` carries only the fragment it replaced, so neither can produce a
+ * file-level diff on its own.
+ *
+ * The before image is therefore read from disk immediately before the tool
+ * runs and the after image immediately after. That is the only point where
+ * both are true, and it is honest about deletions, creations and edits alike.
+ */
+export interface FileChange {
+    path: string;
+    /** Absent means the file did not exist: the change created it. */
+    before?: string;
+    /** Absent means the file no longer exists: the change deleted it. */
+    after?: string;
+    added: number;
+    removed: number;
+    /** Set when the file is too large or not text; the pane shows a note. */
+    note?: string;
+}
+export declare class ChangeLedger {
+    private readonly changes;
+    /** Files whose "before" is already captured, so later edits do not overwrite it. */
+    private readonly snapshotted;
+    /**
+     * Files whose mutation actually completed.
+     *
+     * Without this, a tool that failed after the pre-snapshot leaves a `before`
+     * with no `after` — which reads as a deletion, sending the reviewer to look
+     * for a change that never happened.
+     */
+    private readonly settled;
+    private readonly cwd;
+    constructor(cwd: string);
+    /**
+     * Snapshot before and after every file-mutating tool call.
+     *
+     * Registered as hooks rather than derived from the event stream because a
+     * hook runs inside the tool's execution window; an event consumer sees
+     * `tool_end` only after the write has landed, by which time the original
+     * content is gone.
+     */
+    attach(hooks: HookRegistry): void;
+    list(): FileChange[];
+    clear(): void;
+    private entryFor;
+    private resolve;
+    private readText;
+}

package/dist/changes.js

@@ -0,0 +1,154 @@
+import { readFile } from "node:fs/promises";
+import path from "node:path";
+/** Files larger than this are recorded as changed but not diffed. */
+const MAX_DIFF_BYTES = 512 * 1024;
+const WATCHED = new Set(["write", "edit"]);
+export class ChangeLedger {
+    changes = new Map();
+    /** Files whose "before" is already captured, so later edits do not overwrite it. */
+    snapshotted = new Set();
+    /**
+     * Files whose mutation actually completed.
+     *
+     * Without this, a tool that failed after the pre-snapshot leaves a `before`
+     * with no `after` — which reads as a deletion, sending the reviewer to look
+     * for a change that never happened.
+     */
+    settled = new Set();
+    cwd;
+    constructor(cwd) {
+        this.cwd = cwd;
+    }
+    /**
+     * Snapshot before and after every file-mutating tool call.
+     *
+     * Registered as hooks rather than derived from the event stream because a
+     * hook runs inside the tool's execution window; an event consumer sees
+     * `tool_end` only after the write has landed, by which time the original
+     * content is gone.
+     */
+    attach(hooks) {
+        hooks.on("PreToolUse", async (payload) => {
+            if (payload.event !== "PreToolUse" || !WATCHED.has(payload.toolName))
+                return;
+            const file = this.resolve(payload.toolInput);
+            if (!file)
+                return;
+            const entry = this.entryFor(file);
+            // Only the first snapshot is the true "before": later edits to the same
+            // file in one session are steps within one change, not separate ones.
+            // The flag rather than `before === undefined`, because undefined is a
+            // meaningful value here — it means the file did not exist.
+            if (!this.snapshotted.has(entry.path)) {
+                this.snapshotted.add(entry.path);
+                const read = await this.readText(file);
+                if (read.note)
+                    entry.note = read.note;
+                else
+                    entry.before = read.text;
+            }
+        });
+        hooks.on("PostToolUse", async (payload) => {
+            if (payload.event !== "PostToolUse" || !WATCHED.has(payload.toolName))
+                return;
+            const file = this.resolve(payload.toolInput);
+            if (!file)
+                return;
+            // A failed call leaves the file as it was; recording an "after" here
+            // would show a change that did not happen.
+            if (payload.result.isError)
+                return;
+            const entry = this.entryFor(file);
+            const read = await this.readText(file);
+            if (read.note)
+                entry.note = read.note;
+            else
+                entry.after = read.text;
+            // Only a completed mutation counts as a change to review.
+            this.settled.add(entry.path);
+            count(entry);
+        });
+    }
+    list() {
+        return [...this.changes.values()]
+            .filter((entry) => this.settled.has(entry.path))
+            .filter((entry) => entry.before !== entry.after || entry.note)
+            .sort((a, b) => a.path.localeCompare(b.path));
+    }
+    clear() {
+        this.changes.clear();
+        this.snapshotted.clear();
+        this.settled.clear();
+    }
+    entryFor(file) {
+        const relative = path.relative(this.cwd, file) || file;
+        let entry = this.changes.get(relative);
+        if (!entry) {
+            entry = { path: relative, added: 0, removed: 0 };
+            this.changes.set(relative, entry);
+        }
+        return entry;
+    }
+    resolve(input) {
+        const target = input?.path;
+        return typeof target === "string" ? path.resolve(this.cwd, target) : undefined;
+    }
+    async readText(file) {
+        try {
+            const buffer = await readFile(file);
+            if (buffer.byteLength > MAX_DIFF_BYTES) {
+                return { note: `${(buffer.byteLength / 1024).toFixed(0)}KB — too large to diff` };
+            }
+            // A NUL byte in the first block is the usual signal for binary content,
+            // and rendering one into the browser produces noise, not a diff.
+            if (buffer.subarray(0, 8000).includes(0))
+                return { note: "binary" };
+            return { text: buffer.toString("utf8") };
+        }
+        catch {
+            // Missing is a real state: it means created (as before) or deleted (as
+            // after), and both should show as such rather than as an error.
+            return { text: undefined };
+        }
+    }
+}
+/**
+ * Split into lines the way a diff tool counts them.
+ *
+ * A trailing newline terminates the last line rather than starting an empty
+ * one, so a plain `split` reports one line more than `git diff --stat` does
+ * for every well-formed text file.
+ */
+function lines(text) {
+    if (text === "")
+        return [];
+    return text.replace(/\n$/, "").split("\n");
+}
+/** Line counts, via the same subsequence walk the browser uses to draw. */
+function count(entry) {
+    if (entry.note)
+        return;
+    const a = lines(entry.before ?? "");
+    const b = lines(entry.after ?? "");
+    if (entry.before === undefined) {
+        entry.added = b.length;
+        entry.removed = 0;
+        return;
+    }
+    if (entry.after === undefined) {
+        entry.added = 0;
+        entry.removed = a.length;
+        return;
+    }
+    const table = Array.from({ length: a.length + 1 }, () => new Array(b.length + 1).fill(0));
+    for (let i = a.length - 1; i >= 0; i--) {
+        for (let j = b.length - 1; j >= 0; j--) {
+            table[i][j] =
+                a[i] === b[j] ? table[i + 1][j + 1] + 1 : Math.max(table[i + 1][j], table[i][j + 1]);
+        }
+    }
+    const common = table[0][0];
+    entry.added = b.length - common;
+    entry.removed = a.length - common;
+}
+//# sourceMappingURL=changes.js.map

package/dist/changes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"changes.js","sourceRoot":"","sources":["../src/changes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,IAAI,MAAM,WAAW,CAAC;AA6B7B,qEAAqE;AACrE,MAAM,cAAc,GAAG,GAAG,GAAG,IAAI,CAAC;AAElC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;AAE3C,MAAM,OAAO,YAAY;IACN,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IACzD,oFAAoF;IACnE,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACjD;;;;;;OAMG;IACc,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5B,GAAG,CAAS;IAE7B,YAAY,GAAW;QACrB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,KAAmB;QACxB,KAAK,CAAC,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;YACvC,IAAI,OAAO,CAAC,KAAK,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC;gBAAE,OAAO;YAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI;gBAAE,OAAO;YAElB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAClC,wEAAwE;YACxE,sEAAsE;YACtE,sEAAsE;YACtE,2DAA2D;YAC3D,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACvC,IAAI,IAAI,CAAC,IAAI;oBAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;;oBACjC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;YAChC,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,EAAE,CAAC,aAAa,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;YACxC,IAAI,OAAO,CAAC,KAAK,KAAK,aAAa,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC;gBAAE,OAAO;YAC9E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI;gBAAE,OAAO;YAClB,qEAAqE;YACrE,2CAA2C;YAC3C,IAAI,OAAO,CAAC,MAAM,CAAC,OAAO;gBAAE,OAAO;YAEnC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI;gBAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;;gBACjC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;YAC7B,0DAA0D;YAC1D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC7B,KAAK,CAAC,KAAK,CAAC,CAAC;QACf,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;aAC9B,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;aAC/C,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC;aAC7D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAEO,QAAQ,CAAC,IAAY;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC;QACvD,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,OAAO,CAAC,KAAc;QAC5B,MAAM,MAAM,GAAI,KAAmC,EAAE,IAAI,CAAC;QAC1D,OAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjF,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,IAAY;QACjC,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,MAAM,CAAC,UAAU,GAAG,cAAc,EAAE,CAAC;gBACvC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,wBAAwB,EAAE,CAAC;YACpF,CAAC;YACD,wEAAwE;YACxE,iEAAiE;YACjE,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;YACpE,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3C,CAAC;QAAC,MAAM,CAAC;YACP,uEAAuE;YACvE,gEAAgE;YAChE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAC7B,CAAC;IACH,CAAC;CACF;AAED;;;;;;GAMG;AACH,SAAS,KAAK,CAAC,IAAY;IACzB,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED,2EAA2E;AAC3E,SAAS,KAAK,CAAC,KAAiB;IAC9B,IAAI,KAAK,CAAC,IAAI;QAAE,OAAO;IACvB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;IACnC,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC/B,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;QACvB,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC;QAClB,OAAO;IACT,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC9B,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC;QACzB,OAAO;IACT,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBACV,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;IAC7B,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;IAChC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;AACpC,CAAC"}

package/dist/files.d.ts

@@ -0,0 +1,48 @@
+/**
+ * The project tree, as the composer needs to see it.
+ *
+ * Two questions, and only two: what is in this folder, and which paths look
+ * like what someone just typed. Both answer in paths relative to the project
+ * root — the page never learns where on the disk the project lives, and a
+ * relative path is also what the agent's own tools take.
+ *
+ * This is deliberately not a file reader. Picking a file in the menu references
+ * it; reading it is still the agent's job, through the tools the user can see
+ * it using.
+ */
+export interface FileEntry {
+    /** Relative to the project root, with forward slashes. */
+    path: string;
+    name: string;
+    dir: boolean;
+}
+/**
+ * A path under `root`, said the short way.
+ *
+ * Everything else comes back as it was: a file chosen from the desktop is not
+ * in the project, and a relative path climbing out of it with ../../ is
+ * neither shorter nor clearer than where the file actually is.
+ */
+export declare function within(root: string, target: string): string;
+/**
+ * One directory's children, for browsing into a project.
+ *
+ * A directory that cannot be read lists as empty rather than failing: the
+ * menu still shows the way back out of it.
+ */
+export declare function browseFiles(root: string, rel?: string): Promise<{
+    dir: string;
+    parent?: string;
+    entries: FileEntry[];
+}>;
+/**
+ * Paths that fuzzily match `query`, best first.
+ *
+ * Breadth-first, so that when the budget runs out on a large repository it has
+ * been spent near the top of the tree — where the file someone is naming from
+ * memory almost always is — rather than deep inside one branch of it.
+ */
+export declare function searchFiles(root: string, query: string, limit?: number): Promise<{
+    entries: FileEntry[];
+    truncated: boolean;
+}>;

package/dist/files.js

@@ -0,0 +1,168 @@
+import { readdir } from "node:fs/promises";
+import path from "node:path";
+/**
+ * Directories that are never what someone is reaching for, and are large
+ * enough that walking them would spend the whole budget before reaching the
+ * source. Hidden directories are skipped by the same reasoning.
+ */
+const SKIP = new Set([
+    "node_modules",
+    "dist",
+    "build",
+    "out",
+    "coverage",
+    "target",
+    "vendor",
+    "__pycache__",
+    "venv",
+]);
+/** How many directory entries one search may look at before it gives up. */
+const VISIT_BUDGET = 15_000;
+/** How deep a search descends; deeper than this is generated output. */
+const MAX_DEPTH = 10;
+/** How many matches a search returns, which is more than a menu shows. */
+const MAX_RESULTS = 40;
+/**
+ * A path under `root`, said the short way.
+ *
+ * Everything else comes back as it was: a file chosen from the desktop is not
+ * in the project, and a relative path climbing out of it with ../../ is
+ * neither shorter nor clearer than where the file actually is.
+ */
+export function within(root, target) {
+    const rel = path.relative(path.resolve(root), path.resolve(target));
+    if (!rel || rel.startsWith("..") || path.isAbsolute(rel))
+        return target;
+    return rel.split(path.sep).join("/");
+}
+/** Resolve a client-supplied relative path, or undefined if it escapes. */
+function inside(root, rel) {
+    const full = path.resolve(root, rel);
+    if (full === root)
+        return full;
+    return full.startsWith(root + path.sep) ? full : undefined;
+}
+function relative(root, full) {
+    return path.relative(root, full).split(path.sep).join("/");
+}
+function skip(name) {
+    return name.startsWith(".") || SKIP.has(name);
+}
+/**
+ * One directory's children, for browsing into a project.
+ *
+ * A directory that cannot be read lists as empty rather than failing: the
+ * menu still shows the way back out of it.
+ */
+export async function browseFiles(root, rel = "") {
+    const base = path.resolve(root);
+    const full = inside(base, rel) ?? base;
+    const here = relative(base, full);
+    let entries = [];
+    try {
+        const items = await readdir(full, { withFileTypes: true });
+        entries = items
+            .filter((item) => !skip(item.name))
+            .map((item) => ({
+            path: here ? `${here}/${item.name}` : item.name,
+            name: item.name,
+            dir: item.isDirectory(),
+        }))
+            // Folders first: browsing is how someone gets to a file, so the rows
+            // that go somewhere belong above the rows that end the trip.
+            .sort((a, b) => (a.dir === b.dir ? a.name.localeCompare(b.name) : a.dir ? -1 : 1));
+    }
+    catch {
+        entries = [];
+    }
+    return {
+        dir: here,
+        ...(here ? { parent: relative(base, path.dirname(full)) } : {}),
+        entries,
+    };
+}
+/**
+ * Paths that fuzzily match `query`, best first.
+ *
+ * Breadth-first, so that when the budget runs out on a large repository it has
+ * been spent near the top of the tree — where the file someone is naming from
+ * memory almost always is — rather than deep inside one branch of it.
+ */
+export async function searchFiles(root, query, limit = MAX_RESULTS) {
+    const base = path.resolve(root);
+    const needle = query.trim().toLowerCase();
+    if (!needle)
+        return { entries: [], truncated: false };
+    const scored = [];
+    const queue = [{ full: base, depth: 0 }];
+    let visited = 0;
+    let truncated = false;
+    while (queue.length) {
+        const { full, depth } = queue.shift();
+        let items;
+        try {
+            items = await readdir(full, { withFileTypes: true });
+        }
+        catch {
+            continue;
+        }
+        for (const item of items) {
+            if (skip(item.name))
+                continue;
+            if (++visited > VISIT_BUDGET) {
+                truncated = true;
+                queue.length = 0;
+                break;
+            }
+            const child = path.join(full, item.name);
+            const rel = relative(base, child);
+            const score = rank(rel.toLowerCase(), item.name.toLowerCase(), needle);
+            if (score >= 0)
+                scored.push({ entry: { path: rel, name: item.name, dir: item.isDirectory() }, score });
+            if (item.isDirectory() && depth + 1 < MAX_DEPTH)
+                queue.push({ full: child, depth: depth + 1 });
+        }
+    }
+    scored.sort((a, b) => b.score - a.score || a.entry.path.length - b.entry.path.length);
+    return {
+        entries: scored.slice(0, limit).map((hit) => hit.entry),
+        truncated: truncated || scored.length > limit,
+    };
+}
+/**
+ * How well one path answers a query.
+ *
+ * Subsequence matching, because that is how people type a path they half
+ * remember — "svpage" for "server/src/page.ts". A run of adjacent characters
+ * and a match that starts a path segment both count for more than a letter
+ * found somewhere in the middle, and matching inside the file name counts for
+ * more than matching in the directories above it.
+ */
+function rank(relPath, name, needle) {
+    const base = subsequence(relPath, needle);
+    if (base < 0)
+        return -1;
+    const inName = subsequence(name, needle);
+    // Long paths accumulate incidental matches; without this a deeply nested
+    // near-miss outranks the file whose own name is what was typed.
+    return base + (inName >= 0 ? inName + 12 : 0) - relPath.length / 40;
+}
+function subsequence(text, needle) {
+    let score = 0;
+    let at = 0;
+    let previous = -2;
+    for (const ch of needle) {
+        if (ch === " ")
+            continue;
+        const found = text.indexOf(ch, at);
+        if (found === -1)
+            return -1;
+        score += found === previous + 1 ? 3 : 1;
+        if (found === 0 || "/-_. ".includes(text[found - 1] ?? ""))
+            score += 2;
+        previous = found;
+        at = found + 1;
+    }
+    return score;
+}
+//# sourceMappingURL=files.js.map

package/dist/files.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"files.js","sourceRoot":"","sources":["../src/files.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAC3C,OAAO,IAAI,MAAM,WAAW,CAAC;AAsB7B;;;;GAIG;AACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;IACnB,cAAc;IACd,MAAM;IACN,OAAO;IACP,KAAK;IACL,UAAU;IACV,QAAQ;IACR,QAAQ;IACR,aAAa;IACb,MAAM;CACP,CAAC,CAAC;AAEH,4EAA4E;AAC5E,MAAM,YAAY,GAAG,MAAM,CAAC;AAC5B,wEAAwE;AACxE,MAAM,SAAS,GAAG,EAAE,CAAC;AACrB,0EAA0E;AAC1E,MAAM,WAAW,GAAG,EAAE,CAAC;AAEvB;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAC,IAAY,EAAE,MAAc;IACjD,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC;IACxE,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACvC,CAAC;AAED,2EAA2E;AAC3E,SAAS,MAAM,CAAC,IAAY,EAAE,GAAW;IACvC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACrC,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AAC7D,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY,EAAE,IAAY;IAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,IAAI,CAAC,IAAY;IACxB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAChD,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,IAAY,EACZ,GAAG,GAAG,EAAE;IAER,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC;IACvC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAElC,IAAI,OAAO,GAAgB,EAAE,CAAC;IAC9B,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3D,OAAO,GAAG,KAAK;aACZ,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAClC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACd,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;YAC/C,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,GAAG,EAAE,IAAI,CAAC,WAAW,EAAE;SACxB,CAAC,CAAC;YACH,qEAAqE;YACrE,6DAA6D;aAC5D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,GAAG,EAAE,CAAC;IACf,CAAC;IAED,OAAO;QACL,GAAG,EAAE,IAAI;QACT,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,OAAO;KACR,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,IAAY,EACZ,KAAa,EACb,KAAK,GAAG,WAAW;IAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC1C,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAEtD,MAAM,MAAM,GAA+C,EAAE,CAAC;IAC9D,MAAM,KAAK,GAA2C,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACjF,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACvC,IAAI,KAAK,CAAC;QACV,IAAI,CAAC;YACH,KAAK,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QACvD,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC9B,IAAI,EAAE,OAAO,GAAG,YAAY,EAAE,CAAC;gBAC7B,SAAS,GAAG,IAAI,CAAC;gBACjB,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;gBACjB,MAAM;YACR,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,CAAC;YACvE,IAAI,KAAK,IAAI,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YACvG,IAAI,IAAI,CAAC,WAAW,EAAE,IAAI,KAAK,GAAG,CAAC,GAAG,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;QACjG,CAAC;IACH,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtF,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC;QACvD,SAAS,EAAE,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK;KAC9C,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,IAAI,CAAC,OAAe,EAAE,IAAY,EAAE,MAAc;IACzD,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC1C,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACzC,yEAAyE;IACzE,gEAAgE;IAChE,OAAO,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;AACtE,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,MAAc;IAC/C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,EAAE,KAAK,GAAG;YAAE,SAAS;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC5B,KAAK,IAAI,KAAK,KAAK,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,KAAK,KAAK,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC;QACvE,QAAQ,GAAG,KAAK,CAAC;QACjB,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/i18n.d.ts

@@ -0,0 +1,15 @@
+/**
+ * UI copy, in one place per language.
+ *
+ * English is the source: a key with no translation falls back to it rather
+ * than showing the key, because a missing string should degrade to readable
+ * text, not to `nav.models`. The locale is chosen from the browser and can be
+ * overridden with `?lang=`, so a translation can be checked without changing
+ * system settings.
+ */
+export declare const STRINGS: Record<string, Record<string, string>>;
+/** Locales offered in the UI, in menu order. */
+export declare const LOCALES: {
+    id: string;
+    label: string;
+}[];