@deskwork/core 0.9.5

package/dist/content-tree.js

@@ -0,0 +1,385 @@
+/**
+ * Bird's-eye content-tree builder (Phase 16d, fs-inverted in v0.6.0 / #24,
+ * fs-keyed in Phase 19c / #33).
+ *
+ * Derives a tree-of-nodes representation from the host project's
+ * filesystem, with the editorial calendar overlaid as a state layer.
+ *
+ *   - The **filesystem walk** is the primary structure source. Every
+ *     directory under `<contentDir>/` becomes a node, keyed by its
+ *     fs-relative path (e.g. `projects/the-outbound`).
+ *   - The **calendar** is the state overlay. A calendar entry whose
+ *     `id` matches an fs node's frontmatter `id:` (via the content
+ *     index) sets the node's lane (its lifecycle stage), display
+ *     title, AND the `slug` display attribute (the entry's
+ *     host-rendering-engine slug, used by the studio for the
+ *     "public URL: /blog/<slug>" hover hint).
+ *
+ * Read-only — never mutates the calendar or the filesystem. Callers
+ * cache the result for the lifetime of a single request unless the
+ * caller knows the underlying data has changed.
+ *
+ * Inversion rationale (#33): pre-19c the tree keyed nodes by **slug**.
+ * This worked for audiocontrol's flat layout where slug == fs path,
+ * but broke for writingcontrol where slug `the-outbound` (the
+ * Astro-derived public URL) is unrelated to the file's path
+ * (`projects/the-outbound/index.md`). The ghost-root bug came from
+ * union-by-slug producing a calendar-only tree at slug
+ * `the-outbound` plus a separate untracked tree under `projects/`
+ * that never merged.
+ *
+ * Now: tree placement is filesystem-driven. Each fs node carries the
+ * relative path (e.g. `projects/the-outbound`). Calendar entries
+ * overlay state onto fs nodes by matching the entry's `id` against
+ * the file's frontmatter `id:` via `buildContentIndex`. Slug stops
+ * being load-bearing structurally and becomes a display attribute.
+ *
+ * Legacy slug-fallback (intentional, for pre-doctor entries): when a
+ * calendar entry's id isn't found in the content index (its file
+ * hasn't been bound to frontmatter yet), the assembly looks for an
+ * fs node whose path equals the entry's slug. If found → overlay
+ * with a one-time warning hinting at `deskwork doctor`. If not found
+ * → place the entry as a ghost node (preserving today's behavior
+ * for entries with neither id-binding nor a path-shaped slug).
+ * This is NOT a "fallback for missing functionality" in the project
+ * rule's sense — it's a deliberate transitional path that the doctor
+ * command resolves operator-side.
+ */
+import { buildContentIndex } from "./content-index.js";
+import { listScrapbook } from "./scrapbook.js";
+import { resolveContentDir } from "./paths.js";
+import { defaultFsWalk } from "./content-tree-fs-walk.js";
+import { ancestorsOf, entryHasOwnIndex, findIdBoundPath, idBoundFile, leafOfPath, pickLatestMtime, rootSegment, } from "./content-tree-helpers.js";
+// Re-export the fs-walk + types so external callers (tests, studio) keep
+// importing from `content-tree.ts` as today — the split is internal.
+export { defaultFsWalk } from "./content-tree-fs-walk.js";
+// ---------------------------------------------------------------------------
+// Legacy slug-fallback warning de-duplication
+// ---------------------------------------------------------------------------
+//
+// `buildContentTree` is called on every studio render (the dashboard polls
+// at ~10s intervals). Pre-doctor entries that legitimately fall through to
+// slug-as-path matching would otherwise emit the same warning hundreds of
+// times an hour. Track which (site, entryId|slug) pairs have already
+// warned this process and skip subsequent warnings.
+//
+// The Set lives at module scope on purpose — it intentionally outlives any
+// single request. Tests that need fresh warning behavior should call the
+// `__resetLegacyFallbackWarnings()` helper below in `beforeEach`.
+const WARNED_LEGACY_FALLBACK = new Set();
+/**
+ * Test-only: clear the legacy slug-fallback warning de-dup set so tests
+ * that exercise warning behavior can do so independently. Not part of the
+ * public API — exposed only because process-level state is awkward to
+ * reset from inside tests without a hook.
+ */
+export function __resetLegacyFallbackWarnings() {
+    WARNED_LEGACY_FALLBACK.clear();
+}
+// ---------------------------------------------------------------------------
+// Build
+// ---------------------------------------------------------------------------
+/**
+ * Build the content-tree projects for one site. Pure data — no HTML,
+ * no path-style decisions.
+ *
+ * Tree assembly (Phase 19c):
+ *   1. Walk the fs (`fsWalk`) to enumerate every directory under
+ *      contentDir. Each fs entry contributes a candidate node keyed by
+ *      its fs-relative path.
+ *   2. Build the content index (`buildContentIndex`) to map
+ *      `relPath → entryId` based on frontmatter `id:`.
+ *   3. For each fs node with a markdown index/README, look up the
+ *      bound entry id via `index.byPath`, then resolve the calendar
+ *      entry by id. If found → overlay state (lane, title from entry,
+ *      slug as a display attribute).
+ *   4. For calendar entries whose id is NOT in the index (their file
+ *      isn't bound to frontmatter yet — pre-doctor state), do
+ *      legacy slug fallback: look for an fs node whose path equals
+ *      the entry's slug. If found → overlay with a one-time warning.
+ *      If not found → place as a ghost node (today's behavior,
+ *      preserved for backward compat).
+ */
+export function buildContentTree(site, entries, config, projectRoot, options = {}) {
+    const lookup = options.scrapbookLookup ??
+        ((siteArg, path) => {
+            try {
+                return listScrapbook(projectRoot, config, siteArg, path);
+            }
+            catch {
+                return { items: [], secretItems: [] };
+            }
+        });
+    const fsWalk = options.fsWalk ?? ((siteArg) => defaultFsWalk(projectRoot, config, siteArg));
+    const fsEntries = fsWalk(site);
+    const fsEntryByPath = new Map();
+    for (const e of fsEntries)
+        fsEntryByPath.set(e.slug, e);
+    const contentIndex = options.contentIndex ?? buildContentIndex(projectRoot, config, site);
+    const warn = options.warn ?? ((msg) => console.warn(msg));
+    const contentDir = resolveContentDir(projectRoot, config, site);
+    // ---- Phase 1: assemble the union of paths that need nodes ----
+    // Calendar entries contribute through TWO routes:
+    //   (a) id-based binding: index.byPath[relPath] === entry.id binds
+    //       the entry to that fs path. The path becomes the node key.
+    //   (b) legacy slug fallback: when (a) doesn't fire, treat the
+    //       entry's slug as a candidate path. If the fs walk includes
+    //       it, overlay there with a warning. Otherwise it's a ghost.
+    const allPaths = new Set();
+    // Track which calendar entries bind to which paths. The path is
+    // either the fs-bound path (id-driven) or the entry's slug (legacy
+    // fallback / ghost).
+    const overlayByPath = new Map();
+    // Filesystem-derived paths first — every walked dir contributes its
+    // own path AND its ancestors so the tree wires up cleanly.
+    for (const e of fsEntries) {
+        if (e.hasReadme || e.hasIndex) {
+            allPaths.add(e.slug);
+            for (const a of ancestorsOf(e.slug))
+                allPaths.add(a);
+        }
+    }
+    // Determine each entry's binding target (id-based, slug-fallback, ghost).
+    for (const entry of entries) {
+        const idBoundPath = findIdBoundPath(entry, contentIndex);
+        if (idBoundPath !== null) {
+            overlayByPath.set(idBoundPath, entry);
+            allPaths.add(idBoundPath);
+            for (const a of ancestorsOf(idBoundPath))
+                allPaths.add(a);
+            continue;
+        }
+        // Legacy slug-fallback: if the slug looks like an fs path AND
+        // matches a walked dir, overlay there. Otherwise ghost.
+        if (fsEntryByPath.has(entry.slug)) {
+            overlayByPath.set(entry.slug, entry);
+            allPaths.add(entry.slug);
+            for (const a of ancestorsOf(entry.slug))
+                allPaths.add(a);
+            // De-dup the warning per process — without this the studio's polled
+            // dashboard re-emits the same warning on every render. Key by
+            // (site, entryId | slug) so a renamed slug warns again.
+            const dedupKey = `${site}:${entry.id ?? entry.slug}`;
+            if (!WARNED_LEGACY_FALLBACK.has(dedupKey)) {
+                WARNED_LEGACY_FALLBACK.add(dedupKey);
+                warn(`[content-tree] Calendar entry "${entry.slug}" matched fs node by slug ` +
+                    `(no frontmatter id binding). Run \`deskwork doctor --fix=missing-frontmatter-id\` ` +
+                    `to make this binding refactor-proof.`);
+            }
+            continue;
+        }
+        // Ghost: entry exists but has no fs counterpart at slug-equals-path
+        // and no id binding. Surface it (the calendar is authoritative for
+        // "this entry exists") so the operator sees it in the tree.
+        allPaths.add(entry.slug);
+        for (const a of ancestorsOf(entry.slug))
+            allPaths.add(a);
+        overlayByPath.set(entry.slug, entry);
+    }
+    // ---- Phase 2: build nodes for every path in the union ----
+    const sortedPaths = [...allPaths].sort();
+    const nodeByPath = new Map();
+    for (const path of sortedPaths) {
+        const overlay = overlayByPath.get(path) ?? null;
+        const fsEntry = fsEntryByPath.get(path) ?? null;
+        const sb = lookup(site, path);
+        const items = [...sb.items, ...sb.secretItems];
+        const mostRecent = items.reduce((acc, it) => pickLatestMtime(acc, it.mtime), null);
+        // Title resolution: calendar wins, then fs frontmatter, then leaf.
+        const title = overlay?.title ??
+            (fsEntry?.title ?? null) ??
+            leafOfPath(path);
+        // hasOwnIndex resolution + on-disk file path resolution. Both
+        // depend on the content index's id-binding when an entry overlays
+        // — the bound file is the SSOT for both the existence check
+        // (`hasOwnIndex`) and the renderer's path display (Issue #70).
+        let hasOwnIndex = false;
+        let boundFile;
+        if (overlay !== null) {
+            boundFile = idBoundFile(overlay, contentIndex);
+            hasOwnIndex = entryHasOwnIndex(contentDir, path, fsEntry?.hasIndex ?? false, fsEntry?.hasReadme ?? false, boundFile, fsEntry !== null);
+        }
+        else if (fsEntry !== null) {
+            hasOwnIndex = fsEntry.hasIndex || fsEntry.hasReadme;
+        }
+        const node = {
+            site,
+            path,
+            title,
+            lane: overlay?.stage ?? null,
+            entry: overlay,
+            hasOwnIndex,
+            hasFsDir: fsEntry !== null,
+            scrapbookCount: items.length,
+            scrapbookMostRecentMtime: mostRecent,
+            children: [],
+        };
+        if (overlay?.slug !== undefined) {
+            // Slug only set when an entry overlays — used by the studio for
+            // the "public URL" hover hint. Honoring exactOptionalPropertyTypes:
+            // omit the field entirely rather than assigning undefined.
+            node.slug = overlay.slug;
+        }
+        if (boundFile !== undefined) {
+            // Issue #70: surface the actual on-disk path so the renderer
+            // doesn't have to reconstruct `<path>/index.md` (which is wrong
+            // for hierarchical / non-template layouts).
+            node.filePath = boundFile;
+        }
+        nodeByPath.set(path, node);
+    }
+    // Wire up parent → child links by path shape.
+    for (const path of sortedPaths) {
+        const parts = path.split('/');
+        if (parts.length === 1)
+            continue;
+        const parentPath = parts.slice(0, -1).join('/');
+        const parent = nodeByPath.get(parentPath);
+        const node = nodeByPath.get(path);
+        if (parent && node)
+            parent.children.push(node);
+    }
+    // Group root-level paths by project (their first segment).
+    const projectRootBy = new Map();
+    for (const path of sortedPaths) {
+        if (path.includes('/'))
+            continue;
+        const node = nodeByPath.get(path);
+        if (!node)
+            continue;
+        const arr = projectRootBy.get(path) ?? [];
+        arr.push(node);
+        projectRootBy.set(path, arr);
+    }
+    // Calendars with entries at deep paths and no top-level fs node
+    // need a synthetic project root at the first path segment.
+    const knownRoots = new Set(projectRootBy.keys());
+    for (const e of entries) {
+        // Compute the path the entry resolves to (id-bound or slug).
+        const idBoundPath = findIdBoundPath(e, contentIndex);
+        const entryPath = idBoundPath ?? e.slug;
+        const root = rootSegment(entryPath);
+        if (!knownRoots.has(root)) {
+            const sb = lookup(site, root);
+            const items = [...sb.items, ...sb.secretItems];
+            const mostRecent = items.reduce((acc, it) => pickLatestMtime(acc, it.mtime), null);
+            const synth = {
+                site,
+                path: root,
+                title: leafOfPath(root),
+                lane: null,
+                entry: null,
+                hasOwnIndex: false,
+                hasFsDir: fsEntryByPath.has(root),
+                scrapbookCount: items.length,
+                scrapbookMostRecentMtime: mostRecent,
+                children: [],
+            };
+            nodeByPath.set(root, synth);
+            // Re-attach orphans whose direct parent was a missing
+            // intermediate path we hadn't generated.
+            for (const path of sortedPaths) {
+                if (rootSegment(path) === root && path.includes('/')) {
+                    const parentPath = path.split('/').slice(0, -1).join('/');
+                    if (parentPath === root) {
+                        const child = nodeByPath.get(path);
+                        if (child && !synth.children.includes(child)) {
+                            synth.children.push(child);
+                        }
+                    }
+                }
+            }
+            projectRootBy.set(root, [synth]);
+            knownRoots.add(root);
+        }
+    }
+    // Sort children deterministically.
+    for (const node of nodeByPath.values()) {
+        node.children.sort((a, b) => a.path.localeCompare(b.path));
+    }
+    // Fold each project root into a ContentProject summary.
+    const projects = [];
+    for (const [rootPath, roots] of projectRootBy.entries()) {
+        if (roots.length === 0)
+            continue;
+        const root = roots[0];
+        const summary = summarizeProject(site, rootPath, root);
+        projects.push(summary);
+    }
+    projects.sort((a, b) => a.rootSlug.localeCompare(b.rootSlug));
+    return projects;
+}
+function summarizeProject(site, rootPath, root) {
+    let trackedCount = 0;
+    let totalNodes = 0;
+    let maxDepth = 0;
+    let scrapbookCount = 0;
+    const laneCounts = new Map();
+    const visit = (node, depth) => {
+        totalNodes += 1;
+        maxDepth = Math.max(maxDepth, depth);
+        scrapbookCount += node.scrapbookCount;
+        if (node.entry !== null) {
+            trackedCount += 1;
+            const stage = node.entry.stage;
+            laneCounts.set(stage, (laneCounts.get(stage) ?? 0) + 1);
+        }
+        for (const c of node.children)
+            visit(c, depth + 1);
+    };
+    visit(root, 1);
+    let predominantLane = null;
+    let bestCount = 0;
+    for (const [stage, count] of laneCounts.entries()) {
+        if (count > bestCount) {
+            predominantLane = stage;
+            bestCount = count;
+        }
+    }
+    return {
+        site,
+        rootSlug: rootPath,
+        title: root.title,
+        trackedCount,
+        totalNodes,
+        maxDepth,
+        scrapbookCount,
+        predominantLane,
+        root,
+    };
+}
+/**
+ * Helper: find the node with the given path under a project tree, or
+ * return null. Used by the studio's node-detail panel.
+ */
+export function findNode(project, path) {
+    if (project.root.path === path)
+        return project.root;
+    const queue = [...project.root.children];
+    while (queue.length > 0) {
+        const head = queue.shift();
+        if (!head)
+            continue;
+        if (head.path === path)
+            return head;
+        queue.push(...head.children);
+    }
+    return null;
+}
+/**
+ * Flatten the tree into a depth-first ordered list. See `FlatNode` in
+ * `content-tree-types.ts` for the row shape.
+ */
+export function flattenForRender(root) {
+    const out = [];
+    const walk = (node, depth, isLast) => {
+        out.push({ node, depth, isLast });
+        const last = node.children.length - 1;
+        for (let i = 0; i < node.children.length; i++) {
+            walk(node.children[i], depth + 1, i === last);
+        }
+    };
+    walk(root, 0, true);
+    return out;
+}
+//# sourceMappingURL=content-tree.js.map

package/dist/content-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"content-tree.js","sourceRoot":"","sources":["../src/content-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AAIH,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAoB,MAAM,2BAA2B,CAAC;AAC5E,OAAO,EACL,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,WAAW,EACX,UAAU,EACV,eAAe,EACf,WAAW,GACZ,MAAM,2BAA2B,CAAC;AAQnC,yEAAyE;AACzE,qEAAqE;AACrE,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAS1D,8EAA8E;AAC9E,8CAA8C;AAC9C,8EAA8E;AAC9E,EAAE;AACF,2EAA2E;AAC3E,2EAA2E;AAC3E,0EAA0E;AAC1E,qEAAqE;AACrE,oDAAoD;AACpD,EAAE;AACF,2EAA2E;AAC3E,yEAAyE;AACzE,kEAAkE;AAElE,MAAM,sBAAsB,GAAgB,IAAI,GAAG,EAAE,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,UAAU,6BAA6B;IAC3C,sBAAsB,CAAC,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,8EAA8E;AAC9E,QAAQ;AACR,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAY,EACZ,OAAiC,EACjC,MAAsB,EACtB,WAAmB,EACnB,UAAwB,EAAE;IAE1B,MAAM,MAAM,GACV,OAAO,CAAC,eAAe;QACvB,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE;YACjB,IAAI,CAAC;gBACH,OAAO,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YAC3D,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;YACxC,CAAC;QACH,CAAC,CAAC,CAAC;IAEL,MAAM,MAAM,GACV,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAC/E,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IACrD,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAExD,MAAM,YAAY,GAChB,OAAO,CAAC,YAAY,IAAI,iBAAiB,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAEhE,iEAAiE;IACjE,kDAAkD;IAClD,mEAAmE;IACnE,kEAAkE;IAClE,+DAA+D;IAC/D,kEAAkE;IAClE,kEAAkE;IAClE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,gEAAgE;IAChE,mEAAmE;IACnE,qBAAqB;IACrB,MAAM,aAAa,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEvD,oEAAoE;IACpE,2DAA2D;IAC3D,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC9B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QACzD,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;YACzB,aAAa,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;YACtC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAC1B,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,WAAW,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1D,SAAS;QACX,CAAC;QACD,8DAA8D;QAC9D,wDAAwD;QACxD,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACrC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzD,oEAAoE;YACpE,8DAA8D;YAC9D,wDAAwD;YACxD,MAAM,QAAQ,GAAG,GAAG,IAAI,IAAI,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YACrD,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1C,sBAAsB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACrC,IAAI,CACF,kCAAkC,KAAK,CAAC,IAAI,4BAA4B;oBACtE,oFAAoF;oBACpF,sCAAsC,CACzC,CAAC;YACJ,CAAC;YACD,SAAS;QACX,CAAC;QACD,oEAAoE;QACpE,mEAAmE;QACnE,4DAA4D;QAC5D,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzD,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,6DAA6D;IAC7D,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;IACzC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAElD,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAChD,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAChD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAC7B,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,EAC3C,IAAI,CACL,CAAC;QAEF,mEAAmE;QACnE,MAAM,KAAK,GACT,OAAO,EAAE,KAAK;YACd,CAAC,OAAO,EAAE,KAAK,IAAI,IAAI,CAAC;YACxB,UAAU,CAAC,IAAI,CAAC,CAAC;QAEnB,8DAA8D;QAC9D,kEAAkE;QAClE,4DAA4D;QAC5D,+DAA+D;QAC/D,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,SAA6B,CAAC;QAClC,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,SAAS,GAAG,WAAW,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAC/C,WAAW,GAAG,gBAAgB,CAC5B,UAAU,EACV,IAAI,EACJ,OAAO,EAAE,QAAQ,IAAI,KAAK,EAC1B,OAAO,EAAE,SAAS,IAAI,KAAK,EAC3B,SAAS,EACT,OAAO,KAAK,IAAI,CACjB,CAAC;QACJ,CAAC;aAAM,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YAC5B,WAAW,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,SAAS,CAAC;QACtD,CAAC;QAED,MAAM,IAAI,GAAgB;YACxB,IAAI;YACJ,IAAI;YACJ,KAAK;YACL,IAAI,EAAE,OAAO,EAAE,KAAK,IAAI,IAAI;YAC5B,KAAK,EAAE,OAAO;YACd,WAAW;YACX,QAAQ,EAAE,OAAO,KAAK,IAAI;YAC1B,cAAc,EAAE,KAAK,CAAC,MAAM;YAC5B,wBAAwB,EAAE,UAAU;YACpC,QAAQ,EAAE,EAAE;SACb,CAAC;QACF,IAAI,OAAO,EAAE,IAAI,KAAK,SAAS,EAAE,CAAC;YAChC,gEAAgE;YAChE,oEAAoE;YACpE,2DAA2D;YAC3D,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QAC3B,CAAC;QACD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,6DAA6D;YAC7D,gEAAgE;YAChE,4CAA4C;YAC5C,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC5B,CAAC;QACD,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,8CAA8C;IAC9C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACjC,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,MAAM,IAAI,IAAI;YAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,2DAA2D;IAC3D,MAAM,aAAa,GAA+B,IAAI,GAAG,EAAE,CAAC;IAC5D,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,SAAS;QACjC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,gEAAgE;IAChE,2DAA2D;IAC3D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,6DAA6D;QAC7D,MAAM,WAAW,GAAG,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,WAAW,IAAI,CAAC,CAAC,IAAI,CAAC;QACxC,MAAM,IAAI,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC9B,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;YAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAC7B,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,EAC3C,IAAI,CACL,CAAC;YACF,MAAM,KAAK,GAAgB;gBACzB,IAAI;gBACJ,IAAI,EAAE,IAAI;gBACV,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC;gBACvB,IAAI,EAAE,IAAI;gBACV,KAAK,EAAE,IAAI;gBACX,WAAW,EAAE,KAAK;gBAClB,QAAQ,EAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC;gBACjC,cAAc,EAAE,KAAK,CAAC,MAAM;gBAC5B,wBAAwB,EAAE,UAAU;gBACpC,QAAQ,EAAE,EAAE;aACb,CAAC;YACF,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC5B,sDAAsD;YACtD,yCAAyC;YACzC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;gBAC/B,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;oBACrD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC1D,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;wBACxB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBACnC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;4BAC7C,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBAC7B,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACjC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,mCAAmC;IACnC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,wDAAwD;IACxD,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;QACxD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QACvD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9D,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAY,EACZ,QAAgB,EAChB,IAAiB;IAEjB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;IAE5C,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAE,KAAa,EAAE,EAAE;QACjD,UAAU,IAAI,CAAC,CAAC;QAChB,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACrC,cAAc,IAAI,IAAI,CAAC,cAAc,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACxB,YAAY,IAAI,CAAC,CAAC;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YAC/B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;YAAE,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEf,IAAI,eAAe,GAAiB,IAAI,CAAC;IACzC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;QAClD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,eAAe,GAAG,KAAK,CAAC;YACxB,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO;QACL,IAAI;QACJ,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,YAAY;QACZ,UAAU;QACV,QAAQ;QACR,cAAc;QACd,eAAe;QACf,IAAI;KACL,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CACtB,OAAuB,EACvB,IAAY;IAEZ,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC,IAAI,CAAC;IACpD,MAAM,KAAK,GAAkB,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAiB;IAChD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,IAAiB,EAAE,KAAa,EAAE,MAAe,EAAE,EAAE;QACjE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACpB,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/doctor/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Doctor — public surface.
+ *
+ * Re-exports the rule registry, runner, types, and the schema-patch
+ * helper. Callers (the CLI command, the studio in a future phase, and
+ * tests) only import from here.
+ */
+export type { DoctorContext, DoctorInteraction, DoctorReport, DoctorRule, Finding, FindingSeverity, RepairChoice, RepairPlan, RepairResult, SkipReason, } from './types.ts';
+export { RULES, parseFixArgument, runAudit, runRepair, yesInteraction, declineInteraction, type DoctorRunOptions, } from './runner.ts';
+export { printSchemaPatchInstructions } from './schema-patch.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/doctor/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/doctor/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,YAAY,EACV,aAAa,EACb,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,OAAO,EACP,eAAe,EACf,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,UAAU,GACX,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,KAAK,EACL,gBAAgB,EAChB,QAAQ,EACR,SAAS,EACT,cAAc,EACd,kBAAkB,EAClB,KAAK,gBAAgB,GACtB,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,4BAA4B,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/doctor/index.js

@@ -0,0 +1,10 @@
+/**
+ * Doctor — public surface.
+ *
+ * Re-exports the rule registry, runner, types, and the schema-patch
+ * helper. Callers (the CLI command, the studio in a future phase, and
+ * tests) only import from here.
+ */
+export { RULES, parseFixArgument, runAudit, runRepair, yesInteraction, declineInteraction, } from "./runner.js";
+export { printSchemaPatchInstructions } from "./schema-patch.js";
+//# sourceMappingURL=index.js.map

package/dist/doctor/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/doctor/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAeH,OAAO,EACL,KAAK,EACL,gBAAgB,EAChB,QAAQ,EACR,SAAS,EACT,cAAc,EACd,kBAAkB,GAEnB,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,4BAA4B,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/doctor/project-rules.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Phase 23f — project-level doctor rule loader.
+ *
+ * Operators can drop a `.ts` module in `<projectRoot>/.deskwork/doctor/`
+ * to register a custom rule. The runner merges those project rules
+ * with the built-in rules; basename collisions let the project rule
+ * override the built-in (e.g., a project-supplied
+ * `missing-frontmatter-id.ts` replaces the bundled one).
+ *
+ * Override resolution by basename, not by `rule.id`: the basename is
+ * what the operator types; mapping it to a rule object happens in the
+ * import. We chose basename-as-key so operators can author a rule
+ * whose internal `id` differs from the file name (e.g., a project's
+ * "tighter" version of an existing rule keeps the same id for `--fix`
+ * compatibility but lives at a basename-collision path).
+ *
+ * Discovery is sync — the runner builds the merged rule list once at
+ * the start of an audit/repair run, not per finding. We use
+ * `readdirSync` + `import()` (the latter is async; we await all
+ * project rules in `loadProjectRules`).
+ *
+ * Failure mode: a project rule that fails to import (bad TypeScript,
+ * wrong default export shape) throws. The runner surfaces the throw
+ * to the operator rather than silently dropping the rule.
+ */
+import type { DoctorRule } from './types.ts';
+/**
+ * One loaded project rule plus its source basename. The basename is
+ * what the runner uses to detect override collisions with built-in
+ * rules.
+ */
+export interface LoadedProjectRule {
+    /** Filename without extension — e.g. `missing-frontmatter-id`. */
+    basename: string;
+    /** Absolute path of the source file. */
+    path: string;
+    /** Imported and type-narrowed rule. */
+    rule: DoctorRule;
+}
+/**
+ * Walk `<projectRoot>/.deskwork/doctor/` and return every rule found,
+ * in alphabetical order. Returns an empty list when the directory
+ * doesn't exist — no `.deskwork/doctor/` is the common case and must
+ * not throw.
+ */
+export declare function loadProjectRules(projectRoot: string): Promise<LoadedProjectRule[]>;
+/**
+ * Merge built-in rules with project rules. Project rules with a
+ * basename matching a built-in rule's basename REPLACE the built-in
+ * (override). Project rules with new basenames are APPENDED in their
+ * loaded order (alphabetical from `loadProjectRules`).
+ *
+ * The basename-of-built-in mapping uses each built-in rule's `id`,
+ * because every shipped rule is named after its id. If we ever ship
+ * a built-in whose file basename and id differ, this mapping will
+ * need an explicit table.
+ */
+export declare function mergeRules(builtIns: ReadonlyArray<DoctorRule>, projectRules: ReadonlyArray<LoadedProjectRule>): DoctorRule[];
+//# sourceMappingURL=project-rules.d.ts.map

package/dist/doctor/project-rules.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"project-rules.d.ts","sourceRoot":"","sources":["../../src/doctor/project-rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AA4D7C;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,kEAAkE;IAClE,QAAQ,EAAE,MAAM,CAAC;IACjB,wCAAwC;IACxC,IAAI,EAAE,MAAM,CAAC;IACb,uCAAuC;IACvC,IAAI,EAAE,UAAU,CAAC;CAClB;AAED;;;;;GAKG;AACH,wBAAsB,gBAAgB,CACpC,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAyB9B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CACxB,QAAQ,EAAE,aAAa,CAAC,UAAU,CAAC,EACnC,YAAY,EAAE,aAAa,CAAC,iBAAiB,CAAC,GAC7C,UAAU,EAAE,CAyBd"}

package/dist/doctor/project-rules.js

@@ -0,0 +1,143 @@
+/**
+ * Phase 23f — project-level doctor rule loader.
+ *
+ * Operators can drop a `.ts` module in `<projectRoot>/.deskwork/doctor/`
+ * to register a custom rule. The runner merges those project rules
+ * with the built-in rules; basename collisions let the project rule
+ * override the built-in (e.g., a project-supplied
+ * `missing-frontmatter-id.ts` replaces the bundled one).
+ *
+ * Override resolution by basename, not by `rule.id`: the basename is
+ * what the operator types; mapping it to a rule object happens in the
+ * import. We chose basename-as-key so operators can author a rule
+ * whose internal `id` differs from the file name (e.g., a project's
+ * "tighter" version of an existing rule keeps the same id for `--fix`
+ * compatibility but lives at a basename-collision path).
+ *
+ * Discovery is sync — the runner builds the merged rule list once at
+ * the start of an audit/repair run, not per finding. We use
+ * `readdirSync` + `import()` (the latter is async; we await all
+ * project rules in `loadProjectRules`).
+ *
+ * Failure mode: a project rule that fails to import (bad TypeScript,
+ * wrong default export shape) throws. The runner surfaces the throw
+ * to the operator rather than silently dropping the rule.
+ */
+var __rewriteRelativeImportExtension = (this && this.__rewriteRelativeImportExtension) || function (path, preserveJsx) {
+    if (typeof path === "string" && /^\.\.?\//.test(path)) {
+        return path.replace(/\.(tsx)$|((?:\.d)?)((?:\.[^./]+?)?)\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {
+            return tsx ? preserveJsx ? ".jsx" : ".js" : d && (!ext || !cm) ? m : (d + ext + "." + cm.toLowerCase() + "js");
+        });
+    }
+    return path;
+};
+import { existsSync, readdirSync } from 'node:fs';
+import { join } from 'node:path';
+const RULE_FILE_SUFFIX = '.ts';
+/**
+ * Narrow an unknown imported value to a `DoctorRule`. We require:
+ *   - object with non-null id+label string fields,
+ *   - audit / plan / apply functions.
+ *
+ * Failures throw a descriptive message — the operator's rule file is
+ * malformed and they need to know which file and which field.
+ */
+function assertDoctorRule(value, source) {
+    if (typeof value !== 'object' || value === null) {
+        throw new Error(`project doctor rule ${source}: default export must be an object`);
+    }
+    const id = Reflect.get(value, 'id');
+    const label = Reflect.get(value, 'label');
+    const audit = Reflect.get(value, 'audit');
+    const plan = Reflect.get(value, 'plan');
+    const apply = Reflect.get(value, 'apply');
+    if (typeof id !== 'string' || id.length === 0) {
+        throw new Error(`project doctor rule ${source}: 'id' must be a non-empty string`);
+    }
+    if (typeof label !== 'string' || label.length === 0) {
+        throw new Error(`project doctor rule ${source}: 'label' must be a non-empty string`);
+    }
+    if (typeof audit !== 'function') {
+        throw new Error(`project doctor rule ${source}: 'audit' must be a function`);
+    }
+    if (typeof plan !== 'function') {
+        throw new Error(`project doctor rule ${source}: 'plan' must be a function`);
+    }
+    if (typeof apply !== 'function') {
+        throw new Error(`project doctor rule ${source}: 'apply' must be a function`);
+    }
+    // The shape checks above narrow `value` to a DoctorRule for
+    // practical purposes; we synthesize a plain rule reference rather
+    // than `as`-cast to avoid the lint rule about type assertions.
+    return {
+        id,
+        label,
+        audit: audit.bind(value),
+        plan: plan.bind(value),
+        apply: apply.bind(value),
+    };
+}
+/**
+ * Walk `<projectRoot>/.deskwork/doctor/` and return every rule found,
+ * in alphabetical order. Returns an empty list when the directory
+ * doesn't exist — no `.deskwork/doctor/` is the common case and must
+ * not throw.
+ */
+export async function loadProjectRules(projectRoot) {
+    const dir = join(projectRoot, '.deskwork', 'doctor');
+    if (!existsSync(dir))
+        return [];
+    const entries = readdirSync(dir).filter((n) => n.endsWith(RULE_FILE_SUFFIX));
+    entries.sort();
+    const out = [];
+    for (const name of entries) {
+        const path = join(dir, name);
+        const basename = name.slice(0, -RULE_FILE_SUFFIX.length);
+        // Dynamic import via an absolute path — works under tsx (the
+        // runtime the CLI uses) and node when project rules are pre-
+        // compiled to JS adjacent paths in some future workflow.
+        const mod = await import(__rewriteRelativeImportExtension(path));
+        if (typeof mod !== 'object' || mod === null) {
+            throw new Error(`project doctor rule ${path}: import did not produce a module object`);
+        }
+        const def = Reflect.get(mod, 'default');
+        const rule = assertDoctorRule(def, path);
+        out.push({ basename, path, rule });
+    }
+    return out;
+}
+/**
+ * Merge built-in rules with project rules. Project rules with a
+ * basename matching a built-in rule's basename REPLACE the built-in
+ * (override). Project rules with new basenames are APPENDED in their
+ * loaded order (alphabetical from `loadProjectRules`).
+ *
+ * The basename-of-built-in mapping uses each built-in rule's `id`,
+ * because every shipped rule is named after its id. If we ever ship
+ * a built-in whose file basename and id differ, this mapping will
+ * need an explicit table.
+ */
+export function mergeRules(builtIns, projectRules) {
+    // Map built-in rule id (== basename today) → index, so we can
+    // splice in the override at the same position.
+    const builtInIndexByBasename = new Map();
+    for (let i = 0; i < builtIns.length; i++) {
+        builtInIndexByBasename.set(builtIns[i].id, i);
+    }
+    const merged = builtIns.slice();
+    const overriddenBasenames = new Set();
+    for (const p of projectRules) {
+        const idx = builtInIndexByBasename.get(p.basename);
+        if (idx !== undefined) {
+            merged[idx] = p.rule;
+            overriddenBasenames.add(p.basename);
+        }
+    }
+    for (const p of projectRules) {
+        if (overriddenBasenames.has(p.basename))
+            continue;
+        merged.push(p.rule);
+    }
+    return merged;
+}
+//# sourceMappingURL=project-rules.js.map

package/dist/doctor/project-rules.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"project-rules.js","sourceRoot":"","sources":["../../src/doctor/project-rules.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;;;;;;;;;AAEH,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAClD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGjC,MAAM,gBAAgB,GAAG,KAAK,CAAC;AAE/B;;;;;;;GAOG;AACH,SAAS,gBAAgB,CAAC,KAAc,EAAE,MAAc;IACtD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CACb,uBAAuB,MAAM,oCAAoC,CAClE,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC1C,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CACb,uBAAuB,MAAM,mCAAmC,CACjE,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,KAAK,CACb,uBAAuB,MAAM,sCAAsC,CACpE,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CACb,uBAAuB,MAAM,8BAA8B,CAC5D,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACb,uBAAuB,MAAM,6BAA6B,CAC3D,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CACb,uBAAuB,MAAM,8BAA8B,CAC5D,CAAC;IACJ,CAAC;IACD,4DAA4D;IAC5D,kEAAkE;IAClE,+DAA+D;IAC/D,OAAO;QACL,EAAE;QACF,KAAK;QACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;QACtB,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;KACzB,CAAC;AACJ,CAAC;AAgBD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,WAAmB;IAEnB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;IACrD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAEhC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAC7E,OAAO,CAAC,IAAI,EAAE,CAAC;IAEf,MAAM,GAAG,GAAwB,EAAE,CAAC;IACpC,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACzD,6DAA6D;QAC7D,6DAA6D;QAC7D,yDAAyD;QACzD,MAAM,GAAG,GAAY,MAAM,MAAM,kCAAC,IAAI,EAAC,CAAC;QACxC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YAC5C,MAAM,IAAI,KAAK,CACb,uBAAuB,IAAI,0CAA0C,CACtE,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzC,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CACxB,QAAmC,EACnC,YAA8C;IAE9C,8DAA8D;IAC9D,+CAA+C;IAC/C,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,sBAAsB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,MAAM,MAAM,GAAiB,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC9C,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;IAE9C,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACnD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;YACrB,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,IAAI,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;YAAE,SAAS;QAClD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}