@indigoai-us/hq-cloud 6.14.44 → 6.14.45

package/dist/watch-roots.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Watch-root planner — reduce the in-scope tree to the smallest set of OS
+ * watches that covers exactly the paths that can upload.
+ *
+ * Why this exists: on macOS/Windows the watcher used to place ONE recursive
+ * `fs.watch` on hqRoot. That is cheap in handles but the OS then delivers every
+ * event in the tree, including the buckets sync never uploads — on a real HQ
+ * root that is `repos/` (~26k directories) and `workspace/worktrees/` (~62k),
+ * where agent builds, installs, and checkouts churn constantly. Every one of
+ * those events woke the runner, cost a `path.resolve` (plus a synchronous
+ * `lstat` for renames), and was then dropped by the emit filter. The result was
+ * a node process pinned above 100% CPU doing nothing but allocating and
+ * garbage-collecting discarded paths.
+ *
+ * The planner walks the exclusion filter ONCE at start and returns:
+ *   - `recursive`: directories whose entire subtree is in scope. One recursive
+ *     watch each; the OS never reports an excluded path under them.
+ *   - `shallow`: directories that contain an excluded descendant. Watched
+ *     non-recursively so their own files still fire, with their in-scope
+ *     children planned separately.
+ *
+ * The walk is post-order: whether a directory can collapse to a single
+ * recursive watch depends on its whole subtree, not just its direct children
+ * (`workspace/` looks clean until you reach `workspace/worktrees/`).
+ */
+import type { WatchPathFilter } from "./watcher.js";
+export interface WatchRootPlan {
+    /** Directories to watch recursively — their whole subtree is in scope. */
+    recursive: string[];
+    /** Directories to watch non-recursively — they contain excluded children. */
+    shallow: string[];
+}
+export interface PlanWatchRootsOptions {
+    /**
+     * Optional depth at which the walk stops splitting and takes a recursive
+     * watch even if the subtree still holds exclusions. Unbounded by default:
+     * the walk costs about what {@link TreeWatcher}'s known-kinds seed walk
+     * already cost on every start, and the two are fused via `onDirectory`, so
+     * paying for full pruning is free. A bound trades pruning for walk time on
+     * pathologically deep trees; the per-event filter drops whatever residue it
+     * admits, so this is a performance dial, never a correctness one.
+     */
+    maxDepth?: number;
+    /** Directory reader seam — defaults to a real `readdirSync`. */
+    listChildDirs?: (dir: string) => string[];
+    /**
+     * Invoked once for every in-scope directory the walk visits. Lets a caller
+     * populate its own directory index in the SAME pass instead of walking the
+     * tree a second time.
+     */
+    onDirectory?: (absolutePath: string) => void;
+}
+/**
+ * Plan the watch roots for `hqRoot` under `shouldEmit`.
+ *
+ * `shouldEmit(dir, true)` is the same directory predicate the watcher uses at
+ * event time, so the plan and the emit filter can never disagree about what is
+ * in scope.
+ */
+export declare function planWatchRoots(hqRoot: string, shouldEmit: WatchPathFilter, opts?: PlanWatchRootsOptions): WatchRootPlan;
+/**
+ * True when `absolutePath` already falls under one of `recursiveRoots`.
+ *
+ * Walks the path's own ancestors rather than scanning the root set: this runs
+ * on every rename event, in the hot path of a backend whose entire purpose is
+ * cutting per-event cost, and a real HQ tree plans ~685 roots. Ancestor-walking
+ * is O(path depth) — about ten set lookups — instead of O(roots) string
+ * comparisons. It also cannot fall into the shared-prefix trap, where `/hq/a/bc`
+ * looks like it sits under the root `/hq/a/b`.
+ */
+export declare function isCoveredByRecursiveRoot(absolutePath: string, recursiveRoots: ReadonlySet<string>): boolean;
+//# sourceMappingURL=watch-roots.d.ts.map

package/dist/watch-roots.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"watch-roots.d.ts","sourceRoot":"","sources":["../src/watch-roots.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAKH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEpD,MAAM,WAAW,aAAa;IAC5B,0EAA0E;IAC1E,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,6EAA6E;IAC7E,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,qBAAqB;IACpC;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gEAAgE;IAChE,aAAa,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,EAAE,CAAC;IAC1C;;;;OAIG;IACH,WAAW,CAAC,EAAE,CAAC,YAAY,EAAE,MAAM,KAAK,IAAI,CAAC;CAC9C;AAeD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,eAAe,EAC3B,IAAI,GAAE,qBAA0B,GAC/B,aAAa,CAsDf;AAED;;;;;;;;;GASG;AACH,wBAAgB,wBAAwB,CACtC,YAAY,EAAE,MAAM,EACpB,cAAc,EAAE,WAAW,CAAC,MAAM,CAAC,GAClC,OAAO,CAST"}

package/dist/watch-roots.js

@@ -0,0 +1,115 @@
+/**
+ * Watch-root planner — reduce the in-scope tree to the smallest set of OS
+ * watches that covers exactly the paths that can upload.
+ *
+ * Why this exists: on macOS/Windows the watcher used to place ONE recursive
+ * `fs.watch` on hqRoot. That is cheap in handles but the OS then delivers every
+ * event in the tree, including the buckets sync never uploads — on a real HQ
+ * root that is `repos/` (~26k directories) and `workspace/worktrees/` (~62k),
+ * where agent builds, installs, and checkouts churn constantly. Every one of
+ * those events woke the runner, cost a `path.resolve` (plus a synchronous
+ * `lstat` for renames), and was then dropped by the emit filter. The result was
+ * a node process pinned above 100% CPU doing nothing but allocating and
+ * garbage-collecting discarded paths.
+ *
+ * The planner walks the exclusion filter ONCE at start and returns:
+ *   - `recursive`: directories whose entire subtree is in scope. One recursive
+ *     watch each; the OS never reports an excluded path under them.
+ *   - `shallow`: directories that contain an excluded descendant. Watched
+ *     non-recursively so their own files still fire, with their in-scope
+ *     children planned separately.
+ *
+ * The walk is post-order: whether a directory can collapse to a single
+ * recursive watch depends on its whole subtree, not just its direct children
+ * (`workspace/` looks clean until you reach `workspace/worktrees/`).
+ */
+import * as fs from "fs";
+import * as path from "path";
+function defaultListChildDirs(dir) {
+    return fs
+        .readdirSync(dir, { withFileTypes: true })
+        .filter((entry) => entry.isDirectory())
+        .map((entry) => path.join(dir, entry.name));
+}
+/**
+ * Plan the watch roots for `hqRoot` under `shouldEmit`.
+ *
+ * `shouldEmit(dir, true)` is the same directory predicate the watcher uses at
+ * event time, so the plan and the emit filter can never disagree about what is
+ * in scope.
+ */
+export function planWatchRoots(hqRoot, shouldEmit, opts = {}) {
+    const maxDepth = opts.maxDepth ?? Number.POSITIVE_INFINITY;
+    const listChildDirs = opts.listChildDirs ?? defaultListChildDirs;
+    const onDirectory = opts.onDirectory;
+    const root = path.resolve(hqRoot);
+    const visit = (dir, depth) => {
+        let children;
+        try {
+            children = listChildDirs(dir);
+        }
+        catch {
+            // Unreadable (permissions, or a race with a concurrent delete). We cannot
+            // prove the subtree is clean, but dropping it would silently stop syncing
+            // it — take the recursive watch and let the per-event filter sort it out.
+            return { clean: true, plan: { recursive: [dir], shallow: [] } };
+        }
+        const included = [];
+        let hasExcludedChild = false;
+        for (const child of children) {
+            if (shouldEmit(child, true)) {
+                included.push(child);
+                onDirectory?.(path.resolve(child));
+            }
+            else
+                hasExcludedChild = true;
+        }
+        // At the depth bound we stop splitting. `clean` still reports what we can
+        // see one level down so an ancestor does not collapse over a known
+        // exclusion it could have pruned.
+        if (depth >= maxDepth) {
+            return {
+                clean: !hasExcludedChild,
+                plan: { recursive: [dir], shallow: [] },
+            };
+        }
+        const childResults = included.map((child) => visit(child, depth + 1));
+        const clean = !hasExcludedChild && childResults.every((result) => result.clean);
+        // A clean subtree collapses to a single recursive watch here, discarding
+        // the per-child watches the recursion built below it.
+        if (clean)
+            return { clean: true, plan: { recursive: [dir], shallow: [] } };
+        return {
+            clean: false,
+            plan: {
+                recursive: childResults.flatMap((result) => result.plan.recursive),
+                shallow: [dir, ...childResults.flatMap((result) => result.plan.shallow)],
+            },
+        };
+    };
+    return visit(root, 0).plan;
+}
+/**
+ * True when `absolutePath` already falls under one of `recursiveRoots`.
+ *
+ * Walks the path's own ancestors rather than scanning the root set: this runs
+ * on every rename event, in the hot path of a backend whose entire purpose is
+ * cutting per-event cost, and a real HQ tree plans ~685 roots. Ancestor-walking
+ * is O(path depth) — about ten set lookups — instead of O(roots) string
+ * comparisons. It also cannot fall into the shared-prefix trap, where `/hq/a/bc`
+ * looks like it sits under the root `/hq/a/b`.
+ */
+export function isCoveredByRecursiveRoot(absolutePath, recursiveRoots) {
+    if (recursiveRoots.size === 0)
+        return false;
+    let current = path.resolve(absolutePath);
+    for (;;) {
+        if (recursiveRoots.has(current))
+            return true;
+        const parent = path.dirname(current);
+        if (parent === current)
+            return false;
+        current = parent;
+    }
+}
+//# sourceMappingURL=watch-roots.js.map

package/dist/watch-roots.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"watch-roots.js","sourceRoot":"","sources":["../src/watch-roots.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAgC7B,SAAS,oBAAoB,CAAC,GAAW;IACvC,OAAO,EAAE;SACN,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;SACzC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;SACtC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AAChD,CAAC;AAQD;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAc,EACd,UAA2B,EAC3B,OAA8B,EAAE;IAEhC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,oBAAoB,CAAC;IACjE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAElC,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,KAAa,EAAe,EAAE;QACxD,IAAI,QAAkB,CAAC;QACvB,IAAI,CAAC;YACH,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,0EAA0E;YAC1E,0EAA0E;YAC1E,0EAA0E;YAC1E,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;QAClE,CAAC;QAED,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,WAAW,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YACrC,CAAC;;gBAAM,gBAAgB,GAAG,IAAI,CAAC;QACjC,CAAC;QAED,0EAA0E;QAC1E,mEAAmE;QACnE,kCAAkC;QAClC,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;YACtB,OAAO;gBACL,KAAK,EAAE,CAAC,gBAAgB;gBACxB,IAAI,EAAE,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;aACxC,CAAC;QACJ,CAAC;QAED,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,KAAK,GACT,CAAC,gBAAgB,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEpE,yEAAyE;QACzE,sDAAsD;QACtD,IAAI,KAAK;YAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;QAE3E,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,IAAI,EAAE;gBACJ,SAAS,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;gBAClE,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACzE;SACF,CAAC;IACJ,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7B,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CACtC,YAAoB,EACpB,cAAmC;IAEnC,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IACzC,SAAS,CAAC;QACR,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO,IAAI,CAAC;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,MAAM,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC;QACrC,OAAO,GAAG,MAAM,CAAC;IACnB,CAAC;AACH,CAAC"}

package/dist/watch-roots.test.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Tests for the watch-root planner.
+ *
+ * The invariant under test is the one the whole change exists for: the watcher
+ * must only register OS watches over paths that can actually upload. Before
+ * this planner, macOS/Windows placed ONE recursive `fs.watch` on hqRoot, so the
+ * OS delivered every event in the tree — including `repos/` (~26k dirs on a
+ * real HQ) and `workspace/worktrees/` (~62k dirs) — and each one was filtered
+ * out only AFTER it had already cost a syscall and an allocation.
+ *
+ * The planner walks the exclusion filter up front and returns the minimum set
+ * of watch roots that covers exactly the in-scope tree:
+ *   - `recursive`: the dir's entire subtree is in scope → one recursive watch.
+ *   - `shallow`:   the dir contains an excluded child → watch the dir itself
+ *                  non-recursively and descend into its in-scope children.
+ */
+export {};
+//# sourceMappingURL=watch-roots.test.d.ts.map

package/dist/watch-roots.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"watch-roots.test.d.ts","sourceRoot":"","sources":["../src/watch-roots.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG"}

package/dist/watch-roots.test.js

@@ -0,0 +1,236 @@
+/**
+ * Tests for the watch-root planner.
+ *
+ * The invariant under test is the one the whole change exists for: the watcher
+ * must only register OS watches over paths that can actually upload. Before
+ * this planner, macOS/Windows placed ONE recursive `fs.watch` on hqRoot, so the
+ * OS delivered every event in the tree — including `repos/` (~26k dirs on a
+ * real HQ) and `workspace/worktrees/` (~62k dirs) — and each one was filtered
+ * out only AFTER it had already cost a syscall and an allocation.
+ *
+ * The planner walks the exclusion filter up front and returns the minimum set
+ * of watch roots that covers exactly the in-scope tree:
+ *   - `recursive`: the dir's entire subtree is in scope → one recursive watch.
+ *   - `shallow`:   the dir contains an excluded child → watch the dir itself
+ *                  non-recursively and descend into its in-scope children.
+ */
+import { mkdtemp, mkdir, rm } from "node:fs/promises";
+import { tmpdir } from "node:os";
+import path from "node:path";
+import { describe, expect, it } from "vitest";
+import { isCoveredByRecursiveRoot, planWatchRoots } from "./watch-roots.js";
+const ROOT = path.resolve("/hq");
+/** Build the `listChildDirs` seam over a literal `absDir -> childNames` map. */
+function treeLister(tree) {
+    return (dir) => (tree[dir] ?? []).map((name) => path.join(dir, name));
+}
+/**
+ * Build a filter shaped like the real one: `prefixes` are exact vault-relative
+ * prefixes (`repos`, `workspace/worktrees` — position-sensitive), `anySegment`
+ * names are excluded at any depth (`node_modules`, `.git`).
+ */
+function makeFilter(opts) {
+    const prefixes = opts.prefixes ?? [];
+    const anySegment = new Set(opts.anySegment ?? []);
+    return (absolutePath) => {
+        const rel = path.relative(ROOT, absolutePath).split(path.sep).join("/");
+        if (rel === "" || rel.startsWith(".."))
+            return false;
+        if (prefixes.some((p) => rel === p || rel.startsWith(p + "/")))
+            return false;
+        if (rel.split("/").some((seg) => anySegment.has(seg)))
+            return false;
+        return true;
+    };
+}
+/** Every dir the plan asks the OS to watch, recursive roots and shallow alike. */
+function allWatched(plan) {
+    return [...plan.recursive, ...plan.shallow];
+}
+describe("planWatchRoots — minimal cover of the in-scope tree", () => {
+    it("collapses a fully in-scope tree to ONE recursive watch at the root", () => {
+        const plan = planWatchRoots(ROOT, makeFilter({}), {
+            listChildDirs: treeLister({
+                [ROOT]: ["companies", "core"],
+                [path.join(ROOT, "companies")]: ["acme"],
+            }),
+        });
+        expect(plan.recursive).toEqual([ROOT]);
+        expect(plan.shallow).toEqual([]);
+    });
+    it("never registers a watch on an excluded dir, and never covers one from a recursive root", () => {
+        const filter = makeFilter({
+            prefixes: ["repos"],
+            anySegment: ["node_modules"],
+        });
+        const plan = planWatchRoots(ROOT, filter, {
+            listChildDirs: treeLister({
+                [ROOT]: ["companies", "repos", "node_modules"],
+                [path.join(ROOT, "companies")]: ["acme"],
+                [path.join(ROOT, "repos")]: ["hq-cloud"],
+            }),
+        });
+        // The root has excluded children, so it cannot be a recursive root.
+        expect(plan.shallow).toContain(ROOT);
+        expect(plan.recursive).not.toContain(ROOT);
+        // `companies/` is clean, so it collapses to one recursive watch.
+        expect(plan.recursive).toContain(path.join(ROOT, "companies"));
+        // The point of the whole change: excluded trees are never watched at all.
+        for (const watched of allWatched(plan)) {
+            expect(watched).not.toContain(`${path.sep}repos`);
+            expect(watched).not.toContain("node_modules");
+        }
+    });
+    it("descends through a partially-excluded dir to reach its in-scope children", () => {
+        // `workspace/` is in scope but `workspace/worktrees/` (the 62k-dir bucket)
+        // is not — so `workspace` must be shallow and its siblings recursive.
+        const filter = makeFilter({ prefixes: ["workspace/worktrees"] });
+        const plan = planWatchRoots(ROOT, filter, {
+            listChildDirs: treeLister({
+                [ROOT]: ["workspace"],
+                [path.join(ROOT, "workspace")]: ["agency", "threads", "worktrees"],
+                [path.join(ROOT, "workspace", "worktrees")]: ["feature-a"],
+            }),
+        });
+        expect(plan.shallow).toEqual(expect.arrayContaining([ROOT, path.join(ROOT, "workspace")]));
+        expect(plan.recursive).toEqual(expect.arrayContaining([
+            path.join(ROOT, "workspace", "agency"),
+            path.join(ROOT, "workspace", "threads"),
+        ]));
+        expect(allWatched(plan)).not.toContain(path.join(ROOT, "workspace", "worktrees"));
+    });
+    it("holds the invariant: no excluded path lies under any recursive root", () => {
+        const filter = makeFilter({
+            prefixes: ["repos", "workspace/worktrees"],
+            anySegment: ["node_modules", ".git"],
+        });
+        const tree = {
+            [ROOT]: [
+                "companies",
+                "core",
+                "workspace",
+                "repos",
+                ".git",
+                "node_modules",
+            ],
+            [path.join(ROOT, "companies")]: ["acme", "indigo"],
+            [path.join(ROOT, "core")]: ["skills"],
+            [path.join(ROOT, "workspace")]: ["agency", "worktrees"],
+            [path.join(ROOT, "workspace", "worktrees")]: ["wt-1"],
+            [path.join(ROOT, "repos")]: ["hq-cloud"],
+        };
+        const plan = planWatchRoots(ROOT, filter, {
+            listChildDirs: treeLister(tree),
+        });
+        const excludedDirs = Object.keys(tree)
+            .flatMap((dir) => (tree[dir] ?? []).map((n) => path.join(dir, n)))
+            .filter((p) => !filter(p, true));
+        expect(excludedDirs.length).toBeGreaterThan(0);
+        for (const excluded of excludedDirs) {
+            // Not watched directly...
+            expect(allWatched(plan)).not.toContain(excluded);
+            // ...and not swept in as a descendant of some recursive root either.
+            for (const root of plan.recursive) {
+                expect(excluded.startsWith(root + path.sep)).toBe(false);
+            }
+        }
+    });
+    it("stops descending at maxDepth and takes a recursive watch there", () => {
+        const filter = makeFilter({ anySegment: ["node_modules"] });
+        const plan = planWatchRoots(ROOT, filter, {
+            maxDepth: 1,
+            listChildDirs: treeLister({
+                [ROOT]: ["a", "node_modules"],
+                [path.join(ROOT, "a")]: ["b", "node_modules"],
+                [path.join(ROOT, "a", "b")]: ["c"],
+            }),
+        });
+        // Depth 0 has an excluded child → shallow. Depth 1 is the bound, so `a`
+        // takes a recursive watch even though it still contains node_modules; the
+        // per-event filter drops that residue. This bounds handle count on trees
+        // with deeply scattered exclusions.
+        expect(plan.shallow).toEqual([ROOT]);
+        expect(plan.recursive).toEqual([path.join(ROOT, "a")]);
+    });
+    it("skips a directory it cannot read instead of throwing", () => {
+        const plan = planWatchRoots(ROOT, makeFilter({ prefixes: ["repos"] }), {
+            listChildDirs: (dir) => {
+                if (dir === path.join(ROOT, "denied")) {
+                    throw Object.assign(new Error("EACCES"), { code: "EACCES" });
+                }
+                return dir === ROOT
+                    ? [path.join(ROOT, "denied"), path.join(ROOT, "repos")]
+                    : [];
+            },
+        });
+        // The unreadable dir is still watched (we cannot see inside it to decide
+        // better) and the walk completes rather than crashing start().
+        expect(allWatched(plan)).toContain(path.join(ROOT, "denied"));
+        expect(allWatched(plan)).not.toContain(path.join(ROOT, "repos"));
+    });
+    it("reports every in-scope directory through onDirectory, and no excluded one", () => {
+        // TreeWatcher builds its known-kinds index from this callback instead of
+        // walking the same tree a second time, so the callback must cover every
+        // in-scope directory — including ones inside a collapsed recursive root.
+        const filter = makeFilter({ prefixes: ["repos"] });
+        const seen = [];
+        planWatchRoots(ROOT, filter, {
+            onDirectory: (dir) => seen.push(dir),
+            listChildDirs: treeLister({
+                [ROOT]: ["companies", "repos"],
+                [path.join(ROOT, "companies")]: ["acme"],
+                [path.join(ROOT, "companies", "acme")]: ["knowledge"],
+                [path.join(ROOT, "repos")]: ["hq-cloud"],
+            }),
+        });
+        expect(seen).toEqual([
+            path.join(ROOT, "companies"),
+            path.join(ROOT, "companies", "acme"),
+            path.join(ROOT, "companies", "acme", "knowledge"),
+        ]);
+        expect(seen).not.toContain(path.join(ROOT, "repos"));
+        expect(seen).not.toContain(path.join(ROOT, "repos", "hq-cloud"));
+    });
+    it("resolves coverage by walking ancestors, not by scanning every root", () => {
+        // This runs on EVERY rename event, in the hot path of a change whose whole
+        // point is cutting per-event cost. A linear scan is O(number of roots) —
+        // 685 on a real HQ tree — where an ancestor walk is O(path depth), ~10.
+        // The behavior must be identical, including the prefix trap below.
+        const roots = new Set([path.join(ROOT, "a", "b"), path.join(ROOT, "c")]);
+        expect(isCoveredByRecursiveRoot(path.join(ROOT, "a", "b"), roots)).toBe(true);
+        expect(isCoveredByRecursiveRoot(path.join(ROOT, "a", "b", "deep", "x.md"), roots)).toBe(true);
+        expect(isCoveredByRecursiveRoot(path.join(ROOT, "a"), roots)).toBe(false);
+        expect(isCoveredByRecursiveRoot(path.join(ROOT, "d"), roots)).toBe(false);
+        // The prefix trap: `/hq/a/bc` shares a string prefix with root `/hq/a/b`
+        // but is NOT under it. A naive startsWith without the separator would say
+        // covered, and the whole subtree would go unwatched.
+        expect(isCoveredByRecursiveRoot(path.join(ROOT, "a", "bc"), roots)).toBe(false);
+        expect(isCoveredByRecursiveRoot(path.join(ROOT, "a", "bc", "x.md"), roots)).toBe(false);
+    });
+    it("reports nothing as covered when there are no recursive roots", () => {
+        expect(isCoveredByRecursiveRoot(path.join(ROOT, "a", "b"), new Set())).toBe(false);
+    });
+    it("plans over a real directory tree using the default reader", async () => {
+        const root = await mkdtemp(path.join(tmpdir(), "hqcloud-planroots-"));
+        try {
+            await mkdir(path.join(root, "companies", "acme"), { recursive: true });
+            await mkdir(path.join(root, "repos", "hq-cloud", "src"), {
+                recursive: true,
+            });
+            const filter = (abs) => {
+                const rel = path.relative(root, abs).split(path.sep).join("/");
+                if (rel === "" || rel.startsWith(".."))
+                    return false;
+                return rel !== "repos" && !rel.startsWith("repos/");
+            };
+            const plan = planWatchRoots(root, filter);
+            expect(plan.shallow).toContain(root);
+            expect(plan.recursive).toContain(path.join(root, "companies"));
+            expect(allWatched(plan)).not.toContain(path.join(root, "repos"));
+        }
+        finally {
+            await rm(root, { recursive: true, force: true });
+        }
+    });
+});
+//# sourceMappingURL=watch-roots.test.js.map

package/dist/watch-roots.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"watch-roots.test.js","sourceRoot":"","sources":["../src/watch-roots.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,IAAI,MAAM,WAAW,CAAC;AAE7B,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAE9C,OAAO,EAAE,wBAAwB,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAG5E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAEjC,gFAAgF;AAChF,SAAS,UAAU,CAAC,IAA8B;IAChD,OAAO,CAAC,GAAW,EAAY,EAAE,CAC/B,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAGnB;IACC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC;IAClD,OAAO,CAAC,YAAoB,EAAW,EAAE;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxE,IAAI,GAAG,KAAK,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QACrD,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC7E,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACpE,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,SAAS,UAAU,CAAC,IAAgD;IAClE,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;AAC9C,CAAC;AAED,QAAQ,CAAC,qDAAqD,EAAE,GAAG,EAAE;IACnE,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE;YAChD,aAAa,EAAE,UAAU,CAAC;gBACxB,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,MAAM,CAAC;gBAC7B,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC;aACzC,CAAC;SACH,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wFAAwF,EAAE,GAAG,EAAE;QAChG,MAAM,MAAM,GAAG,UAAU,CAAC;YACxB,QAAQ,EAAE,CAAC,OAAO,CAAC;YACnB,UAAU,EAAE,CAAC,cAAc,CAAC;SAC7B,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE;YACxC,aAAa,EAAE,UAAU,CAAC;gBACxB,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,OAAO,EAAE,cAAc,CAAC;gBAC9C,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC;gBACxC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC;aACzC,CAAC;SACH,CAAC,CAAC;QAEH,oEAAoE;QACpE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC3C,iEAAiE;QACjE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;QAE/D,0EAA0E;QAC1E,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;YAClD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0EAA0E,EAAE,GAAG,EAAE;QAClF,2EAA2E;QAC3E,sEAAsE;QACtE,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,QAAQ,EAAE,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE;YACxC,aAAa,EAAE,UAAU,CAAC;gBACxB,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC;gBACrB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,SAAS,EAAE,WAAW,CAAC;gBAClE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC;aAC3D,CAAC;SACH,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAC1B,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAC7D,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAC5B,MAAM,CAAC,eAAe,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC;SACxC,CAAC,CACH,CAAC;QACF,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CACpC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,CAC1C,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,MAAM,GAAG,UAAU,CAAC;YACxB,QAAQ,EAAE,CAAC,OAAO,EAAE,qBAAqB,CAAC;YAC1C,UAAU,EAAE,CAAC,cAAc,EAAE,MAAM,CAAC;SACrC,CAAC,CAAC;QACH,MAAM,IAAI,GAA6B;YACrC,CAAC,IAAI,CAAC,EAAE;gBACN,WAAW;gBACX,MAAM;gBACN,WAAW;gBACX,OAAO;gBACP,MAAM;gBACN,cAAc;aACf;YACD,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC;YAClD,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC;YACrC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,WAAW,CAAC;YACvD,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC;YACrD,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC;SACzC,CAAC;QACF,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE;YACxC,aAAa,EAAE,UAAU,CAAC,IAAI,CAAC;SAChC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;aACnC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;aACjE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAE/C,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,CAAC;YACpC,0BAA0B;YAC1B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;YACjD,qEAAqE;YACrE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAClC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,UAAU,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE;YACxC,QAAQ,EAAE,CAAC;YACX,aAAa,EAAE,UAAU,CAAC;gBACxB,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,cAAc,CAAC;gBAC7B,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,cAAc,CAAC;gBAC7C,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC;aACnC,CAAC;SACH,CAAC,CAAC;QAEH,wEAAwE;QACxE,0EAA0E;QAC1E,yEAAyE;QACzE,oCAAoC;QACpC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACrE,aAAa,EAAE,CAAC,GAAW,EAAE,EAAE;gBAC7B,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;oBACtC,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;gBAC/D,CAAC;gBACD,OAAO,GAAG,KAAK,IAAI;oBACjB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;oBACvD,CAAC,CAAC,EAAE,CAAC;YACT,CAAC;SACF,CAAC,CAAC;QAEH,yEAAyE;QACzE,+DAA+D;QAC/D,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,yEAAyE;QACzE,wEAAwE;QACxE,yEAAyE;QACzE,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnD,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE;YAC3B,WAAW,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YACpC,aAAa,EAAE,UAAU,CAAC;gBACxB,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,OAAO,CAAC;gBAC9B,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC;gBACxC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC;gBACrD,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC;aACzC,CAAC;SACH,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,CAAC;SAClD,CAAC,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,2EAA2E;QAC3E,yEAAyE;QACzE,wEAAwE;QACxE,mEAAmE;QACnE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAEzE,MAAM,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9E,MAAM,CACJ,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAC3E,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACb,MAAM,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1E,MAAM,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1E,yEAAyE;QACzE,0EAA0E;QAC1E,qDAAqD;QACrD,MAAM,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CACtE,KAAK,CACN,CAAC;QACF,MAAM,CACJ,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CACpE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CACJ,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,GAAG,EAAU,CAAC,CACvE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QACzE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,oBAAoB,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACvE,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE;gBACvD,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;YAEH,MAAM,MAAM,GAAoB,CAAC,GAAG,EAAE,EAAE;gBACtC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC/D,IAAI,GAAG,KAAK,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACrD,OAAO,GAAG,KAAK,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACtD,CAAC,CAAC;YACF,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAE1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;YAC/D,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;QACnE,CAAC;gBAAS,CAAC;YACT,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QACnD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/watcher-event-gate.test.d.ts

@@ -0,0 +1,16 @@
+/**
+ * The emit filter must run BEFORE handleEvent pays for a stat.
+ *
+ * The recursive backend hands every OS event to handleEvent, and a `rename`
+ * used to be lstat'd before the exclusion filter was consulted. On a real HQ
+ * that is one synchronous syscall for every file touched anywhere under
+ * `repos/` or `workspace/worktrees/` — build, install, and checkout churn the
+ * watcher immediately throws away. Scoped watch roots (see watch-roots.ts) keep
+ * most of that traffic from being delivered at all; this gate makes whatever
+ * still arrives cost a string compare instead of a syscall.
+ *
+ * This lives in its own file because it mocks `fs` module-wide, which would
+ * otherwise perturb the 53 tests in watcher.test.ts.
+ */
+export {};
+//# sourceMappingURL=watcher-event-gate.test.d.ts.map

package/dist/watcher-event-gate.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"watcher-event-gate.test.d.ts","sourceRoot":"","sources":["../src/watcher-event-gate.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG"}