@opensip-cli/graph 0.1.0

package/dist/cli/orchestrate/incremental-merge.js

@@ -0,0 +1,236 @@
+/**
+ * Wave-4 incremental algorithm helpers.
+ *
+ * Self-contained: the closure-expansion fixpoint, occurrence merging,
+ * and edge stitching for the incremental rebuild path. All functions
+ * here are called by `catalog-builder.ts`; nothing else in the
+ * orchestrator subtree depends on them.
+ */
+import { join, relative, sep } from 'node:path';
+import { logger } from '@opensip-cli/core';
+import { ownerEdgeKey } from './edge-identity.js';
+/**
+ * Expand the re-walk closure to a fixpoint. Starts with the directly
+ * changed files; on each iteration walks the closure, finds hashes
+ * that vanished, scans cached edges for any that still point at
+ * vanished hashes, and adds those callers to the closure. Stops when
+ * no new dependents are discovered.
+ *
+ * @throws {Error} When the incremental walk produces no result for a
+ *   non-empty closure (a logic invariant violation in the walker).
+ */
+export function expandClosureToFixpoint(input) {
+    const { adapter, discovery, cachedCatalog, parsedProject, changedFilesAbs } = input;
+    const closureRel = new Set(changedFilesAbs.map((p) => relative(discovery.projectDirAbs, p).split(sep).join('/')));
+    const closureAbs = new Set(changedFilesAbs);
+    const cachedHashesByFile = groupCachedHashesByFile(cachedCatalog);
+    // Loop-invariant context for the per-iteration closure expansion; only
+    // `walked` changes between iterations.
+    const ctx = {
+        cachedCatalog,
+        closureRel,
+        closureAbs,
+        cachedHashesByFile,
+        projectDirAbs: discovery.projectDirAbs,
+    };
+    let walked = null;
+    // Iterate to fixpoint. On a typical 1-file change, this loop runs
+    // exactly once — a file's hashes generally don't reach into
+    // unchanged callers' edges. Worst case is bounded by file count
+    // (each iteration adds at least one file).
+    for (;;) {
+        walked = adapter.walkProject({
+            project: parsedProject,
+            files: discovery.files.filter((p) => closureAbs.has(p)),
+            projectDirAbs: discovery.projectDirAbs,
+        });
+        const grew = expandClosureOnce(walked, ctx);
+        if (!grew)
+            break;
+    }
+    /* v8 ignore next 3 */
+    if (!walked) {
+        throw new Error('incremental walk produced no result; closure was empty');
+    }
+    return { walked, closureRel };
+}
+function expandClosureOnce(walked, ctx) {
+    const { cachedCatalog, closureRel, closureAbs, cachedHashesByFile, projectDirAbs } = ctx;
+    const newHashes = collectHashesFromOccurrences(walked.occurrences);
+    const staleHashes = collectStaleHashes(closureRel, cachedHashesByFile, newHashes);
+    // @fitness-ignore-next-line silent-early-returns -- `expandClosureOnce` returns boolean as its documented "did the closure grow this iteration?" contract; `false` is the fixed-point signal driving the outer expansion loop, not a hidden failure.
+    if (staleHashes.size === 0)
+        return false;
+    const newDependents = findEdgeDependents(cachedCatalog, staleHashes, closureRel);
+    // @fitness-ignore-next-line silent-early-returns -- same boolean "did closure grow?" contract as above; no new dependents means "fixed point reached".
+    if (newDependents.length === 0)
+        return false;
+    /* v8 ignore start */
+    let grew = false;
+    for (const dep of newDependents) {
+        if (closureRel.has(dep))
+            continue;
+        closureRel.add(dep);
+        // Use path.join so the result uses platform-native separators —
+        // string concat + replace would leave backslashes from projectDirAbs
+        // intact on Windows and produce a mixed-separator path that never
+        // matches discovery.files entries.
+        closureAbs.add(join(projectDirAbs, dep));
+        grew = true;
+    }
+    if (grew) {
+        logger.info({
+            evt: 'graph.cache.incremental.expand',
+            module: 'graph:cache',
+            addedDependents: newDependents.length,
+            closureSize: closureRel.size,
+        });
+    }
+    return grew;
+    /* v8 ignore stop */
+}
+function collectHashesFromOccurrences(functions) {
+    const out = new Set();
+    for (const occs of Object.values(functions)) {
+        if (!occs)
+            continue;
+        for (const o of occs)
+            out.add(o.bodyHash);
+    }
+    return out;
+}
+function collectStaleHashes(closureRel, cachedHashesByFile, newHashes) {
+    const stale = new Set();
+    for (const fileRel of closureRel) {
+        const cachedHashes = cachedHashesByFile.get(fileRel);
+        if (!cachedHashes)
+            continue;
+        for (const h of cachedHashes) {
+            if (!newHashes.has(h))
+                stale.add(h);
+        }
+    }
+    return stale;
+}
+function groupCachedHashesByFile(catalog) {
+    const out = new Map();
+    for (const occs of Object.values(catalog.functions)) {
+        if (!occs)
+            continue;
+        for (const o of occs) {
+            let set = out.get(o.filePath);
+            if (!set) {
+                set = new Set();
+                out.set(o.filePath, set);
+            }
+            set.add(o.bodyHash);
+        }
+    }
+    return out;
+}
+/**
+ * Find unchanged files whose cached edges have any `to` containing
+ * a hash from `staleHashes`. Used by the incremental closure
+ * expansion: if file A's cached edges point at a hash that no longer
+ * exists, A must be re-walked too.
+ */
+function findEdgeDependents(catalog, staleHashes, alreadyClosed) {
+    const dependents = new Set();
+    for (const occs of Object.values(catalog.functions)) {
+        if (!occs)
+            continue;
+        for (const o of occs) {
+            if (alreadyClosed.has(o.filePath))
+                continue;
+            if (dependents.has(o.filePath))
+                continue;
+            if (occHasEdgeIntoStale(o, staleHashes))
+                dependents.add(o.filePath);
+        }
+    }
+    return [...dependents].sort();
+}
+function occHasEdgeIntoStale(occ, staleHashes) {
+    for (const edge of occ.calls) {
+        for (const target of edge.to) {
+            if (staleHashes.has(target))
+                return true;
+        }
+    }
+    return false;
+}
+/**
+ * Merge occurrences: for files in `closureRel`, take the freshly-
+ * walked entries; for everything else, take the cached entries.
+ * Re-keys by simpleName so the catalog shape matches the full-rebuild
+ * output.
+ */
+export function mergeOccurrences(cachedCatalog, walkedFunctions, closureRel) {
+    const out = Object.create(null);
+    // Lift cached entries for files NOT in the closure.
+    for (const [name, occs] of Object.entries(cachedCatalog.functions)) {
+        if (!occs)
+            continue;
+        for (const o of occs) {
+            if (closureRel.has(o.filePath))
+                continue;
+            pushOccurrence(out, name, o);
+        }
+    }
+    // Add freshly-walked entries for closure files.
+    for (const [name, occs] of Object.entries(walkedFunctions)) {
+        if (!occs)
+            continue;
+        for (const o of occs)
+            pushOccurrence(out, name, o);
+    }
+    return out;
+}
+function pushOccurrence(out, name, occ) {
+    let arr = out[name];
+    if (!arr) {
+        arr = [];
+        out[name] = arr;
+    }
+    arr.push(occ);
+}
+/**
+ * Stitch resolved edges into closure files; restore cached edges for
+ * unchanged files. The merged catalog already has cached occurrences
+ * for unchanged files; we just preserve their `calls` array.
+ */
+export function mergeResolvedAndCachedEdges(merged, cached, edgesByOwner, closureRel) {
+    // Build a quick index of cached occurrences by bodyHash so we can
+    // look up the right cached calls without scanning the catalog
+    // per-occurrence.
+    const cachedByOwner = new Map();
+    for (const occs of Object.values(cached.functions)) {
+        if (!occs)
+            continue;
+        for (const o of occs)
+            cachedByOwner.set(ownerEdgeKey(o.bodyHash, o.filePath), o);
+    }
+    const out = Object.create(null);
+    for (const [name, occs] of Object.entries(merged.functions)) {
+        if (!occs)
+            continue;
+        const arr = [];
+        for (const o of occs) {
+            const ownerKey = ownerEdgeKey(o.bodyHash, o.filePath);
+            if (closureRel.has(o.filePath)) {
+                // Closure files keep their freshly-resolved edges.
+                arr.push({ ...o, calls: edgesByOwner.get(ownerKey) ?? [] });
+            }
+            else {
+                // Unchanged files: restore cached calls. The key matched
+                // because we lifted the cached occurrence into the merged
+                // catalog before resolver dispatch.
+                const cachedOcc = cachedByOwner.get(ownerKey);
+                arr.push({ ...o, calls: cachedOcc?.calls ?? [] });
+            }
+        }
+        out[name] = arr;
+    }
+    return out;
+}
+//# sourceMappingURL=incremental-merge.js.map

package/dist/cli/orchestrate/incremental-merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"incremental-merge.js","sourceRoot":"","sources":["../../../src/cli/orchestrate/incremental-merge.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAEhD,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAE3C,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAuBlD;;;;;;;;;GASG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAmB;IACzD,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,eAAe,EAAE,GAAG,KAAK,CAAC;IACpF,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CACtF,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;IAC5C,MAAM,kBAAkB,GAAG,uBAAuB,CAAC,aAAa,CAAC,CAAC;IAClE,uEAAuE;IACvE,uCAAuC;IACvC,MAAM,GAAG,GAA4B;QACnC,aAAa;QACb,UAAU;QACV,UAAU;QACV,kBAAkB;QAClB,aAAa,EAAE,SAAS,CAAC,aAAa;KACvC,CAAC;IAEF,IAAI,MAAM,GAAsB,IAAI,CAAC;IACrC,kEAAkE;IAClE,4DAA4D;IAC5D,gEAAgE;IAChE,2CAA2C;IAC3C,SAAS,CAAC;QACR,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC;YAC3B,OAAO,EAAE,aAAa;YACtB,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvD,aAAa,EAAE,SAAS,CAAC,aAAa;SACvC,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI;YAAE,MAAM;IACnB,CAAC;IACD,sBAAsB;IACtB,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AAChC,CAAC;AAWD,SAAS,iBAAiB,CAAC,MAAkB,EAAE,GAA4B;IACzE,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,kBAAkB,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC;IACzF,MAAM,SAAS,GAAG,4BAA4B,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IACnE,MAAM,WAAW,GAAG,kBAAkB,CAAC,UAAU,EAAE,kBAAkB,EAAE,SAAS,CAAC,CAAC;IAClF,qPAAqP;IACrP,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,MAAM,aAAa,GAAG,kBAAkB,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;IACjF,uJAAuJ;IACvJ,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE7C,qBAAqB;IACrB,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAClC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,gEAAgE;QAChE,qEAAqE;QACrE,kEAAkE;QAClE,mCAAmC;QACnC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;IACD,IAAI,IAAI,EAAE,CAAC;QACT,MAAM,CAAC,IAAI,CAAC;YACV,GAAG,EAAE,gCAAgC;YACrC,MAAM,EAAE,aAAa;YACrB,eAAe,EAAE,aAAa,CAAC,MAAM;YACrC,WAAW,EAAE,UAAU,CAAC,IAAI;SAC7B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;IACZ,oBAAoB;AACtB,CAAC;AAED,SAAS,4BAA4B,CACnC,SAA+C;IAE/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,kBAAkB,CACzB,UAA+B,EAC/B,kBAA4D,EAC5D,SAA8B;IAE9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;QACjC,MAAM,YAAY,GAAG,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrD,IAAI,CAAC,YAAY;YAAE,SAAS;QAC5B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,uBAAuB,CAAC,OAAgB;IAC/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC9B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;gBAChB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CACzB,OAAgB,EAChB,WAAgC,EAChC,aAAkC;IAElC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAC5C,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACzC,IAAI,mBAAmB,CAAC,CAAC,EAAE,WAAW,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAuB,EAAE,WAAgC;IACpF,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,aAAsB,EACtB,eAAqD,EACrD,UAA+B;IAE/B,MAAM,GAAG,GAAyC,MAAM,CAAC,MAAM,CAAC,IAAI,CAGnE,CAAC;IACF,oDAAoD;IACpD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;QACnE,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACzC,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD,gDAAgD;IAChD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;QAC3D,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,cAAc,CACrB,GAAyC,EACzC,IAAY,EACZ,GAAuB;IAEvB,IAAI,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,EAAE,CAAC;QACT,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IAClB,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CACzC,MAAe,EACf,MAAe,EACf,YAAsD,EACtD,UAA+B;IAE/B,kEAAkE;IAClE,8DAA8D;IAC9D,kBAAkB;IAClB,MAAM,aAAa,GAAG,IAAI,GAAG,EAA8B,CAAC;IAC5D,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QACnD,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,GAAG,GAAyC,MAAM,CAAC,MAAM,CAAC,IAAI,CAGnE,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,GAAG,GAAyB,EAAE,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;YACtD,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,mDAAmD;gBACnD,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC9D,CAAC;iBAAM,CAAC;gBACN,yDAAyD;gBACzD,0DAA0D;gBAC1D,oCAAoC;gBACpC,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC9C,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/cli/orchestrate/partition-chunk.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Leaf partition-chunk primitives for the flat-monorepo strategies
+ * (`flat-monorepo-strategy.ts`).
+ *
+ * Hoisted out of `flat-monorepo-strategy.ts` (originally so the ADR-0045
+ * community-partition prototype could reuse `chunkByCount` cycle-free; the
+ * prototype was discarded by measurement, but the extraction is a harmless
+ * leaf and any future partition strategy reuses it the same way).
+ * Behavior-preserving move — `flat-monorepo-strategy.test.ts` is the
+ * refactor canary.
+ */
+/**
+ * Synthetic partition — the unit that gets handed to a child process in
+ * the flat-large fan-out. `id` is suitable as a display label and a
+ * cache-key segment; `files` are absolute paths.
+ */
+export interface SyntheticPartition {
+    readonly id: string;
+    readonly files: readonly string[];
+}
+/**
+ * Default chunk size for `file-count-chunks` and `hybrid` sub-partitioning.
+ * Chosen at 2000 to stay well below the 2500-file heap-elevation threshold —
+ * each partition runs in a child process with a default V8 heap (no
+ * elevation needed at this size).
+ */
+export declare const DEFAULT_CHUNK_SIZE = 2000;
+/**
+ * Sort `files` lexicographically (stable) and split into chunks of
+ * `chunkSize`. Partition ids follow the `chunk-N` contract (`chunk-0`,
+ * `chunk-1`, …) that `hybrid` sub-partition ids (`<parent>.chunk-N`)
+ * concatenate onto — the id scheme is load-bearing for fragment-cache
+ * keys, so it must not drift.
+ */
+export declare function chunkByCount(files: readonly string[], chunkSize: number): readonly SyntheticPartition[];
+//# sourceMappingURL=partition-chunk.d.ts.map

package/dist/cli/orchestrate/partition-chunk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition-chunk.d.ts","sourceRoot":"","sources":["../../../src/cli/orchestrate/partition-chunk.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,OAAO,CAAC;AAEvC;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,SAAS,EAAE,MAAM,GAChB,SAAS,kBAAkB,EAAE,CAU/B"}

package/dist/cli/orchestrate/partition-chunk.js

@@ -0,0 +1,37 @@
+/**
+ * Leaf partition-chunk primitives for the flat-monorepo strategies
+ * (`flat-monorepo-strategy.ts`).
+ *
+ * Hoisted out of `flat-monorepo-strategy.ts` (originally so the ADR-0045
+ * community-partition prototype could reuse `chunkByCount` cycle-free; the
+ * prototype was discarded by measurement, but the extraction is a harmless
+ * leaf and any future partition strategy reuses it the same way).
+ * Behavior-preserving move — `flat-monorepo-strategy.test.ts` is the
+ * refactor canary.
+ */
+/**
+ * Default chunk size for `file-count-chunks` and `hybrid` sub-partitioning.
+ * Chosen at 2000 to stay well below the 2500-file heap-elevation threshold —
+ * each partition runs in a child process with a default V8 heap (no
+ * elevation needed at this size).
+ */
+export const DEFAULT_CHUNK_SIZE = 2000;
+/**
+ * Sort `files` lexicographically (stable) and split into chunks of
+ * `chunkSize`. Partition ids follow the `chunk-N` contract (`chunk-0`,
+ * `chunk-1`, …) that `hybrid` sub-partition ids (`<parent>.chunk-N`)
+ * concatenate onto — the id scheme is load-bearing for fragment-cache
+ * keys, so it must not drift.
+ */
+export function chunkByCount(files, chunkSize) {
+    const sorted = [...files].sort();
+    const out = [];
+    for (let i = 0; i < sorted.length; i += chunkSize) {
+        out.push({
+            id: `chunk-${String(out.length)}`,
+            files: sorted.slice(i, i + chunkSize),
+        });
+    }
+    return out;
+}
+//# sourceMappingURL=partition-chunk.js.map

package/dist/cli/orchestrate/partition-chunk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition-chunk.js","sourceRoot":"","sources":["../../../src/cli/orchestrate/partition-chunk.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAYH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAwB,EACxB,SAAiB;IAEjB,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACjC,MAAM,GAAG,GAAyB,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QAClD,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,SAAS,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACjC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;SACtC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/cli/orchestrate/partition-files.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Partition the canonical file set across shards by longest-matching root dir.
+ *
+ * Phase 1 of graph-sharded-exact-parity. The sharded engine used to RE-DERIVE
+ * each shard's files from that package's own tsconfig — which excludes the
+ * package's `__fixtures__` tree AND (for some packages) its test files — so it
+ * silently dropped files the exact engine kept. The fix: enumerate the project
+ * once (root discovery → {@link resolveCanonicalFileSet}), then ASSIGN each
+ * canonical file to a shard here. Discovery now only supplies shard BOUNDARIES
+ * (rootDir + configPath), never the file set.
+ *
+ * Assignment rule: each file goes to the unit whose `rootDir` is its LONGEST
+ * matching path prefix (so a file under `packages/foo/src/...` lands in the
+ * `foo` unit, not a shorter-prefix ancestor unit). Files under NO unit's
+ * rootDir — root scripts, `.config`, files in packages without a tsconfig —
+ * fall into a synthetic ROOT shard anchored at the project root + root tsconfig.
+ *
+ * Invariant (asserted by callers' tests): `union(shard.files) === canonicalFiles`
+ * and every file lands in EXACTLY one shard — the partition is total and
+ * disjoint, which is what makes the merged sharded catalog equal the exact one.
+ */
+import type { Shard } from './shard-model.js';
+/** Stable id of the synthetic catch-all shard that owns files under no unit. */
+export declare const ROOT_SHARD_ID = ":root";
+/** A shard boundary derived from discovery: where a unit lives + its config anchor. */
+export interface ShardBoundary {
+    /** Stable unit id (e.g. `pkg:core`). MUST NOT be {@link ROOT_SHARD_ID}. */
+    readonly id: string;
+    /** Absolute root dir the unit's files live under. */
+    readonly rootDir: string;
+    /** Absolute config anchor (tsconfig.json) for the unit, if any. */
+    readonly configPathAbs?: string;
+}
+/** Inputs to {@link partitionFilesIntoShards}. */
+export interface PartitionInput {
+    /** The canonical (fixture-excluded) project-wide file set — absolute paths. */
+    readonly canonicalFiles: readonly string[];
+    /** Unit boundaries from discovery (rootDir + config anchor). */
+    readonly units: readonly ShardBoundary[];
+    /** Absolute project root — the synthetic root shard's rootDir. */
+    readonly projectRoot: string;
+    /** Absolute root config anchor (root tsconfig.json), threaded onto the root shard. */
+    readonly rootConfigPathAbs?: string;
+}
+/**
+ * Assign each canonical file to the unit whose rootDir is its longest matching
+ * prefix; files under no unit go to a synthetic ROOT shard. Returns only
+ * non-empty shards. Deterministic: shard order follows the input unit order
+ * (root shard last); each shard's files preserve canonical input order.
+ */
+export declare function partitionFilesIntoShards(input: PartitionInput): Shard[];
+//# sourceMappingURL=partition-files.d.ts.map

package/dist/cli/orchestrate/partition-files.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition-files.d.ts","sourceRoot":"","sources":["../../../src/cli/orchestrate/partition-files.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAIH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAE9C,gFAAgF;AAChF,eAAO,MAAM,aAAa,UAAU,CAAC;AAErC,uFAAuF;AACvF,MAAM,WAAW,aAAa;IAC5B,2EAA2E;IAC3E,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,qDAAqD;IACrD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,mEAAmE;IACnE,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CACjC;AAED,kDAAkD;AAClD,MAAM,WAAW,cAAc;IAC7B,+EAA+E;IAC/E,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,gEAAgE;IAChE,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,kEAAkE;IAClE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,sFAAsF;IACtF,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACrC;AAsCD;;;;;GAKG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,cAAc,GAAG,KAAK,EAAE,CAoCvE"}

package/dist/cli/orchestrate/partition-files.js

@@ -0,0 +1,94 @@
+/**
+ * Partition the canonical file set across shards by longest-matching root dir.
+ *
+ * Phase 1 of graph-sharded-exact-parity. The sharded engine used to RE-DERIVE
+ * each shard's files from that package's own tsconfig — which excludes the
+ * package's `__fixtures__` tree AND (for some packages) its test files — so it
+ * silently dropped files the exact engine kept. The fix: enumerate the project
+ * once (root discovery → {@link resolveCanonicalFileSet}), then ASSIGN each
+ * canonical file to a shard here. Discovery now only supplies shard BOUNDARIES
+ * (rootDir + configPath), never the file set.
+ *
+ * Assignment rule: each file goes to the unit whose `rootDir` is its LONGEST
+ * matching path prefix (so a file under `packages/foo/src/...` lands in the
+ * `foo` unit, not a shorter-prefix ancestor unit). Files under NO unit's
+ * rootDir — root scripts, `.config`, files in packages without a tsconfig —
+ * fall into a synthetic ROOT shard anchored at the project root + root tsconfig.
+ *
+ * Invariant (asserted by callers' tests): `union(shard.files) === canonicalFiles`
+ * and every file lands in EXACTLY one shard — the partition is total and
+ * disjoint, which is what makes the merged sharded catalog equal the exact one.
+ */
+import { toPosixPath } from '../../cross-package/posix-path.js';
+/** Stable id of the synthetic catch-all shard that owns files under no unit. */
+export const ROOT_SHARD_ID = ':root';
+/**
+ * True when `dir` is a path-prefix of `file` at a SEGMENT boundary — i.e. `file`
+ * is `dir` itself or lives under it. Avoids the `/foo` ⊂ `/foobar` false match
+ * by requiring the prefix to end at a `/` boundary.
+ */
+function isUnderDir(file, dir) {
+    if (file === dir)
+        return true;
+    const withSlash = dir.endsWith('/') ? dir : `${dir}/`;
+    return file.startsWith(withSlash);
+}
+/**
+ * Find the unit whose rootDir is the LONGEST matching prefix of `filePosix`, or
+ * `undefined` when the file is under no unit (→ the synthetic root shard).
+ */
+function longestMatchingUnitId(filePosix, normUnits) {
+    let bestId;
+    let bestLen = -1;
+    for (const { unit, rootPosix } of normUnits) {
+        if (isUnderDir(filePosix, rootPosix) && rootPosix.length > bestLen) {
+            bestLen = rootPosix.length;
+            bestId = unit.id;
+        }
+    }
+    return bestId;
+}
+/**
+ * Assign each canonical file to the unit whose rootDir is its longest matching
+ * prefix; files under no unit go to a synthetic ROOT shard. Returns only
+ * non-empty shards. Deterministic: shard order follows the input unit order
+ * (root shard last); each shard's files preserve canonical input order.
+ */
+export function partitionFilesIntoShards(input) {
+    const { canonicalFiles, units, projectRoot, rootConfigPathAbs } = input;
+    // Pre-normalize unit rootDirs once; index by id to accumulate file buckets.
+    const normUnits = units.map((u) => ({ unit: u, rootPosix: toPosixPath(u.rootDir) }));
+    const buckets = new Map();
+    for (const u of units)
+        buckets.set(u.id, []);
+    const rootBucket = [];
+    for (const file of canonicalFiles) {
+        const bestId = longestMatchingUnitId(toPosixPath(file), normUnits);
+        if (bestId === undefined)
+            rootBucket.push(file);
+        else
+            buckets.get(bestId).push(file);
+    }
+    const shards = [];
+    for (const u of units) {
+        const files = buckets.get(u.id);
+        if (files.length > 0) {
+            shards.push({
+                id: u.id,
+                rootDir: u.rootDir,
+                files,
+                ...(u.configPathAbs === undefined ? {} : { configPathAbs: u.configPathAbs }),
+            });
+        }
+    }
+    if (rootBucket.length > 0) {
+        shards.push({
+            id: ROOT_SHARD_ID,
+            rootDir: projectRoot,
+            files: rootBucket,
+            ...(rootConfigPathAbs === undefined ? {} : { configPathAbs: rootConfigPathAbs }),
+        });
+    }
+    return shards;
+}
+//# sourceMappingURL=partition-files.js.map

package/dist/cli/orchestrate/partition-files.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partition-files.js","sourceRoot":"","sources":["../../../src/cli/orchestrate/partition-files.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AAIhE,gFAAgF;AAChF,MAAM,CAAC,MAAM,aAAa,GAAG,OAAO,CAAC;AAwBrC;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAY,EAAE,GAAW;IAC3C,IAAI,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,SAAS,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;IACtD,OAAO,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;AACpC,CAAC;AAQD;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,SAAiB,EACjB,SAA8B;IAE9B,IAAI,MAA0B,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;IACjB,KAAK,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,SAAS,EAAE,CAAC;QAC5C,IAAI,UAAU,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;YACnE,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC;YAC3B,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAqB;IAC5D,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,GAAG,KAAK,CAAC;IAExE,4EAA4E;IAC5E,MAAM,SAAS,GAAe,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7C,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,qBAAqB,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC;QACnE,IAAI,MAAM,KAAK,SAAS;YAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAC3C,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QACjC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,KAAK;gBACL,GAAG,CAAC,CAAC,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;aAC7E,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC;YACV,EAAE,EAAE,aAAa;YACjB,OAAO,EAAE,WAAW;YACpB,KAAK,EAAE,UAAU;YACjB,GAAG,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,iBAAiB,EAAE,CAAC;SACjF,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/cli/orchestrate/resolution-trace.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Per-boundary-call resolution trace (debug-only). The cross-shard counterpart
+ * of graph-typescript's `traceResolveDecl`: when `GRAPH_SITE_LOG` points at a
+ * file, every `resolveOne` decision appends one TSV row keyed by the full
+ * project-relative `ownerFile:line:column` so the exact and sharded logs join
+ * exactly. OFF with zero cost when the env var is unset.
+ */
+import type { CrossBoundaryCall } from '../../types.js';
+/** Append one resolveOne decision row when GRAPH_SITE_LOG is set; else a no-op. */
+export declare function traceResolveOne(bc: CrossBoundaryCall, branch: string, to: readonly string[]): void;
+//# sourceMappingURL=resolution-trace.d.ts.map

package/dist/cli/orchestrate/resolution-trace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolution-trace.d.ts","sourceRoot":"","sources":["../../../src/cli/orchestrate/resolution-trace.ts"],"names":[],"mappings":"AACA;;;;;;GAMG;AAKH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAExD,mFAAmF;AACnF,wBAAgB,eAAe,CAC7B,EAAE,EAAE,iBAAiB,EACrB,MAAM,EAAE,MAAM,EACd,EAAE,EAAE,SAAS,MAAM,EAAE,GACpB,IAAI,CAaN"}

package/dist/cli/orchestrate/resolution-trace.js

@@ -0,0 +1,27 @@
+// @fitness-ignore-file env-via-registry -- debug-only diagnostic harness, opt-in via the GRAPH_SITE_LOG / GRAPH_ENGINE env vars; NOT production configuration. Reading process.env directly is intentional and isolated to this one module so the cross-shard resolver stays registry-clean. See docs/internal/graph-resolution-trace.md.
+/**
+ * Per-boundary-call resolution trace (debug-only). The cross-shard counterpart
+ * of graph-typescript's `traceResolveDecl`: when `GRAPH_SITE_LOG` points at a
+ * file, every `resolveOne` decision appends one TSV row keyed by the full
+ * project-relative `ownerFile:line:column` so the exact and sharded logs join
+ * exactly. OFF with zero cost when the env var is unset.
+ */
+/* v8 ignore start -- debug-only; exercised manually via GRAPH_SITE_LOG, never in the test suite */
+import { appendFileSync } from 'node:fs';
+/** Append one resolveOne decision row when GRAPH_SITE_LOG is set; else a no-op. */
+export function traceResolveOne(bc, branch, to) {
+    const logPath = process.env.GRAPH_SITE_LOG;
+    if (logPath === undefined)
+        return;
+    const line = [
+        `${process.env.GRAPH_ENGINE ?? '?'}:resolveOne`,
+        `${bc.ownerFile}:${String(bc.line)}:${String(bc.column)}`,
+        bc.calleeName,
+        `branch=${branch}`,
+        `spec=${bc.importSpecifier ?? '-'}`,
+        `out=${to.length > 0 ? to[0]?.slice(0, 10) : 'DECLINE'}`,
+    ].join('\t') + '\n';
+    appendFileSync(logPath, line);
+}
+/* v8 ignore stop */
+//# sourceMappingURL=resolution-trace.js.map

package/dist/cli/orchestrate/resolution-trace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolution-trace.js","sourceRoot":"","sources":["../../../src/cli/orchestrate/resolution-trace.ts"],"names":[],"mappings":"AAAA,0UAA0U;AAC1U;;;;;;GAMG;AAEH,mGAAmG;AACnG,OAAO,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAIzC,mFAAmF;AACnF,MAAM,UAAU,eAAe,CAC7B,EAAqB,EACrB,MAAc,EACd,EAAqB;IAErB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC;IAC3C,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO;IAClC,MAAM,IAAI,GACR;QACE,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,IAAI,GAAG,aAAa;QAC/C,GAAG,EAAE,CAAC,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE;QACzD,EAAE,CAAC,UAAU;QACb,UAAU,MAAM,EAAE;QAClB,QAAQ,EAAE,CAAC,eAAe,IAAI,GAAG,EAAE;QACnC,OAAO,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE;KACzD,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACtB,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AAChC,CAAC;AACD,oBAAoB"}

package/dist/cli/orchestrate/shard-model.d.ts

@@ -0,0 +1,99 @@
+/**
+ * Shard model and the serializable worker-boundary contract.
+ *
+ * A sharded build splits a multi-package project into independent shards
+ * (one workspace package, one `--packages` unit, or one flat-monorepo
+ * partition), builds each in its own worker process, and merges the
+ * per-shard catalog fragments — recovering the cross-package edges the
+ * old fan-out modes silently dropped.
+ *
+ * The load-bearing constraint: a worker process cannot hand back a
+ * `ts.Node` / `ts.Program` (not structured-cloneable). So every type that
+ * crosses the worker boundary here is JSON-safe by construction — a
+ * primitive, an array, or a `Catalog` (already the plain shape persisted
+ * to the datastore today). The boundary carries DATA, never ASTs.
+ *
+ * Lifecycle:
+ *   discovery → Shard[]                      (workspace/packages/partition)
+ *   worker(Shard) → ShardBuildResult          (Phase 1, per process)
+ *   merge(fragments) + resolve(boundaryCalls) (Phase 2, main thread)
+ *   cache(fragment by shardId+fingerprint)    (Phase 3)
+ */
+import type { Catalog, CrossBoundaryCall, ParseError, ResolutionMode } from '../../types.js';
+/**
+ * One parallelizable unit of a sharded build. The discovery strategies
+ * (workspace units, flat-monorepo partitions) map their output onto this
+ * single shape.
+ */
+export interface Shard {
+    /**
+     * Stable shard id, e.g. `'pkg:core'`, `'partition:3'`, or the synthetic
+     * catch-all `':root'` ({@link partition-files.ROOT_SHARD_ID}). Used as the
+     * per-shard fragment-cache primary key — MUST be unique across the shard set
+     * (asserted by `assertUniqueShardIds`).
+     */
+    readonly id: string;
+    /** Absolute root dir the shard's files live under. The `':root'` shard's rootDir is the project root. */
+    readonly rootDir: string;
+    /** Absolute file paths belonging to this shard (already enumerated — no re-discovery). */
+    readonly files: readonly string[];
+    /**
+     * Absolute path to the shard's config anchor (tsconfig.json, etc.), if any.
+     * For the synthetic `':root'` shard this is the ROOT tsconfig — the worker
+     * builds that shard's files (root scripts, unowned/`.config` files) against
+     * the root compiler options so they parse/resolve correctly (Phase 1).
+     */
+    readonly configPathAbs?: string;
+}
+/**
+ * The JSON spec a shard worker reads (written by the runner to a temp
+ * file, path passed via argv — file, not argv, so thousands of file
+ * paths don't overflow the command line).
+ */
+export interface ShardWorkerSpec {
+    readonly shard: Shard;
+    /**
+     * The COMMON project root all shards share. The worker computes every
+     * occurrence's project-relative `filePath` against this root (not the
+     * shard's own rootDir) so fragments from different shards align in the
+     * merged catalog.
+     */
+    readonly projectRoot: string;
+    /** Optional adapter id requested by the parent `graph --language <id>` run. */
+    readonly language?: string;
+    readonly resolutionMode: ResolutionMode;
+}
+/**
+ * The serializable result one shard worker returns. JSON-safe by
+ * construction — round-trips losslessly through
+ * `JSON.parse(JSON.stringify(result))` (the worker-boundary contract,
+ * asserted in Phase 5 tests).
+ */
+export interface ShardBuildResult {
+    readonly shardId: string;
+    /**
+     * This shard's catalog: its occurrences plus every edge the worker
+     * could resolve LOCALLY (semantic in exact mode, syntactic in fast).
+     */
+    readonly fragment: Catalog;
+    /** Per-shard files fingerprint (mtime+size) — the per-shard cache validity key. */
+    readonly fingerprint: string;
+    /**
+     * Call sites the worker could not resolve within its own files — the
+     * candidates the cross-shard pass re-resolves against the global catalog.
+     */
+    readonly boundaryCalls: readonly CrossBoundaryCall[];
+    readonly parseErrors: readonly ParseError[];
+}
+/** Per-run sharded-build statistics, mirrored into the --profile summary
+ *  (ADR-0045 measurement plane). All counts are plain numbers. */
+export interface ShardRunStats {
+    readonly shardCount: number;
+    readonly shardsBuilt: number;
+    readonly shardsCached: number;
+    /** Files per shard, sorted descending (balance metric input). */
+    readonly shardSizes: readonly number[];
+    /** Total cross-shard boundary call sites handed to the linker. */
+    readonly boundaryCallSites: number;
+}
+//# sourceMappingURL=shard-model.d.ts.map

package/dist/cli/orchestrate/shard-model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shard-model.d.ts","sourceRoot":"","sources":["../../../src/cli/orchestrate/shard-model.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAMH,OAAO,KAAK,EAAE,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAE7F;;;;GAIG;AACH,MAAM,WAAW,KAAK;IACpB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,yGAAyG;IACzG,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,0FAA0F;IAC1F,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC;;;;;OAKG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CACjC;AAED;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;IACtB;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,+EAA+E;IAC/E,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,cAAc,CAAC;CACzC;AAED;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,mFAAmF;IACnF,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B;;;OAGG;IACH,QAAQ,CAAC,aAAa,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACrD,QAAQ,CAAC,WAAW,EAAE,SAAS,UAAU,EAAE,CAAC;CAC7C;AAED;kEACkE;AAClE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,iEAAiE;IACjE,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,kEAAkE;IAClE,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;CACpC"}