@opensip-cli/graph 0.1.0

package/dist/cli/orchestrate/cross-shard-resolve.js

@@ -0,0 +1,523 @@
+/**
+ * Cross-shard merge & semantic boundary linking (plan #2, Phase 2).
+ *
+ * After the shard workers return per-shard fragments + cross-boundary
+ * call descriptors, this module:
+ *   1. merges the fragments into one unified catalog (union of occurrences,
+ *      each keeping its already-resolved intra-shard edges);
+ *   2. LINKS the boundary calls semantically against the export symbol table
+ *      ({@link ExportIndex}) + package manifest index ({@link PackageManifestIndex})
+ *      built from the merged catalog and the resolved shard set, then stitches
+ *      the recovered edges onto their owner occurrences as
+ *      `resolution: 'semantic'`, `crossShard: true`, `confidence: 'high'`.
+ *
+ * The linker emits a cross-package edge ONLY when the import specifier + callee
+ * name resolve to a UNIQUE exported occurrence in the imported package — exactly
+ * what the TypeScript type checker would conclude. On ANY ambiguity (a name with
+ * multiple matching exports the subpath can't disambiguate, a name the package
+ * does not export, a specifier pointing at an external npm package) it DECLINES
+ * and emits an unresolved (`to: []`) edge. A missing edge is safe; a phantom
+ * cross-package edge would fail the gate. This replaces the old name-only
+ * syntactic fallback, which fabricated impossible coupling edges by matching a
+ * globally-unique simple name into a package the caller never imported.
+ *
+ * Intra-shard edges retain their original (semantic, in exact mode) fidelity;
+ * relative imports are still path-pinned (already exact for same-package
+ * imports). Engine-layer and language-agnostic: it operates on plain catalog
+ * data + the descriptors' callee names / import specifiers + each package's
+ * `package.json` — no parser, no TypeScript assumptions.
+ */
+import { posix } from 'node:path';
+import { stampEngineVersion } from '../../cache/engine-version.js';
+import { computeFilesFingerprint } from '../../cache/invalidate.js';
+import { buildExportIndex } from '../../cross-package/export-index.js';
+import { resolveCrossPackageCall } from '../../cross-package/resolve.js';
+import { createMutableStats, truncateForCallEdge } from '../../lang-adapter/edge-helpers.js';
+import { assignPackages } from '../../pipeline/assign-packages.js';
+import { constrainCrossPackageEdges } from '../../pipeline/constrain-edges.js';
+import { computeSccs } from '../../pipeline/features.js';
+import { buildIndexes } from '../../pipeline/indexes.js';
+import { bucketEdgesByOwner, stitchEdgesByOwner } from './edge-identity.js';
+import { traceResolveOne } from './resolution-trace.js';
+/**
+ * Merge per-shard fragments and recover cross-package edges. The single
+ * Phase-2 entry the orchestrator calls.
+ */
+export function mergeAndResolveShards(fragments, allFiles, manifestIndex) {
+    const merged = mergeShardFragments(fragments.map((f) => f.fragment), allFiles);
+    const boundaryCalls = fragments.flatMap((f) => f.boundaryCalls);
+    return resolveCrossBoundaryCalls(merged, boundaryCalls, manifestIndex);
+}
+/**
+ * Finalize cross-package edges on a merged catalog: stamp each occurrence's
+ * owning package (`assignPackages`) then drop name-guessed cross-package edges
+ * that contradict the import graph (`constrainCrossPackageEdges`). These two
+ * pipeline steps are always applied as a pair on the post-resolve catalog — by
+ * both the sharded build (`runShardedGraph`) and the cached single-program
+ * recovery path (`cache-orchestrator`) — so they live here, the cross-package
+ * resolution module, as one helper rather than duplicated import pairs.
+ */
+export function stampAndConstrainPackages(catalog, projectRoot) {
+    return constrainCrossPackageEdges(assignPackages(catalog, projectRoot));
+}
+// ── Task 2.1: merge fragments ─────────────────────────────────────
+/**
+ * Union every fragment's `functions` map into one catalog. Each
+ * occurrence keeps its already-resolved intra-shard `calls`. Shards are
+ * disjoint by construction (distinct files), so occurrences don't
+ * conflict; a defensive dedup by occurrence IDENTITY — (bodyHash,
+ * filePath, line, column) — drops any accidental duplicate rather than
+ * double-counting.
+ *
+ * The dedup key MUST include `column`: two distinct callables can share a
+ * `(bodyHash, filePath, line)` triple when they sit on the SAME source line
+ * with BYTE-IDENTICAL bodies — e.g. `a.some((p) => p.test(x)) || b.some((p) =>
+ * p.test(x))` (two body-twin arrows on one line). `bodyHash` is a CONTENT hash,
+ * so both twins hash equally; a column-less key collapsed them into one,
+ * dropping the second occurrence the single-program engine keeps. Keying on the
+ * full occurrence identity (filePath:line:column — the same tuple the SCC graph
+ * uses as its node id) makes the merged function set byte-identical to exact
+ * (Phase 3 closed the residual 2-occurrence delta this way).
+ */
+export function mergeShardFragments(fragments, allFiles) {
+    const functions = Object.create(null);
+    const seen = new Set();
+    for (const frag of fragments)
+        addFragmentOccurrences(frag, functions, seen);
+    // Canonicalize: shards complete in nondeterministic order, so the merged
+    // function-name keys, occurrence buckets, and each occurrence's `calls` are
+    // all sorted by a stable key here. This makes the merged catalog a pure
+    // function of the fragment SET — independent of shard completion order — so
+    // cold, warm-all-cached, and warm-partial-rebuild produce a byte-identical
+    // catalog (Phase 3).
+    const canonicalFunctions = canonicalizeFunctions(functions);
+    const reExports = mergeFragmentReExports(fragments);
+    const first = fragments[0];
+    return {
+        version: '3.0',
+        tool: 'graph',
+        language: first?.language ?? 'typescript',
+        // `builtAt` is the SOLE intentionally-nondeterministic catalog field — a
+        // wall-clock stamp. It is excluded from structural determinism/equivalence
+        // comparisons (Phase 0 determinism test, Phase 4 guardrail). Everything
+        // else in this catalog is a pure function of the fragment set.
+        builtAt: new Date().toISOString(),
+        // Build-level key derived from the per-shard keys so the merged
+        // catalog invalidates when any shard's key changes. Stamped with the
+        // engine version + `mode=sharded` (same channel as the single-program
+        // exact key) so the two engines — which share the single `graph_catalog`
+        // row but build structurally incompatible catalogs — can never read each
+        // other's row: a mode switch is a clean `cacheKey` mismatch (a rebuild),
+        // never a silent cross-engine read of a clobbered row.
+        cacheKey: stampEngineVersion(`sharded-${String(fragments.length)}-${hashKeys(fragments)}`, 'sharded'),
+        filesFingerprint: computeFilesFingerprint(allFiles),
+        resolutionMode: first?.resolutionMode,
+        ...(reExports.length > 0 ? { reExports } : {}),
+        functions: canonicalFunctions,
+    };
+}
+/**
+ * Union the per-shard re-export facts into the merged catalog, deduped by full
+ * identity and sorted — so the merged set is a pure function of the fragment SET
+ * (order-independent across shard completion), keeping cold == warm. The engine's
+ * `buildExportIndex` reads these to follow cross-package re-export chains.
+ */
+function mergeFragmentReExports(fragments) {
+    const seen = new Set();
+    const out = [];
+    for (const frag of fragments) {
+        for (const r of frag.reExports ?? []) {
+            const key = `${r.fromFile}|${r.exportedName}|${r.sourceName}|${r.specifier}`;
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            out.push(r);
+        }
+    }
+    return out.sort((a, b) => Number(a.fromFile > b.fromFile) - Number(a.fromFile < b.fromFile) ||
+        Number(a.exportedName > b.exportedName) - Number(a.exportedName < b.exportedName) ||
+        Number(a.specifier > b.specifier) - Number(a.specifier < b.specifier));
+}
+/**
+ * Build a canonical copy of a merged function map: function-name keys inserted
+ * in sorted order, each function's occurrence bucket sorted by a stable key
+ * (`filePath`, then `line`, then `bodyHash`), and each occurrence's `calls`
+ * sorted by `(line, column, sorted(to))`. The catalog shape is unchanged —
+ * only the ordering becomes deterministic regardless of the order shards
+ * completed in. (JSON serialization preserves insertion order, so sorting the
+ * top-level keys is what makes the serialized catalog byte-identical.)
+ */
+function canonicalizeFunctions(functions) {
+    const out = Object.create(null);
+    for (const name of Object.keys(functions).sort()) {
+        const occs = functions[name];
+        if (!occs)
+            continue;
+        const sorted = [...occs].sort(compareOccurrences);
+        out[name] = sorted.map((occ) => ({ ...occ, calls: sortCalls(occ.calls) }));
+    }
+    return out;
+}
+/** Stable occurrence order: filePath, then line, then bodyHash. */
+function compareOccurrences(a, b) {
+    return (Number(a.filePath > b.filePath) - Number(a.filePath < b.filePath) ||
+        a.line - b.line ||
+        Number(a.bodyHash > b.bodyHash) - Number(a.bodyHash < b.bodyHash));
+}
+/** Stable edge order within an occurrence: line, then column, then sorted(to). */
+function sortCalls(calls) {
+    return [...calls].sort((a, b) => {
+        const toA = [...a.to].sort().join(',');
+        const toB = [...b.to].sort().join(',');
+        return a.line - b.line || a.column - b.column || Number(toA > toB) - Number(toA < toB);
+    });
+}
+/** Append one fragment's occurrences into the merged map, deduping by
+ *  (bodyHash, filePath, line). Extracted to keep mergeShardFragments flat. */
+function addFragmentOccurrences(frag, functions, seen) {
+    for (const [name, occs] of Object.entries(frag.functions)) {
+        if (!occs)
+            continue;
+        for (const occ of occs) {
+            const key = `${occ.bodyHash}|${occ.filePath}|${String(occ.line)}|${String(occ.column)}`;
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            const bucket = functions[name];
+            if (bucket)
+                bucket.push(occ);
+            else
+                functions[name] = [occ];
+        }
+    }
+}
+function hashKeys(fragments) {
+    // Order-independent join of shard cacheKeys (shards may complete in any
+    // order); kept short and deterministic.
+    return [...fragments.map((f) => f.cacheKey)].sort().join('+').slice(0, 64);
+}
+// ── Task 2.2: resolve cross-boundary calls ────────────────────────
+/**
+ * Resolve each cross-boundary call against the merged global catalog and
+ * stitch the recovered edge onto its owner. A recovered edge is `'semantic'`,
+ * `crossShard: true`, `confidence: 'high'` — the import specifier + callee name
+ * linked to a UNIQUE target occurrence (relative imports pin by path; bare /
+ * workspace imports pin by the imported package's export symbol table). On any
+ * ambiguity the resolver DECLINES (`to: []`) — a missing edge is safe, a phantom
+ * cross-package edge is not. Declined / external boundary calls stay unresolved
+ * but are counted (attributable).
+ */
+export function resolveCrossBoundaryCalls(merged, boundaryCalls, manifestIndex) {
+    const exportIndex = buildExportIndex(merged, manifestIndex);
+    const nameIndex = buildNameIndex(merged);
+    const knownFiles = new Set(Object.values(merged.functions)
+        .flat()
+        .map((o) => o.filePath));
+    const ctx = { exportIndex, manifestIndex, nameIndex, knownFiles };
+    const stats = createMutableStats();
+    // Resolve each boundary call to a recovered edge first (counting as we go).
+    // The stats DO count declined (`to: []`) calls — they are attributable
+    // unresolved cross-shard sites — but only RESOLVED edges are stitched into the
+    // catalog (see below).
+    const resolvedCalls = boundaryCalls.map((bc) => {
+        const edge = resolveOne(bc, ctx);
+        stats.totalCallSites++;
+        stats.apply(edge);
+        return { bc, edge };
+    });
+    // Placeholder pruning (Phase 6): a boundary call that resolved to NOTHING must
+    // NOT persist a standalone `to: []` crossShard CallEdge. The single-program
+    // (exact) engine emits no such per-call-site catalog edge — it simply has no
+    // edge there (the intra-shard `to: []` placeholder the local pass left, which
+    // exact ALSO emits for its own unresolved sites, remains and is the parity
+    // representation). Persisting ~45k empty-`to` crossShard placeholders only
+    // bloated the catalog and formed the bulk of the guardrail's `structural`
+    // (unresolved-vs-absent) divergence partition. Bucket ONLY resolved edges; a
+    // declined site contributes nothing, so its intra placeholder is left intact
+    // (matching exact) rather than replaced by a crossShard placeholder.
+    // Keyed by OCCURRENCE via the shared identity module — `ownerEdgeKey(ownerHash,
+    // ownerFile)`, never `ownerHash` alone (ADR-0003: body-twins share a hash; an
+    // owner-hash bucket would union their edges into phantom cross-package coupling).
+    const edgesByOwnerKey = bucketEdgesByOwner(resolvedCalls.filter(({ edge }) => edge.to.length > 0), ({ bc }) => ({ bodyHash: bc.ownerHash, filePath: bc.ownerFile }), ({ edge }) => edge);
+    const functions = stitchCrossShardEdges(merged.functions, edgesByOwnerKey);
+    return { catalog: { ...merged, functions }, boundaryStats: stats };
+}
+/**
+ * Resolve one cross-boundary call to a recovered edge — semantically, by
+ * linking the import specifier + callee name to a UNIQUE target occurrence, or
+ * DECLINING (`to: []`) when the link is absent or ambiguous. Three branches:
+ *
+ *  (a) RELATIVE specifier (`./x`) → pin by path against the owner's directory
+ *      (an intra-package import; already exact). Emit when ≥1 occurrence in the
+ *      resolved file matches the callee name.
+ *  (b) BARE / workspace specifier that resolves to a known workspace package P →
+ *      look the callee name up in P's export bucket: exactly 1 export → emit;
+ *      >1 → narrow by a single subpath-pinned file if possible, else decline;
+ *      0 → decline (not exported / re-export chain we don't follow).
+ *  (c) Specifier maps to no known workspace package (external npm) → unresolved.
+ *
+ * A recovered edge is `'semantic'`, `crossShard: true`, `confidence: 'high'`.
+ */
+function resolveOne(bc, ctx) {
+    const base = {
+        line: bc.line,
+        column: bc.column,
+        resolution: 'semantic',
+        text: truncateForCallEdge(bc.text),
+        discarded: bc.discarded ?? false,
+        crossShard: true,
+        confidence: 'high',
+    };
+    const spec = bc.importSpecifier;
+    // (a0) Type-attested cross-package METHOD: the checker resolved `recv.m()`'s
+    // method to a workspace `dist/*.d.ts` whose SOURCE lives in another shard, so
+    // the boundary extractor carried the mapped source file. Pin by (target file +
+    // method name) against the merged catalog. UNIQUE-or-decline, mirroring the
+    // exact engine's intra-package `pinByDtsDeclSource` — both engines route
+    // cross-package methods here, so they resolve identically.
+    if (bc.targetFile !== undefined) {
+        const candidates = ctx.nameIndex.get(bc.calleeName) ?? [];
+        const distinct = [
+            ...new Set(candidates.filter((o) => o.filePath === bc.targetFile).map((o) => o.bodyHash)),
+        ];
+        const edge = distinct.length === 1 ? { ...base, to: distinct } : { ...base, to: [] };
+        traceResolveOne(bc, 'method-target', edge.to);
+        return edge;
+    }
+    // (a) Relative import → path-pin (intra-package). UNIQUE-or-decline: a single
+    // distinct target bodyHash in the pinned file resolves; same-name ambiguity
+    // declines — identical semantics to the exact engine's file+name pin
+    // (`pinByFileAndName`), so the two engines converge (Phase 3, Option A;
+    // decline-beats-guess). Previously emitted ALL matches as a multi-target edge.
+    if (spec?.startsWith('.')) {
+        const candidates = ctx.nameIndex.get(bc.calleeName) ?? [];
+        const pinned = pinBySpecifier(bc, candidates, ctx.knownFiles);
+        const distinct = [...new Set(pinned.map((o) => o.bodyHash))];
+        const edge = distinct.length === 1 ? { ...base, to: distinct } : { ...base, to: [] };
+        traceResolveOne(bc, 'relative-pin', edge.to);
+        return edge;
+    }
+    // (b)/(c) Bare or workspace specifier → resolve to a package and link by export
+    // through the SHARED cross-package resolver the exact adapter also uses.
+    const linked = resolveCrossPackageCall({
+        importSpecifier: spec,
+        calleeName: bc.calleeName,
+        exportIndex: ctx.exportIndex,
+        manifestIndex: ctx.manifestIndex,
+    });
+    const edge = linked === undefined ? { ...base, to: [] } : { ...base, to: [linked.bodyHash] };
+    traceResolveOne(bc, 'workspace-export', edge.to);
+    return edge;
+}
+/**
+ * Pin a boundary call to specific target occurrences via its import
+ * specifier. Only RELATIVE specifiers are path-pinnable here (resolved
+ * against the owner's REAL file directory carried on the descriptor —
+ * `bc.ownerFile`, byte-identical to the owner occurrence's `filePath`);
+ * bare/package specifiers fall through to name-only resolution. Purely
+ * generic path math. Resolving against the owner's actual file (not a
+ * last-writer-wins `bodyHash→file` guess) is what keeps body-twins from
+ * pinning relative imports against the wrong twin's directory (ADR-0003).
+ */
+function pinBySpecifier(bc, candidates, knownFiles) {
+    const spec = bc.importSpecifier;
+    if (!spec?.startsWith('.'))
+        return [];
+    const resolved = posix.normalize(posix.join(posix.dirname(bc.ownerFile), spec));
+    const target = stripExt(resolved);
+    // Accept either `<target>.<ext>` or `<target>/index.<ext>`.
+    const matchesTarget = (filePath) => {
+        const fp = stripExt(filePath);
+        return fp === target || fp === `${target}/index`;
+    };
+    // Only pin when the resolved target actually exists in the catalog.
+    if (![...knownFiles].some(matchesTarget))
+        return [];
+    return candidates.filter((c) => matchesTarget(c.filePath));
+}
+function stripExt(p) {
+    return p.replace(/\.[A-Za-z0-9]+$/, '');
+}
+// ── catalog helpers ───────────────────────────────────────────────
+function buildNameIndex(catalog) {
+    const index = new Map();
+    for (const [name, occs] of Object.entries(catalog.functions)) {
+        if (occs && occs.length > 0)
+            index.set(name, occs);
+    }
+    return index;
+}
+/**
+ * Stitch cross-shard edges onto each owner occurrence, via the shared identity
+ * module keyed by `ownerEdgeKey(o.bodyHash, o.filePath)` — so ONLY the owning
+ * occurrence receives its recovered edges (body-twins in different files never
+ * smear; ADR-0003). A recovered edge REPLACES the unresolved (`to: []`)
+ * intra-shard placeholder the local resolver left at the same call site —
+ * otherwise the site would carry two edges (one unresolved, one recovered) and
+ * double-count. Resolved intra-shard edges are always kept.
+ */
+function stitchCrossShardEdges(functions, edgesByOwnerKey) {
+    return stitchEdgesByOwner(functions, edgesByOwnerKey, (o, extra) => {
+        const recoveredAt = new Set(extra.map((e) => `${String(e.line)}:${String(e.column)}`));
+        // Drop the unresolved placeholder the local pass left at a recovered site.
+        const kept = o.calls.filter((e) => !(e.to.length === 0 && recoveredAt.has(`${String(e.line)}:${String(e.column)}`)));
+        // Re-canonicalize the merged edge list — `extra` is in boundary-call
+        // (flat-map) order, which depends on shard completion order; sorting here
+        // keeps the stitched occurrence byte-identical across runs.
+        return { ...o, calls: sortCalls([...kept, ...extra]) };
+    });
+}
+/**
+ * Full structural diff of two catalogs: function set + edges + SCCs. The
+ * Phase-4 equivalence gate runs this over (sharded, exact) and asserts every
+ * partition empty. Composes the three orthogonal diffs:
+ *   - `diffFunctionSets` — occurrence-identity symmetric difference;
+ *   - `diffCatalogsByEdge` — the per-edge target diff (intra / cross);
+ *   - `diffSccs` — occId-keyed SCC membership diff (reusing the engine's own
+ *     `computeSccs` over `buildIndexes`, so the gate measures the SAME SCCs the
+ *     `cycle` rule consumes).
+ */
+export function diffCatalogs(a, b) {
+    const fnDiff = diffFunctionSets(a, b);
+    const edgeDiff = diffCatalogsByEdge(a, b);
+    const sccDifferences = diffSccs(a, b);
+    return {
+        functionsOnlyInA: fnDiff.onlyInA,
+        functionsOnlyInB: fnDiff.onlyInB,
+        intraMismatches: edgeDiff.intraMismatches,
+        crossDifferences: edgeDiff.crossDifferences,
+        sccDifferences,
+        edgeDifferences: edgeDiff.differences,
+    };
+}
+/** True when every partition of a {@link CatalogEquivalence} is empty. */
+export function isEquivalent(eq) {
+    return (eq.functionsOnlyInA.length === 0 &&
+        eq.functionsOnlyInB.length === 0 &&
+        eq.intraMismatches.length === 0 &&
+        eq.crossDifferences.length === 0 &&
+        eq.sccDifferences.length === 0);
+}
+/**
+ * Symmetric difference of the two catalogs' OCCURRENCE IDENTITY sets. Identity
+ * is `qualifiedName` when present, else `filePath:line:simpleName` — mirroring
+ * the FunctionOccurrence identity model used by `graph-catalog-diff.mjs` and
+ * the symbol index, so the in-test gate and the repo-scale diagnostic agree.
+ */
+function diffFunctionSets(a, b) {
+    const idsA = functionIdentities(a);
+    const idsB = functionIdentities(b);
+    const onlyInA = [...idsA].filter((id) => !idsB.has(id)).sort();
+    const onlyInB = [...idsB].filter((id) => !idsA.has(id)).sort();
+    return { onlyInA, onlyInB };
+}
+/** The set of occurrence identities (`qualifiedName` ?? `filePath:line:name`). */
+function functionIdentities(catalog) {
+    const ids = new Set();
+    for (const [name, occs] of Object.entries(catalog.functions)) {
+        if (!occs)
+            continue;
+        for (const o of occs)
+            ids.add(occurrenceIdentity(o, name));
+    }
+    return ids;
+}
+function occurrenceIdentity(o, simpleName) {
+    return o.qualifiedName.length > 0
+        ? o.qualifiedName
+        : `${o.filePath}:${String(o.line)}:${simpleName}`;
+}
+/**
+ * Diff the two catalogs' strongly-connected components by SORTED-MEMBER
+ * signature. Each SCC is computed via the engine's canonical `computeSccs`
+ * (occId-keyed Tarjan) over `buildIndexes(catalog)` — the exact same pass the
+ * `cycle` rule's feature column uses — then keyed by its sorted member occIds
+ * joined. The result is the symmetric difference of those signatures: a
+ * component present in one catalog but not the other (a cycle the two engines
+ * disagree on). Singletons are included by `computeSccs` but are stable across
+ * engines once the function set matches, so they don't generate noise; only a
+ * genuine membership divergence surfaces.
+ */
+function diffSccs(a, b) {
+    const sigA = sccSignatures(a);
+    const sigB = sccSignatures(b);
+    const diff = [...[...sigA].filter((s) => !sigB.has(s)), ...[...sigB].filter((s) => !sigA.has(s))];
+    return [...new Set(diff)].sort();
+}
+/** Sorted-member signatures of a catalog's SCCs (the engine's own computation). */
+function sccSignatures(catalog) {
+    const indexes = buildIndexes(catalog);
+    const signatures = new Set();
+    for (const scc of computeSccs(indexes)) {
+        signatures.add([...scc.members].sort().join('|'));
+    }
+    return signatures;
+}
+/**
+ * Diff two catalogs by edge, partitioned into intra-shard mismatches and
+ * cross-package (boundary-linked) differences. An edge is keyed by
+ * `ownerHash@line:col → sorted(to)`; a key is a difference when the two
+ * catalogs disagree on its target set. Both partitions MUST be empty for a
+ * correct sharded build vs single-program build: intra-package edges are exact
+ * in both, and semantic boundary linking reproduces the single-program build's
+ * cross-package edges verbatim (Phase 2). The partition only records WHICH side
+ * a difference falls on (cross when either edge is `crossShard`), so a
+ * regression is attributable to the linker vs a local resolver. The Phase 4
+ * equivalence guardrail (`__tests__/equivalence.test.ts`) is the live gate.
+ *
+ * `differences` additionally carries the OWNER FILE PATH + call-site line/column
+ * of every differing edge, so the real-repo equivalence guardrail can classify a
+ * divergence by owner file (test/fixture-owned ⇒ gate-invisible; production ⇒
+ * meaningful) and print the offending `file:line → target` on a budget breach.
+ * The legacy key arrays are unchanged.
+ */
+export function diffCatalogsByEdge(a, b) {
+    const ea = indexEdges(a);
+    const eb = indexEdges(b);
+    const intraMismatches = [];
+    const crossDifferences = [];
+    const differences = [];
+    const keys = new Set([...ea.keys(), ...eb.keys()]);
+    for (const key of keys) {
+        const x = ea.get(key);
+        const y = eb.get(key);
+        if (x?.to === y?.to)
+            continue; // identical (or both absent) → no difference
+        const isCross = (x?.crossShard ?? false) || (y?.crossShard ?? false);
+        (isCross ? crossDifferences : intraMismatches).push(key);
+        // Owner file path + position is the same on both sides (shared occurrence
+        // identity); take whichever side carries the edge.
+        const present = x ?? y;
+        differences.push({
+            key,
+            ownerFilePath: present?.ownerFilePath ?? '',
+            line: present?.line ?? 0,
+            column: present?.column ?? 0,
+            toA: x?.to ?? '',
+            toB: y?.to ?? '',
+            cross: isCross,
+        });
+    }
+    return { intraMismatches, crossDifferences, differences };
+}
+function indexEdges(catalog) {
+    const map = new Map();
+    for (const occs of Object.values(catalog.functions)) {
+        if (!occs)
+            continue;
+        for (const o of occs) {
+            for (const e of o.calls) {
+                const key = `${o.bodyHash}@${String(e.line)}:${String(e.column)}`;
+                map.set(key, {
+                    to: [...e.to].sort().join(','),
+                    crossShard: e.crossShard ?? false,
+                    ownerFilePath: o.filePath,
+                    line: e.line,
+                    column: e.column,
+                });
+            }
+        }
+    }
+    return map;
+}
+//# sourceMappingURL=cross-shard-resolve.js.map

package/dist/cli/orchestrate/cross-shard-resolve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-shard-resolve.js","sourceRoot":"","sources":["../../../src/cli/orchestrate/cross-shard-resolve.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAElC,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AACvE,OAAO,EAAE,uBAAuB,EAAE,MAAM,gCAAgC,CAAC;AACzE,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,oCAAoC,CAAC;AAC7F,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,0BAA0B,EAAE,MAAM,mCAAmC,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAC5E,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAmBxD;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,SAAsC,EACtC,QAA2B,EAC3B,aAAmC;IAEnC,MAAM,MAAM,GAAG,mBAAmB,CAChC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAChC,QAAQ,CACT,CAAC;IACF,MAAM,aAAa,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IAChE,OAAO,yBAAyB,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;AACzE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,yBAAyB,CAAC,OAAgB,EAAE,WAAmB;IAC7E,OAAO,0BAA0B,CAAC,cAAc,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;AAC1E,CAAC;AAED,qEAAqE;AAErE;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,mBAAmB,CACjC,SAA6B,EAC7B,QAA2B;IAE3B,MAAM,SAAS,GAAyC,MAAM,CAAC,MAAM,CAAC,IAAI,CAGzE,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,SAAS;QAAE,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IAE5E,yEAAyE;IACzE,4EAA4E;IAC5E,wEAAwE;IACxE,4EAA4E;IAC5E,2EAA2E;IAC3E,qBAAqB;IACrB,MAAM,kBAAkB,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC;IAEpD,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC3B,OAAO;QACL,OAAO,EAAE,KAAK;QACd,IAAI,EAAE,OAAO;QACb,QAAQ,EAAE,KAAK,EAAE,QAAQ,IAAI,YAAY;QACzC,yEAAyE;QACzE,2EAA2E;QAC3E,wEAAwE;QACxE,+DAA+D;QAC/D,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,gEAAgE;QAChE,qEAAqE;QACrE,sEAAsE;QACtE,yEAAyE;QACzE,yEAAyE;QACzE,yEAAyE;QACzE,uDAAuD;QACvD,QAAQ,EAAE,kBAAkB,CAC1B,WAAW,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,SAAS,CAAC,EAAE,EAC5D,SAAS,CACV;QACD,gBAAgB,EAAE,uBAAuB,CAAC,QAAQ,CAAC;QACnD,cAAc,EAAE,KAAK,EAAE,cAAc;QACrC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,SAAS,EAAE,kBAAkB;KAC9B,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,sBAAsB,CAAC,SAA6B;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAC7E,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QACjE,MAAM,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;QACjF,MAAM,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CACxE,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,qBAAqB,CAC5B,SAA+C;IAE/C,MAAM,GAAG,GAAyC,MAAM,CAAC,MAAM,CAAC,IAAI,CAGnE,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAClD,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mEAAmE;AACnE,SAAS,kBAAkB,CAAC,CAAqB,EAAE,CAAqB;IACtE,OAAO,CACL,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QACjE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAClE,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,SAAS,SAAS,CAAC,KAA0B;IAC3C,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;AACL,CAAC;AAED;8EAC8E;AAC9E,SAAS,sBAAsB,CAC7B,IAAa,EACb,SAA+C,EAC/C,IAAiB;IAEjB,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1D,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxF,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;gBACxB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,SAA6B;IAC7C,wEAAwE;IACxE,wCAAwC;IACxC,OAAO,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC7E,CAAC;AAED,qEAAqE;AAErE;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CACvC,MAAe,EACf,aAA2C,EAC3C,aAAmC;IAEnC,MAAM,WAAW,GAAG,gBAAgB,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;SAC5B,IAAI,EAAE;SACN,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAC1B,CAAC;IAEF,MAAM,GAAG,GAAmB,EAAE,WAAW,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;IAClF,MAAM,KAAK,GAAG,kBAAkB,EAAE,CAAC;IAEnC,4EAA4E;IAC5E,uEAAuE;IACvE,+EAA+E;IAC/E,uBAAuB;IACvB,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACjC,KAAK,CAAC,cAAc,EAAE,CAAC;QACvB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;IACtB,CAAC,CAAC,CAAC;IACH,+EAA+E;IAC/E,4EAA4E;IAC5E,6EAA6E;IAC7E,8EAA8E;IAC9E,2EAA2E;IAC3E,2EAA2E;IAC3E,0EAA0E;IAC1E,6EAA6E;IAC7E,6EAA6E;IAC7E,qEAAqE;IACrE,gFAAgF;IAChF,8EAA8E;IAC9E,kFAAkF;IAClF,MAAM,eAAe,GAAG,kBAAkB,CACxC,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,EACtD,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,EAChE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CACnB,CAAC;IAEF,MAAM,SAAS,GAAG,qBAAqB,CAAC,MAAM,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC;IAC3E,OAAO,EAAE,OAAO,EAAE,EAAE,GAAG,MAAM,EAAE,SAAS,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC;AACrE,CAAC;AAaD;;;;;;;;;;;;;;;GAeG;AACH,SAAS,UAAU,CAAC,EAAqB,EAAE,GAAmB;IAC5D,MAAM,IAAI,GAAG;QACX,IAAI,EAAE,EAAE,CAAC,IAAI;QACb,MAAM,EAAE,EAAE,CAAC,MAAM;QACjB,UAAU,EAAE,UAAmB;QAC/B,IAAI,EAAE,mBAAmB,CAAC,EAAE,CAAC,IAAI,CAAC;QAClC,SAAS,EAAE,EAAE,CAAC,SAAS,IAAI,KAAK;QAChC,UAAU,EAAE,IAAa;QACzB,UAAU,EAAE,MAAe;KAC5B,CAAC;IACF,MAAM,IAAI,GAAG,EAAE,CAAC,eAAe,CAAC;IAEhC,6EAA6E;IAC7E,8EAA8E;IAC9E,+EAA+E;IAC/E,4EAA4E;IAC5E,yEAAyE;IACzE,2DAA2D;IAC3D,IAAI,EAAE,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC1D,MAAM,QAAQ,GAAG;YACf,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;SAC1F,CAAC;QACF,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QACrF,eAAe,CAAC,EAAE,EAAE,eAAe,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8EAA8E;IAC9E,4EAA4E;IAC5E,qEAAqE;IACrE,wEAAwE;IACxE,+EAA+E;IAC/E,IAAI,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,cAAc,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QACrF,eAAe,CAAC,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gFAAgF;IAChF,yEAAyE;IACzE,MAAM,MAAM,GAAG,uBAAuB,CAAC;QACrC,eAAe,EAAE,IAAI;QACrB,UAAU,EAAE,EAAE,CAAC,UAAU;QACzB,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,aAAa,EAAE,GAAG,CAAC,aAAa;KACjC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC7F,eAAe,CAAC,EAAE,EAAE,kBAAkB,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IACjD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,cAAc,CACrB,EAAqB,EACrB,UAAyC,EACzC,UAA+B;IAE/B,MAAM,IAAI,GAAG,EAAE,CAAC,eAAe,CAAC;IAChC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAChF,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAClC,4DAA4D;IAC5D,MAAM,aAAa,GAAG,CAAC,QAAgB,EAAW,EAAE;QAClD,MAAM,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC9B,OAAO,EAAE,KAAK,MAAM,IAAI,EAAE,KAAK,GAAG,MAAM,QAAQ,CAAC;IACnD,CAAC,CAAC;IACF,oEAAoE;IACpE,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QAAE,OAAO,EAAE,CAAC;IACpD,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;AAC1C,CAAC;AAED,qEAAqE;AAErE,SAAS,cAAc,CAAC,OAAgB;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyC,CAAC;IAC/D,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7D,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,qBAAqB,CAC5B,SAAkE,EAClE,eAAyD;IAEzD,OAAO,kBAAkB,CAAC,SAAS,EAAE,eAAe,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE;QACjE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,2EAA2E;QAC3E,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CACzB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CACxF,CAAC;QACF,qEAAqE;QACrE,0EAA0E;QAC1E,4DAA4D;QAC5D,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC;AA0CD;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAAC,CAAU,EAAE,CAAU;IACjD,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,MAAM,cAAc,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,OAAO;QACL,gBAAgB,EAAE,MAAM,CAAC,OAAO;QAChC,gBAAgB,EAAE,MAAM,CAAC,OAAO;QAChC,eAAe,EAAE,QAAQ,CAAC,eAAe;QACzC,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;QAC3C,cAAc;QACd,eAAe,EAAE,QAAQ,CAAC,WAAW;KACtC,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,YAAY,CAAC,EAAsB;IACjD,OAAO,CACL,EAAE,CAAC,gBAAgB,CAAC,MAAM,KAAK,CAAC;QAChC,EAAE,CAAC,gBAAgB,CAAC,MAAM,KAAK,CAAC;QAChC,EAAE,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC;QAC/B,EAAE,CAAC,gBAAgB,CAAC,MAAM,KAAK,CAAC;QAChC,EAAE,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAC/B,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CACvB,CAAU,EACV,CAAU;IAEV,MAAM,IAAI,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/D,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/D,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC9B,CAAC;AAED,kFAAkF;AAClF,SAAS,kBAAkB,CAAC,OAAgB;IAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7D,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAqB,EAAE,UAAkB;IACnE,OAAO,CAAC,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;QAC/B,CAAC,CAAC,CAAC,CAAC,aAAa;QACjB,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;AACtD,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,QAAQ,CAAC,CAAU,EAAE,CAAU;IACtC,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,mFAAmF;AACnF,SAAS,aAAa,CAAC,OAAgB;IACrC,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AA0CD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAU,EAAE,CAAU;IACvD,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,gBAAgB,GAAa,EAAE,CAAC;IACtC,MAAM,WAAW,GAAqB,EAAE,CAAC;IAEzC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC3D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE;YAAE,SAAS,CAAC,6CAA6C;QAC5E,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,UAAU,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,IAAI,KAAK,CAAC,CAAC;QACrE,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzD,0EAA0E;QAC1E,mDAAmD;QACnD,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;QACvB,WAAW,CAAC,IAAI,CAAC;YACf,GAAG;YACH,aAAa,EAAE,OAAO,EAAE,aAAa,IAAI,EAAE;YAC3C,IAAI,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC;YACxB,MAAM,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC;YAC5B,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE;YAChB,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE;YAChB,KAAK,EAAE,OAAO;SACf,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,WAAW,EAAE,CAAC;AAC5D,CAAC;AAUD,SAAS,UAAU,CAAC,OAAgB;IAClC,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,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACxB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;oBACX,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;oBAC9B,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,KAAK;oBACjC,aAAa,EAAE,CAAC,CAAC,QAAQ;oBACzB,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,MAAM,EAAE,CAAC,CAAC,MAAM;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/cli/orchestrate/edge-identity.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Shared occurrence/edge IDENTITY — the ONE module that owns how call/dependency
+ * edges are keyed to their owning occurrence and stitched back onto it.
+ *
+ * WHY THIS EXISTS (the drift it closes):
+ *   ADR-0003 mandates edges be keyed by OCCURRENCE — `ownerEdgeKey(bodyHash,
+ *   filePath)` — not by `bodyHash` alone: two functions with byte-identical
+ *   bodies in different files (e.g. `stripStrings` duplicated across the language
+ *   adapters) share a hash, so a hash-only bucket UNIONS their edges, inventing
+ *   phantom cross-package coupling. The EXACT path complied (its resolver returns
+ *   an `ownerEdgeKey`-keyed map; `catalog-builder.stitchEdges` reads it the same
+ *   way). The CROSS-SHARD merge did NOT — it bucketed/stitched by `bc.ownerHash`
+ *   alone (a second, drifting keying scheme). That drift is the root cause of the
+ *   F1 ADR-0003 violation.
+ *
+ *   This module is the single home of that identity. Both engines import it; no
+ *   consumer keys edges by a bare `bodyHash`. The Phase-1 fitness check
+ *   (`no-bodyhash-keying-outside-identity`) forbids re-deriving an owner-keyed
+ *   edge map anywhere else, so the drift cannot recur.
+ *
+ * Pure: no fs, no engine state — both engines and the equivalence harness import
+ * the same helpers.
+ */
+import type { CallEdge, FunctionOccurrence } from '../../types.js';
+export { ownerEdgeKey } from '../../owner-key.js';
+/**
+ * Bucket a flat list of edge-bearing items into a `Map<ownerEdgeKey, CallEdge[]>`,
+ * keyed via {@link ownerEdgeKey} (NOT by `bodyHash` alone). `keyParts` extracts
+ * the owning occurrence's `(bodyHash, filePath)` from each item; `edgeOf`
+ * extracts the edge. Append-order within a bucket is preserved (callers sort
+ * downstream for determinism). The canonical owner-keyed bucket: every consumer
+ * routes through this instead of re-deriving an owner key inline.
+ */
+export declare function bucketEdgesByOwner<T>(items: Iterable<T>, keyParts: (item: T) => {
+    readonly bodyHash: string;
+    readonly filePath: string;
+}, edgeOf: (item: T) => CallEdge): Map<string, CallEdge[]>;
+/**
+ * Stitch recovered edges onto each occurrence, keyed by
+ * `ownerEdgeKey(o.bodyHash, o.filePath)` so ONLY the owning occurrence receives
+ * its edges (body-twins in different files never smear). `combine` decides how an
+ * occurrence's existing `calls` and its recovered edges merge (e.g. replace,
+ * concatenate, or drop-placeholder-then-concat) and returns the new occurrence —
+ * keeping the keying in one place while leaving the per-engine merge policy to
+ * the caller. An occurrence with no recovered edges is returned unchanged.
+ */
+export declare function stitchEdgesByOwner(functions: Readonly<Record<string, readonly FunctionOccurrence[]>>, edgesByOwnerKey: ReadonlyMap<string, readonly CallEdge[]>, combine: (occ: FunctionOccurrence, recovered: readonly CallEdge[]) => FunctionOccurrence): Record<string, readonly FunctionOccurrence[]>;
+//# sourceMappingURL=edge-identity.d.ts.map

package/dist/cli/orchestrate/edge-identity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-identity.d.ts","sourceRoot":"","sources":["../../../src/cli/orchestrate/edge-identity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAEnE,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAClB,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK;IAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,EAC/E,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,QAAQ,GAC5B,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAUzB;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,kBAAkB,EAAE,CAAC,CAAC,EAClE,eAAe,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC,EACzD,OAAO,EAAE,CAAC,GAAG,EAAE,kBAAkB,EAAE,SAAS,EAAE,SAAS,QAAQ,EAAE,KAAK,kBAAkB,GACvF,MAAM,CAAC,MAAM,EAAE,SAAS,kBAAkB,EAAE,CAAC,CAa/C"}