@opensip-cli/graph 0.1.0

package/dist/pipeline/assign-packages.js

@@ -0,0 +1,86 @@
+/**
+ * Package assignment — post-walk catalog pass.
+ *
+ * Stamps every occurrence with the package it belongs to, so the coupling
+ * grid and the cross-package edge constraint bucket by real package boundary
+ * rather than a path heuristic. The package label is the `name` of the
+ * occurrence's **nearest enclosing `package.json`** (walking up from the
+ * file's directory to the project root), e.g. `@opensip-cli/fitness`. When
+ * no manifest is found, it falls back to the file's top-level path segment
+ * (so `apps/`, `libs/`, `src/`, `crates/`, Go-module repos still bucket
+ * sensibly instead of collapsing to one `<unknown>`).
+ *
+ * This runs in the engine (filesystem available); the dashboard has none, so
+ * it reads the stamped `occurrence.package` straight from the catalog.
+ */
+import { existsSync, readFileSync } from 'node:fs';
+import { join } from 'node:path';
+import { logger, withSpan } from '@opensip-cli/core';
+const UNKNOWN = '<unknown>';
+export function assignPackages(catalog, projectRoot) {
+    return withSpan('opensip-cli-graph', 'graph.assign_packages', () => {
+        const nameByDir = new Map();
+        const labelOf = (filePath) => {
+            const nearest = nearestManifestName(dirOf(filePath), projectRoot, nameByDir);
+            if (nearest !== null)
+                return nearest;
+            const seg = filePath.split('/')[0];
+            return seg && seg !== filePath ? seg : UNKNOWN;
+        };
+        const functions = {};
+        for (const [name, occs] of Object.entries(catalog.functions)) {
+            functions[name] = occs.map((occ) => ({ ...occ, package: labelOf(occ.filePath) }));
+        }
+        return { ...catalog, functions };
+    }, { 'graph.assign_packages.project': projectRoot });
+}
+/** Project-relative posix directory of a file ('' for a root-level file). */
+function dirOf(filePath) {
+    const slash = filePath.lastIndexOf('/');
+    return slash === -1 ? '' : filePath.slice(0, slash);
+}
+function parentOf(dir) {
+    const slash = dir.lastIndexOf('/');
+    return slash === -1 ? '' : dir.slice(0, slash);
+}
+/**
+ * The `name` of the nearest `package.json` at or above `dir` (project-relative),
+ * or null if none up to the root. Memoized per directory so the upward walk
+ * runs once per distinct directory across the whole catalog.
+ */
+function nearestManifestName(dir, projectRoot, memo) {
+    const cached = memo.get(dir);
+    if (cached !== undefined)
+        return cached;
+    const name = readManifestName(join(projectRoot, dir, 'package.json'));
+    let result;
+    if (name !== null)
+        result = name;
+    else if (dir === '')
+        result = null;
+    else
+        result = nearestManifestName(parentOf(dir), projectRoot, memo);
+    memo.set(dir, result);
+    return result;
+}
+function readManifestName(pkgJsonPath) {
+    // No manifest here is the common, expected case (keep walking up) — not an
+    // error, so check rather than catch. Only a present-but-unreadable manifest
+    // is noteworthy.
+    if (!existsSync(pkgJsonPath))
+        return null;
+    try {
+        const parsed = JSON.parse(readFileSync(pkgJsonPath, 'utf8'));
+        return typeof parsed.name === 'string' && parsed.name.length > 0 ? parsed.name : null;
+    }
+    catch (error) {
+        logger.debug({
+            evt: 'graph.assign_packages.manifest_unreadable',
+            module: 'graph:assign-packages',
+            path: pkgJsonPath,
+            err: error instanceof Error ? error.message : String(error),
+        });
+        return null;
+    }
+}
+//# sourceMappingURL=assign-packages.js.map

package/dist/pipeline/assign-packages.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assign-packages.js","sourceRoot":"","sources":["../../src/pipeline/assign-packages.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAIrD,MAAM,OAAO,GAAG,WAAW,CAAC;AAE5B,MAAM,UAAU,cAAc,CAAC,OAAgB,EAAE,WAAmB;IAClE,OAAO,QAAQ,CACb,mBAAmB,EACnB,uBAAuB,EACvB,GAAG,EAAE;QACH,MAAM,SAAS,GAAG,IAAI,GAAG,EAAyB,CAAC;QACnD,MAAM,OAAO,GAAG,CAAC,QAAgB,EAAU,EAAE;YAC3C,MAAM,OAAO,GAAG,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;YAC7E,IAAI,OAAO,KAAK,IAAI;gBAAE,OAAO,OAAO,CAAC;YACrC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,OAAO,GAAG,IAAI,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;QACjD,CAAC,CAAC;QAEF,MAAM,SAAS,GAAyC,EAAE,CAAC;QAC3D,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC7D,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,CAAC;IACnC,CAAC,EACD,EAAE,+BAA+B,EAAE,WAAW,EAAE,CACjD,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,SAAS,KAAK,CAAC,QAAgB;IAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACxC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,QAAQ,CAAC,GAAW;IAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACnC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAC1B,GAAW,EACX,WAAmB,EACnB,IAAgC;IAEhC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAExC,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC;IACtE,IAAI,MAAqB,CAAC;IAC1B,IAAI,IAAI,KAAK,IAAI;QAAE,MAAM,GAAG,IAAI,CAAC;SAC5B,IAAI,GAAG,KAAK,EAAE;QAAE,MAAM,GAAG,IAAI,CAAC;;QAC9B,MAAM,GAAG,mBAAmB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;IAEpE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACtB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,gBAAgB,CAAC,WAAmB;IAC3C,2EAA2E;IAC3E,4EAA4E;IAC5E,iBAAiB;IACjB,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1C,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,EAAE,MAAM,CAAC,CAAuB,CAAC;QACnF,OAAO,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACxF,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC;YACX,GAAG,EAAE,2CAA2C;YAChD,MAAM,EAAE,uBAAuB;YAC/B,IAAI,EAAE,WAAW;YACjB,GAAG,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;SAC5D,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

package/dist/pipeline/constrain-edges.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Cross-package edge constraint — post-resolution catalog pass.
+ *
+ * Mode-agnostic correction for the impossible coupling edges (`core→fitness`,
+ * `fitness→cli`, …). Name-based resolution can link a call to a function in a
+ * package the caller never imports: `resolveByCatalogFallback` matches a
+ * globally-unique simple name across all packages, and cross-shard recovery
+ * matches bare-specifier names. The type-checker, by contrast, only resolves
+ * to symbols the caller can actually reach.
+ *
+ * This pass drops the false edges that the name-based resolvers invent:
+ * for every **name-guessed** edge (`resolution` ∈ {unknown, dynamic-string,
+ * syntactic}) it keeps only the targets whose body hash has at least one
+ * occurrence that is a valid callee for this caller — in a package the caller
+ * can reach (own ∪ imported) and not another package's test file (a
+ * cross-package test file is never importable). Type-checker-backed edges
+ * (`static`, `method-dispatch`, `jsx`, `constructor`) are left untouched, so
+ * legitimate edges — including re-export indirection — are never dropped.
+ *
+ * Package identity comes from `occurrence.package` (the nearest-`package.json`
+ * name stamped by `assignPackages`); the caller's import set is the set of
+ * package names its module's `dependencies[]` specifiers refer to — which, for
+ * a workspace import, IS the imported package's name, so no separate lookup is
+ * needed. No-op in `fast` mode (no `dependencies[]`). Must run after
+ * `assignPackages`.
+ */
+import type { Catalog } from '../types.js';
+/**
+ * Drop name-guessed call-edge targets that point into a package the caller
+ * cannot reach. Returns a new catalog (occurrences/edges rebuilt only where a
+ * target was removed). No-op in `fast` mode.
+ */
+export declare function constrainCrossPackageEdges(catalog: Catalog): Catalog;
+//# sourceMappingURL=constrain-edges.d.ts.map

package/dist/pipeline/constrain-edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constrain-edges.d.ts","sourceRoot":"","sources":["../../src/pipeline/constrain-edges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAMH,OAAO,KAAK,EAAY,OAAO,EAAsC,MAAM,aAAa,CAAC;AAezF;;;;GAIG;AACH,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAapE"}

package/dist/pipeline/constrain-edges.js

@@ -0,0 +1,139 @@
+/**
+ * Cross-package edge constraint — post-resolution catalog pass.
+ *
+ * Mode-agnostic correction for the impossible coupling edges (`core→fitness`,
+ * `fitness→cli`, …). Name-based resolution can link a call to a function in a
+ * package the caller never imports: `resolveByCatalogFallback` matches a
+ * globally-unique simple name across all packages, and cross-shard recovery
+ * matches bare-specifier names. The type-checker, by contrast, only resolves
+ * to symbols the caller can actually reach.
+ *
+ * This pass drops the false edges that the name-based resolvers invent:
+ * for every **name-guessed** edge (`resolution` ∈ {unknown, dynamic-string,
+ * syntactic}) it keeps only the targets whose body hash has at least one
+ * occurrence that is a valid callee for this caller — in a package the caller
+ * can reach (own ∪ imported) and not another package's test file (a
+ * cross-package test file is never importable). Type-checker-backed edges
+ * (`static`, `method-dispatch`, `jsx`, `constructor`) are left untouched, so
+ * legitimate edges — including re-export indirection — are never dropped.
+ *
+ * Package identity comes from `occurrence.package` (the nearest-`package.json`
+ * name stamped by `assignPackages`); the caller's import set is the set of
+ * package names its module's `dependencies[]` specifiers refer to — which, for
+ * a workspace import, IS the imported package's name, so no separate lookup is
+ * needed. No-op in `fast` mode (no `dependencies[]`). Must run after
+ * `assignPackages`.
+ */
+import { pkgOf } from '../resolve-callee.js';
+import { buildHashMaps } from './indexes.js';
+/**
+ * Resolutions produced by name/heuristic matching rather than the type
+ * checker. Only these are import-constrained — a type-checker-backed edge
+ * already reflects a symbol the caller can reach.
+ */
+const NAME_GUESSED = new Set([
+    'unknown',
+    'dynamic-string',
+    'syntactic',
+]);
+const EMPTY_SET = new Set();
+/**
+ * Drop name-guessed call-edge targets that point into a package the caller
+ * cannot reach. Returns a new catalog (occurrences/edges rebuilt only where a
+ * target was removed). No-op in `fast` mode.
+ */
+export function constrainCrossPackageEdges(catalog) {
+    if (catalog.resolutionMode === 'fast')
+        return catalog;
+    const { occurrencesByHash } = buildHashMaps(catalog);
+    const importedByFile = buildImportedPackagesByFile(catalog);
+    const functions = {};
+    for (const [name, occs] of Object.entries(catalog.functions)) {
+        functions[name] = occs.map((occ) => constrainOccurrence(occ, occurrencesByHash, importedByFile));
+    }
+    return { ...catalog, functions };
+}
+/**
+ * filePath → set of package names it imports, from each module-init's
+ * `dependencies[]` specifiers. A workspace import specifier IS the imported
+ * package's name (`@scope/pkg`), so it compares directly to `occurrence.package`.
+ */
+function buildImportedPackagesByFile(catalog) {
+    const out = new Map();
+    for (const occs of Object.values(catalog.functions)) {
+        for (const occ of occs) {
+            if (occ.kind !== 'module-init')
+                continue;
+            addImportedNames(out, occ);
+        }
+    }
+    return out;
+}
+function addImportedNames(out, occ) {
+    let set;
+    for (const dep of occ.dependencies ?? []) {
+        // Relative imports stay within the caller's own package (covered by the
+        // own-package allowance) — only bare/scoped specifiers name another package.
+        if (dep.specifier.startsWith('.'))
+            continue;
+        set ??= getOrCreate(out, occ.filePath);
+        set.add(packageNameOf(dep.specifier));
+    }
+}
+function getOrCreate(map, key) {
+    let set = map.get(key);
+    if (!set) {
+        set = new Set();
+        map.set(key, set);
+    }
+    return set;
+}
+/** `@scope/name/sub` → `@scope/name`; `name/sub` → `name`. */
+function packageNameOf(specifier) {
+    const parts = specifier.split('/');
+    return specifier.startsWith('@') ? parts.slice(0, 2).join('/') : (parts[0] ?? specifier);
+}
+function constrainOccurrence(occ, occurrencesByHash, importedByFile) {
+    if (occ.calls.length === 0)
+        return occ;
+    const callerPkg = pkgOf(occ);
+    const reachable = reachablePackages(occ, callerPkg, importedByFile);
+    let changed = false;
+    const calls = occ.calls.map((edge) => {
+        const constrained = constrainEdge(edge, reachable, callerPkg, occurrencesByHash);
+        if (constrained !== edge)
+            changed = true;
+        return constrained;
+    });
+    return changed ? { ...occ, calls } : occ;
+}
+/** The set of packages a caller occurrence can reach (own ∪ imported). */
+function reachablePackages(occ, callerPkg, importedByFile) {
+    const imported = importedByFile.get(occ.filePath) ?? EMPTY_SET;
+    const reachable = new Set(imported);
+    reachable.add(callerPkg);
+    return reachable;
+}
+function constrainEdge(edge, reachable, callerPkg, occurrencesByHash) {
+    if (!NAME_GUESSED.has(edge.resolution) || edge.to.length === 0)
+        return edge;
+    const kept = edge.to.filter((hash) => targetIsReachable(hash, reachable, callerPkg, occurrencesByHash));
+    return kept.length === edge.to.length ? edge : { ...edge, to: kept };
+}
+/**
+ * A target hash is reachable if some occurrence sharing it is a valid callee
+ * for this caller: in a reachable package (own ∪ imported) and not another
+ * package's **test file**. A cross-package test file is never importable, so a
+ * name-guessed edge into one (a builtin `.map`/`.find` colliding with a
+ * test-local arrow named `map`/`find`) is an artifact, not real coupling.
+ */
+function targetIsReachable(hash, reachable, callerPkg, occurrencesByHash) {
+    const candidates = occurrencesByHash.get(hash) ?? [];
+    return candidates.some((c) => {
+        const pkg = pkgOf(c);
+        if (!reachable.has(pkg))
+            return false;
+        return !(c.inTestFile && pkg !== callerPkg);
+    });
+}
+//# sourceMappingURL=constrain-edges.js.map

package/dist/pipeline/constrain-edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constrain-edges.js","sourceRoot":"","sources":["../../src/pipeline/constrain-edges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAI7C;;;;GAIG;AACH,MAAM,YAAY,GAAgC,IAAI,GAAG,CAAiB;IACxE,SAAS;IACT,gBAAgB;IAChB,WAAW;CACZ,CAAC,CAAC;AAEH,MAAM,SAAS,GAAwB,IAAI,GAAG,EAAU,CAAC;AAEzD;;;;GAIG;AACH,MAAM,UAAU,0BAA0B,CAAC,OAAgB;IACzD,IAAI,OAAO,CAAC,cAAc,KAAK,MAAM;QAAE,OAAO,OAAO,CAAC;IAEtD,MAAM,EAAE,iBAAiB,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACrD,MAAM,cAAc,GAAG,2BAA2B,CAAC,OAAO,CAAC,CAAC;IAE5D,MAAM,SAAS,GAAyC,EAAE,CAAC;IAC3D,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7D,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CACjC,mBAAmB,CAAC,GAAG,EAAE,iBAAiB,EAAE,cAAc,CAAC,CAC5D,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,SAAS,2BAA2B,CAAC,OAAgB;IACnD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QACpD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa;gBAAE,SAAS;YACzC,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,gBAAgB,CAAC,GAA6B,EAAE,GAAuB;IAC9E,IAAI,GAA4B,CAAC;IACjC,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;QACzC,wEAAwE;QACxE,6EAA6E;QAC7E,IAAI,GAAG,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5C,GAAG,KAAK,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,GAA6B,EAAE,GAAW;IAC7D,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QACxB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8DAA8D;AAC9D,SAAS,aAAa,CAAC,SAAiB;IACtC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACnC,OAAO,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC;AAC3F,CAAC;AAED,SAAS,mBAAmB,CAC1B,GAAuB,EACvB,iBAAqE,EACrE,cAAwD;IAExD,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACvC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,SAAS,GAAG,iBAAiB,CAAC,GAAG,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAEpE,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACnC,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,iBAAiB,CAAC,CAAC;QACjF,IAAI,WAAW,KAAK,IAAI;YAAE,OAAO,GAAG,IAAI,CAAC;QACzC,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AAC3C,CAAC;AAED,0EAA0E;AAC1E,SAAS,iBAAiB,CACxB,GAAuB,EACvB,SAAiB,EACjB,cAAwD;IAExD,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;IAC5C,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACzB,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,aAAa,CACpB,IAAc,EACd,SAA8B,EAC9B,SAAiB,EACjB,iBAAqE;IAErE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5E,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CACnC,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,iBAAiB,CAAC,CACjE,CAAC;IACF,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACvE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CACxB,IAAY,EACZ,SAA8B,EAC9B,SAAiB,EACjB,iBAAqE;IAErE,MAAM,UAAU,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACrD,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACtC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,GAAG,KAAK,SAAS,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/pipeline/feature-deps.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Per-run feature dependency union.
+ *
+ * The features stage computes the UNION of every enabled rule's declared
+ * `featureDeps` plus the caller's `emitFeatures` (the dashboard columns on a
+ * dashboard-bound run) — lazy/needed-only, nothing more. Pure; no module
+ * state (the dependency set is recomputed per run from the active rule set).
+ * Shared by both orchestrators (single-program `runGraph` + sharded build) so
+ * the union is computed by one function, not two copies.
+ */
+import type { FeatureColumn, Rule } from '../types.js';
+/**
+ * De-duplicated union of every rule's `featureDeps` and the caller's `extra`
+ * (e.g. `RunGraphInput.emitFeatures`). Empty when no rule declares deps and
+ * `extra` is absent/empty ⇒ the features stage computes nothing and persists
+ * no blob.
+ */
+export declare function unionFeatureDeps(rules: readonly Rule[], extra: readonly FeatureColumn[] | undefined): readonly FeatureColumn[];
+//# sourceMappingURL=feature-deps.d.ts.map

package/dist/pipeline/feature-deps.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"feature-deps.d.ts","sourceRoot":"","sources":["../../src/pipeline/feature-deps.ts"],"names":[],"mappings":"AACA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAEvD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,IAAI,EAAE,EACtB,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,SAAS,GAC1C,SAAS,aAAa,EAAE,CAO1B"}

package/dist/pipeline/feature-deps.js

@@ -0,0 +1,28 @@
+// @fitness-ignore-file batch-operation-limits -- bounded synchronous union over the active rule set + caller columns (no async, no unbounded data load); the heuristic mis-reads the nested synchronous for...of as an async/unbounded batch.
+/**
+ * Per-run feature dependency union.
+ *
+ * The features stage computes the UNION of every enabled rule's declared
+ * `featureDeps` plus the caller's `emitFeatures` (the dashboard columns on a
+ * dashboard-bound run) — lazy/needed-only, nothing more. Pure; no module
+ * state (the dependency set is recomputed per run from the active rule set).
+ * Shared by both orchestrators (single-program `runGraph` + sharded build) so
+ * the union is computed by one function, not two copies.
+ */
+/**
+ * De-duplicated union of every rule's `featureDeps` and the caller's `extra`
+ * (e.g. `RunGraphInput.emitFeatures`). Empty when no rule declares deps and
+ * `extra` is absent/empty ⇒ the features stage computes nothing and persists
+ * no blob.
+ */
+export function unionFeatureDeps(rules, extra) {
+    const set = new Set();
+    for (const rule of rules) {
+        for (const col of rule.featureDeps ?? [])
+            set.add(col);
+    }
+    for (const col of extra ?? [])
+        set.add(col);
+    return [...set];
+}
+//# sourceMappingURL=feature-deps.js.map

package/dist/pipeline/feature-deps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"feature-deps.js","sourceRoot":"","sources":["../../src/pipeline/feature-deps.ts"],"names":[],"mappings":"AAAA,8OAA8O;AAC9O;;;;;;;;;GASG;AAIH;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAsB,EACtB,KAA2C;IAE3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAiB,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,IAAI,EAAE;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACzD,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,KAAK,IAAI,EAAE;QAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5C,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;AAClB,CAAC"}

package/dist/pipeline/features.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Stage 3.5 — Feature derivation.
+ *
+ * Pure data→data over the catalog + indexes. A *plain view* by default
+ * (ADR-0006): only the columns the caller requests are computed
+ * (lazy/needed-only), and the in-engine rules consume the result without it
+ * ever being persisted for their sake. The dashboard columns (blast / scc /
+ * packageCoupling) are materialized into the catalog JSON only when the
+ * producing run requests them.
+ *
+ * Algorithms here are ports of analyses that first lived in dashboard-side
+ * JavaScript (`code-paths/indexes.ts` blast, `code-paths/scc.ts` Tarjan,
+ * `code-paths/view-coupling.ts` coupling) or inline inside individual rules
+ * (the `endLine − line + 1` span, `orphan-subtree`'s reachability BFS,
+ * `test-only-reachable`'s prod BFS). The engine is now the canonical home for
+ * computed feature columns; dashboard helpers still assemble view-local
+ * indexes and drilldowns from the catalog plus the precomputed features.
+ */
+import type { Catalog, FeatureColumn, FeatureTable, GraphConfig, Indexes, PersistedFeatures, SccFeatures } from '../types.js';
+/**
+ * Compute the requested feature columns over the catalog + indexes. Only the
+ * entities whose driving columns are present are populated; everything else
+ * is the shared empty value. An empty `requested` ⇒ an all-empty table.
+ */
+export declare function buildFeatures(catalog: Catalog, indexes: Indexes, config: GraphConfig, requested: readonly FeatureColumn[]): FeatureTable;
+/**
+ * Iterative Tarjan over the occurrence-level graph (`buildOccGraph`). Singletons
+ * included by the algorithm; each component's members sorted; result ordering
+ * preserved (push-on-root-close). Each component is mapped to an `SccFeatures`
+ * whose members are occIds, with a stable member-derived id and
+ * `crossesPackages` over the members' resolved packages. Irreducible iterative
+ * Tarjan (no recursion, to survive deep call graphs) — splitting it would
+ * obscure the well-known algorithm.
+ *
+ * Exported so the equivalence diff (`cross-shard-resolve.diffCatalogs`) can run
+ * the SAME occId-keyed SCC computation over both the exact and the sharded
+ * catalog and diff component membership — the Phase-4 cycle-finding gate. There
+ * is exactly one SCC implementation; the diff reuses it rather than reimplement.
+ */
+export declare function computeSccs(indexes: Indexes): SccFeatures[];
+/**
+ * Project a `FeatureTable` to the JSON-safe `PersistedFeatures`, OMITTING any
+ * entity whose driving column was not requested (so an empty-request table
+ * projects to `{}` and a lean default-run persists no blob). Maps → records;
+ * arrays pass through.
+ */
+export declare function toPersistedFeatures(table: FeatureTable, requested: readonly FeatureColumn[]): PersistedFeatures;
+/** True when no entity is present (or every present entity is empty). */
+export declare function isPersistedFeaturesEmpty(persisted: PersistedFeatures): boolean;
+//# sourceMappingURL=features.d.ts.map

package/dist/pipeline/features.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"features.d.ts","sourceRoot":"","sources":["../../src/pipeline/features.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;;;;;;GAiBG;AAOH,OAAO,KAAK,EAEV,OAAO,EACP,aAAa,EACb,YAAY,EAGZ,WAAW,EACX,OAAO,EAGP,iBAAiB,EAEjB,WAAW,EACZ,MAAM,aAAa,CAAC;AAyBrB;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,OAAO,EAChB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,WAAW,EACnB,SAAS,EAAE,SAAS,aAAa,EAAE,GAClC,YAAY,CA+Bd;AA8ND;;;;;;;;;;;;;GAaG;AAEH,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,GAAG,WAAW,EAAE,CA2D3D;AA2GD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,YAAY,EACnB,SAAS,EAAE,SAAS,aAAa,EAAE,GAClC,iBAAiB,CAoBnB;AAED,yEAAyE;AACzE,wBAAgB,wBAAwB,CAAC,SAAS,EAAE,iBAAiB,GAAG,OAAO,CAM9E"}