@ryanstark24/sfgraph-core 1.2.0 → 1.6.0

package/dist/analyze/dependencies.d.ts

@@ -1,5 +1,24 @@
 import type { OrgId, QualifiedName } from "@ryanstark24/sfgraph-shared";
 import type { GraphStore } from "../storage/interfaces.js";
-import { type TraversalResult } from "./dependents.js";
-export declare function findDependencies(store: GraphStore, orgId: OrgId, qname: QualifiedName, depth?: number): TraversalResult;
+import { type TraversalOpts, type TraversalResult } from "./dependents.js";
+export interface DependencyTraversalOpts extends TraversalOpts {
+    /**
+     * Containment is not a dependency: do not expand a reached (non-root)
+     * CustomObject / CustomField / ValidationRule / RecordType / NamedCredential
+     * along structural edges (DEFINES_FIELD, HAS_VALIDATION_RULE,
+     * HAS_RECORD_TYPE, field -> field READS_FIELD, ...). The node itself is
+     * kept as a leaf. Default false (full expansion, legacy behaviour).
+     */
+    leafStructure?: boolean;
+    /**
+     * Apex counts at class granularity: when an ApexMethod is reached, its
+     * owning ApexClass (via CONTAINS_METHOD) and the class's other methods are
+     * reached at the same hop, and traversal continues from them. Default false.
+     * (With it a reached class also reaches its methods at the same hop; the
+     * root's own members are always hop-0 root members, and Flow / LWCBundle
+     * containment is always zero-cost; see containment.ts.)
+     */
+    rollupApexClass?: boolean;
+}
+export declare function findDependencies(store: GraphStore, orgId: OrgId, qname: QualifiedName, depth?: number, opts?: DependencyTraversalOpts): TraversalResult;
 //# sourceMappingURL=dependencies.d.ts.map

package/dist/analyze/dependencies.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dependencies.d.ts","sourceRoot":"","sources":["../../src/analyze/dependencies.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAExE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAA8B,KAAK,eAAe,EAAE,MAAM,iBAAiB,CAAC;AASnF,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,aAAa,EACpB,KAAK,SAAI,GACR,eAAe,CA6BjB"}
+{"version":3,"file":"dependencies.d.ts","sourceRoot":"","sources":["../../src/analyze/dependencies.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAExE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAE3D,OAAO,EAIL,KAAK,aAAa,EAClB,KAAK,eAAe,EAGrB,MAAM,iBAAiB,CAAC;AAUzB,MAAM,WAAW,uBAAwB,SAAQ,aAAa;IAC5D;;;;;;OAMG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;;;;OAOG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,aAAa,EACpB,KAAK,SAAI,EACT,IAAI,GAAE,uBAA4B,GACjC,eAAe,CAyHjB"}

package/dist/analyze/dependencies.js

@@ -1,4 +1,6 @@
-import { TRAVERSAL_NODE_CAP_DEFAULT } from "./dependents.js";
+import { traversalMembers, traversalOwner } from "./containment.js";
+import { TRAVERSAL_NODE_CAP_DEFAULT, containmentAllowed, foldRows, } from "./dependents.js";
+import { isStructuralEdge, keepEdge, labelOfQname } from "./edge-filters.js";
 function nodeCap() {
     const raw = process.env.SFGRAPH_TRAVERSAL_NODE_CAP;
     if (!raw)
@@ -6,27 +8,113 @@ function nodeCap() {
     const n = Number.parseInt(raw, 10);
     return Number.isFinite(n) && n > 0 ? n : TRAVERSAL_NODE_CAP_DEFAULT;
 }
-export function findDependencies(store, orgId, qname, depth = 3) {
+export function findDependencies(store, orgId, qname, depth = 3, opts = {}) {
     const cap = nodeCap();
     const visited = new Set();
-    const nodes = [];
+    const nodeOf = new Map();
     const edges = [];
-    let frontier = [qname];
+    const reached = [];
+    const rowAt = new Map();
+    /** Folded qname -> the qname whose row stands for it (containment.ts `row`). */
+    const foldInto = new Map();
+    /** Containment links (owner -> member) for `rowEdges`. */
+    const links = [];
     visited.add(qname);
     let truncated = false;
-    bfs: for (let d = 0; d < depth && frontier.length > 0; d++) {
+    let filtered = 0;
+    let structural = 0;
+    /** Mark `q` reached at `hop`; returns false when the node cap is hit. */
+    const visit = (q, hop, relType, next, via, role) => {
+        visited.add(q);
+        const n = store.getNode(orgId, q);
+        if (n)
+            nodeOf.set(q, n);
+        rowAt.set(q, reached.length);
+        reached.push({
+            qualifiedName: q,
+            label: n?.label ?? labelOfQname(q),
+            hop,
+            relType,
+            hasNode: n !== null,
+            ...(via ? { via } : {}),
+            ...(role ? { role } : {}),
+        });
+        next.push(q);
+        return visited.size < cap;
+    };
+    const viaFor = (rule) => rule.row === "both" ? "class-rollup" : "contained";
+    /**
+     * Containment costs no hop (containment.ts): a newly visited owner reaches
+     * its members at the same hop, and a newly visited member reaches its owner
+     * (Apex only with `rollupApexClass`) and the owner's other members. The
+     * root's own members are hop-0 `root-member` rows; the root's owner is not
+     * followed (a method seed is not its class).
+     */
+    const contain = (q, hop, next, isRoot) => {
+        const { members, rule } = traversalMembers(store, orgId, q);
+        // Apex class granularity is opt-in (`rollupApexClass`): without it a
+        // reached (non-root) class does not pull in its methods (review M5);
+        // Flow / LWC containment always folds.
+        const expandMembers = isRoot || rule?.row !== "both" || opts.rollupApexClass === true;
+        if (rule && expandMembers && containmentAllowed(rule, opts)) {
+            for (const m of members) {
+                links.push({ srcQualifiedName: q, dstQualifiedName: m, relType: rule.relType });
+                if (visited.has(m))
+                    continue;
+                if (isRoot) {
+                    if (!visit(m, 0, rule.relType, next, undefined, "root-member"))
+                        return false;
+                    continue;
+                }
+                if (!visit(m, hop, rule.relType, next, viaFor(rule)))
+                    return false;
+                if (rule.row === "owner")
+                    foldInto.set(m, q);
+                else if (rule.row === "member" && !foldInto.has(q))
+                    foldInto.set(q, m);
+            }
+        }
+        if (isRoot)
+            return true;
+        const own = traversalOwner(store, orgId, q);
+        if (!own || !containmentAllowed(own.rule, opts))
+            return true;
+        if (own.rule.row === "both" && !opts.rollupApexClass)
+            return true;
+        const o = own.owner;
+        links.push({ srcQualifiedName: o, dstQualifiedName: q, relType: own.rule.relType });
+        if (own.rule.row === "owner" && rowAt.has(o))
+            foldInto.set(q, o);
+        if (visited.has(o))
+            return true;
+        if (!visit(o, hop, own.rule.relType, next, viaFor(own.rule)))
+            return false;
+        if (own.rule.row === "owner")
+            foldInto.set(q, o);
+        else if (own.rule.row === "member")
+            foldInto.set(o, q);
+        return contain(o, hop, next, false);
+    };
+    let frontier = [qname];
+    if (!contain(qname, 0, frontier, true))
+        truncated = true;
+    bfs: for (let d = 0; d < depth && frontier.length > 0 && !truncated; d++) {
         const next = [];
         for (const cur of frontier) {
             const outgoing = store.listEdgesFrom(orgId, cur);
             for (const e of outgoing) {
+                if (!keepEdge(e, opts)) {
+                    filtered += 1;
+                    continue;
+                }
+                if (opts.leafStructure && d > 0 && isStructuralEdge(e)) {
+                    structural += 1;
+                    continue;
+                }
                 edges.push(e);
                 if (!visited.has(e.dstQualifiedName)) {
-                    visited.add(e.dstQualifiedName);
-                    const n = store.getNode(orgId, e.dstQualifiedName);
-                    if (n)
-                        nodes.push(n);
-                    next.push(e.dstQualifiedName);
-                    if (visited.size >= cap) {
+                    const dst = e.dstQualifiedName;
+                    if (!visit(dst, d + 1, e.relType, next) || !contain(dst, d + 1, next, false)) {
                         truncated = true;
                         break bfs;
                     }
@@ -35,6 +123,8 @@ export function findDependencies(store, orgId, qname, depth = 3) {
         }
         frontier = next;
     }
-    return { nodes, edges, truncated };
+    const { rows, nodes, rowEdges } = foldRows(reached, rowAt, foldInto, nodeOf, edges, links);
+    const found = store.getNode(orgId, qname) !== null || edges.length > 0 || filtered > 0;
+    return { nodes, edges, truncated, filtered, reached: rows, structural, found, rowEdges };
 }
 //# sourceMappingURL=dependencies.js.map

package/dist/analyze/dependencies.js.map

@@ -1 +1 @@
-{"version":3,"file":"dependencies.js","sourceRoot":"","sources":["../../src/analyze/dependencies.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,0BAA0B,EAAwB,MAAM,iBAAiB,CAAC;AAEnF,SAAS,OAAO;IACd,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC;IACnD,IAAI,CAAC,GAAG;QAAE,OAAO,0BAA0B,CAAC;IAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACnC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,0BAA0B,CAAC;AACtE,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,KAAiB,EACjB,KAAY,EACZ,KAAoB,EACpB,KAAK,GAAG,CAAC;IAET,MAAM,GAAG,GAAG,OAAO,EAAE,CAAC;IACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,IAAI,QAAQ,GAAoB,CAAC,KAAK,CAAC,CAAC;IACxC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,GAAG,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3D,MAAM,IAAI,GAAoB,EAAE,CAAC;QACjC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACjD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC;oBACrC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC;oBAChC,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC;oBACnD,IAAI,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC;oBAC9B,IAAI,OAAO,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;wBACxB,SAAS,GAAG,IAAI,CAAC;wBACjB,MAAM,GAAG,CAAC;oBACZ,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AACrC,CAAC"}
+{"version":3,"file":"dependencies.js","sourceRoot":"","sources":["../../src/analyze/dependencies.ts"],"names":[],"mappings":"AAGA,OAAO,EAAiC,gBAAgB,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACnG,OAAO,EAGL,0BAA0B,EAG1B,kBAAkB,EAClB,QAAQ,GACT,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAE7E,SAAS,OAAO;IACd,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC;IACnD,IAAI,CAAC,GAAG;QAAE,OAAO,0BAA0B,CAAC;IAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACnC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,0BAA0B,CAAC;AACtE,CAAC;AAsBD,MAAM,UAAU,gBAAgB,CAC9B,KAAiB,EACjB,KAAY,EACZ,KAAoB,EACpB,KAAK,GAAG,CAAC,EACT,OAAgC,EAAE;IAElC,MAAM,GAAG,GAAG,OAAO,EAAE,CAAC;IACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,gFAAgF;IAChF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,0DAA0D;IAC1D,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,yEAAyE;IACzE,MAAM,KAAK,GAAG,CACZ,CAAgB,EAChB,GAAW,EACX,OAAe,EACf,IAAqB,EACrB,GAAyB,EACzB,IAA2B,EAClB,EAAE;QACX,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC;YACX,aAAa,EAAE,CAAC;YAChB,KAAK,EAAE,CAAC,EAAE,KAAK,IAAI,YAAY,CAAC,CAAC,CAAC;YAClC,GAAG;YACH,OAAO;YACP,OAAO,EAAE,CAAC,KAAK,IAAI;YACnB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC1B,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,OAAO,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC;IAC5B,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,CAAC,IAA8B,EAAuB,EAAE,CACrE,IAAI,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,WAAW,CAAC;IAErD;;;;;;OAMG;IACH,MAAM,OAAO,GAAG,CACd,CAAgB,EAChB,GAAW,EACX,IAAqB,EACrB,MAAe,EACN,EAAE;QACX,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC5D,qEAAqE;QACrE,qEAAqE;QACrE,uCAAuC;QACvC,MAAM,aAAa,GAAG,MAAM,IAAI,IAAI,EAAE,GAAG,KAAK,MAAM,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC;QACtF,IAAI,IAAI,IAAI,aAAa,IAAI,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;gBAChF,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC7B,IAAI,MAAM,EAAE,CAAC;oBACX,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,aAAa,CAAC;wBAAE,OAAO,KAAK,CAAC;oBAC7E,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACnE,IAAI,IAAI,CAAC,GAAG,KAAK,OAAO;oBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;qBACxC,IAAI,IAAI,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QACD,IAAI,MAAM;YAAE,OAAO,IAAI,CAAC;QACxB,MAAM,GAAG,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAC7D,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,IAAI,CAAC,eAAe;YAAE,OAAO,IAAI,CAAC;QAClE,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACpF,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3E,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,OAAO;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,QAAQ;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,OAAO,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC;IAEF,IAAI,QAAQ,GAAoB,CAAC,KAAK,CAAC,CAAC;IACxC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC;QAAE,SAAS,GAAG,IAAI,CAAC;IAEzD,GAAG,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACzE,MAAM,IAAI,GAAoB,EAAE,CAAC;QACjC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACjD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;oBACvB,QAAQ,IAAI,CAAC,CAAC;oBACd,SAAS;gBACX,CAAC;gBACD,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,GAAG,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvD,UAAU,IAAI,CAAC,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC;oBACrC,MAAM,GAAG,GAAG,CAAC,CAAC,gBAAgB,CAAC;oBAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;wBAC7E,SAAS,GAAG,IAAI,CAAC;wBACjB,MAAM,GAAG,CAAC;oBACZ,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3F,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACvF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC3F,CAAC"}

package/dist/analyze/dependents.d.ts

@@ -1,12 +1,108 @@
 import type { OrgId, QualifiedName } from "@ryanstark24/sfgraph-shared";
 import type { EdgeFact, NodeFact } from "../domain/index.js";
 import type { GraphStore } from "../storage/interfaces.js";
+import { type TraversalContainmentRule } from "./containment.js";
+import { type EdgeFilterOpts } from "./edge-filters.js";
+/** One node reached by a traversal, recorded at its first (minimum) hop. */
+export interface ReachedEntry {
+    qualifiedName: string;
+    /** Node label, or the qname prefix when no node row exists. */
+    label: string;
+    /** Hop count at which the node was first reached (1 = direct neighbour). */
+    hop: number;
+    /** Relationship of the edge that first reached it. */
+    relType: string;
+    /** False when the edge target/source has no node row (dangling). */
+    hasNode: boolean;
+    /**
+     * How the node was reached when not by a direct edge to a frontier node:
+     * `class-rollup` = Apex class roll-up (downstream, the method's class and
+     * siblings); `member` = an edge to one of the frontier node's members
+     * (upstream, e.g. a caller of one of the class's methods); `owner` = an
+     * edge to the frontier member's owner itself (upstream, e.g. a type usage
+     * of the class a method seed belongs to); `contained` = zero-cost
+     * containment (a Flow's FlowVersion, an LWC's bundle; containment.ts).
+     */
+    via?: "class-rollup" | "member" | "owner" | "contained";
+    /**
+     * `root-member`: one of the traced root's own members (an ApexClass root's
+     * methods, a Flow root's FlowVersion), listed at hop 0. It is part of the
+     * root, not something the root depends on. `entry`: the flow-map entry.
+     * `standard-field`: a reached standard field (no `__<suffix>`, e.g. `__c`, `__pc`, `__s`;
+     * field-scope.ts), listed apart from the custom components and not counted.
+     */
+    role?: "root-member" | "entry" | "standard-field";
+    /** Containment partners folded into this row (containment.ts `row`). */
+    folded?: string[];
+}
 export interface TraversalResult {
     nodes: NodeFact[];
     edges: EdgeFact[];
     /** Set when the traversal hit `NODE_CAP` before exhausting the graph. */
     truncated?: boolean;
+    /** Edges dropped by the relType/security/reflection filter — surfaced so
+     *  the tool can tell the user "N security/inferred edges hidden". */
+    filtered?: number;
+    /** Every reached qname (including dangling ones with no node row), in
+     *  BFS order with min hop and the rel it was reached by. */
+    reached?: ReachedEntry[];
+    /** Containment edges not followed because of `leafStructure`. */
+    structural?: number;
+    /** `edges` (plus containment links) between listed rows only, endpoints
+     *  remapped to the row standing for them: what a diagram should draw. */
+    rowEdges?: RowEdge[];
+    /** False when the seed qname has no node row and no edges at all (likely a
+     *  typo): the empty result means "unknown", not "nothing depends on it". */
+    found?: boolean;
+}
+export type TraversalOpts = EdgeFilterOpts;
+export interface DependentTraversalOpts extends TraversalOpts {
+    /**
+     * Containment is not a dependency (mirrors downstream `leafStructure`): an
+     * object reached from its own field / validation rule / record type
+     * (reverse DEFINES_FIELD, HAS_VALIDATION_RULE, HAS_RECORD_TYPE, CONTAINS)
+     * is listed as a leaf and not expanded into every querier of the object.
+     * Default true.
+     */
+    leafStructure?: boolean;
+    /**
+     * Opt-in component-level Apex hops: a reached (non-seed) ApexMethod's next
+     * hop also expands the dependents of its class's other methods. Default
+     * false (T15 I-3): a reached method's dependents are its own callers plus
+     * references to its class itself (class-level references), never callers
+     * of unrelated sibling methods.
+     */
+    componentHops?: boolean;
+}
+/** True when `e` is a structural (containment) edge out of an object-like node. */
+export declare function isUpstreamStructuralEdge(e: EdgeFact): boolean;
+/** Containment of `rule` survives the caller's rel-type filter. */
+export declare function containmentAllowed(rule: TraversalContainmentRule, opts: EdgeFilterOpts): boolean;
+/** An edge between two listed rows (for diagrams; see `rowEdges`). */
+export interface RowEdge {
+    srcQualifiedName: string;
+    dstQualifiedName: string;
+    relType: string;
 }
+/**
+ * Apply containment folds: drop folded rows, record them (sorted) on the row
+ * standing for them, and list node facts for the remaining rows only. A row
+ * reached only by containment takes the hop / rel / via of the member it
+ * folds when that member was reached by a real edge (a Flow listed for the
+ * FlowVersion that calls the target). Rules never chain (containment.ts), so
+ * one step resolves a fold.
+ *
+ * `rowEdges`: `edges` plus the containment `links`, with each endpoint
+ * remapped to the row listed for it (a folded member to its row; an unlisted
+ * traversal target such as a sibling method to the row it was expanded
+ * through, `displayAs`), deduped, self-loops dropped. Diagrams draw these so
+ * no listed box is left disconnected.
+ */
+export declare function foldRows(reached: ReachedEntry[], rowAt: ReadonlyMap<string, number>, foldInto: ReadonlyMap<string, string>, nodeOf: ReadonlyMap<string, NodeFact>, edges?: ReadonlyArray<EdgeFact>, links?: ReadonlyArray<RowEdge>, displayAs?: ReadonlyMap<string, string>): {
+    rows: ReachedEntry[];
+    nodes: NodeFact[];
+    rowEdges: RowEdge[];
+};
 /**
  * Hard ceiling on visited nodes per traversal. Prevents an agent — or a
  * crafted call — from blowing memory by asking for depth=5 on a hub like
@@ -15,5 +111,24 @@ export interface TraversalResult {
  * Override via `TRAVERSAL_NODE_CAP` env var if you really need more.
  */
 export declare const TRAVERSAL_NODE_CAP_DEFAULT = 500;
-export declare function findDependents(store: GraphStore, orgId: OrgId, qname: QualifiedName, depth?: number): TraversalResult;
+/**
+ * Upstream BFS: who references `qname`, transitively.
+ *
+ * A reference to a member is a reference to its owner (see containment.ts):
+ * expanding an owner such as an ApexClass also follows the incoming edges of
+ * its members (CONTAINS_METHOD children), so an LWC importing
+ * `ApexMethod:Svc.search(1)` is a dependent of `ApexClass:Svc`. Expanding a
+ * member *seed* follows its own incoming edges plus those of its owner itself,
+ * never those of its sibling members, so a method seed stays method-scoped.
+ * A reached ApexMethod dependent is expanded the same way (its own callers
+ * plus references to its class itself); `componentHops: true` widens it to
+ * the class's other methods. Edges from the owner or its own
+ * members (internal calls) and containment edges are not dependents.
+ *
+ * Containment costs no hop and is listed as one row: a reached FlowVersion
+ * folds into its Flow (whose subflow callers are the next hop), an LWCBundle
+ * into its LWC. An object reached from its own field is a leaf
+ * (`leafStructure`).
+ */
+export declare function findDependents(store: GraphStore, orgId: OrgId, qname: QualifiedName, depth?: number, opts?: DependentTraversalOpts): TraversalResult;
 //# sourceMappingURL=dependents.d.ts.map

package/dist/analyze/dependents.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dependents.d.ts","sourceRoot":"","sources":["../../src/analyze/dependents.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AACxE,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAE3D,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,yEAAyE;IACzE,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED;;;;;;GAMG;AACH,eAAO,MAAM,0BAA0B,MAAM,CAAC;AAQ9C,wBAAgB,cAAc,CAC5B,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,aAAa,EACpB,KAAK,SAAI,GACR,eAAe,CA6BjB"}
+{"version":3,"file":"dependents.d.ts","sourceRoot":"","sources":["../../src/analyze/dependents.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AACxE,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAE7D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EACL,KAAK,wBAAwB,EAK9B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,KAAK,cAAc,EAIpB,MAAM,mBAAmB,CAAC;AAE3B,4EAA4E;AAC5E,MAAM,WAAW,YAAY;IAC3B,aAAa,EAAE,MAAM,CAAC;IACtB,+DAA+D;IAC/D,KAAK,EAAE,MAAM,CAAC;IACd,4EAA4E;IAC5E,GAAG,EAAE,MAAM,CAAC;IACZ,sDAAsD;IACtD,OAAO,EAAE,MAAM,CAAC;IAChB,oEAAoE;IACpE,OAAO,EAAE,OAAO,CAAC;IACjB;;;;;;;;OAQG;IACH,GAAG,CAAC,EAAE,cAAc,GAAG,QAAQ,GAAG,OAAO,GAAG,WAAW,CAAC;IACxD;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,aAAa,GAAG,OAAO,GAAG,gBAAgB,CAAC;IAClD,wEAAwE;IACxE,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,yEAAyE;IACzE,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;yEACqE;IACrE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;gEAC4D;IAC5D,OAAO,CAAC,EAAE,YAAY,EAAE,CAAC;IACzB,iEAAiE;IACjE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;6EACyE;IACzE,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAC;IACrB;gFAC4E;IAC5E,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAED,MAAM,MAAM,aAAa,GAAG,cAAc,CAAC;AAE3C,MAAM,WAAW,sBAAuB,SAAQ,aAAa;IAC3D;;;;;;OAMG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;;;OAMG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAUD,mFAAmF;AACnF,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,QAAQ,GAAG,OAAO,CAK7D;AAED,mEAAmE;AACnE,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,wBAAwB,EAAE,IAAI,EAAE,cAAc,GAAG,OAAO,CAGhG;AAED,sEAAsE;AACtE,MAAM,WAAW,OAAO;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,gBAAgB,EAAE,MAAM,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,YAAY,EAAE,EACvB,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EAClC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EACrC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,EACrC,KAAK,GAAE,aAAa,CAAC,QAAQ,CAAM,EACnC,KAAK,GAAE,aAAa,CAAC,OAAO,CAAM,EAClC,SAAS,GAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAa,GACjD;IAAE,IAAI,EAAE,YAAY,EAAE,CAAC;IAAC,KAAK,EAAE,QAAQ,EAAE,CAAC;IAAC,QAAQ,EAAE,OAAO,EAAE,CAAA;CAAE,CA0DlE;AAED;;;;;;GAMG;AACH,eAAO,MAAM,0BAA0B,MAAM,CAAC;AAQ9C;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,aAAa,EACpB,KAAK,SAAI,EACT,IAAI,GAAE,sBAA2B,GAChC,eAAe,CAqLjB"}

package/dist/analyze/dependents.js

@@ -1,3 +1,103 @@
+import { REL_TYPES } from "../domain/index.js";
+import { isMemberContainmentEdge, traversalContainmentRule, traversalMembers, traversalOwner, } from "./containment.js";
+import { STRUCTURE_LEAF_LABELS, keepEdge, labelOfQname, } from "./edge-filters.js";
+/** Reverse structural edges whose source is a leaf upstream. */
+const UPSTREAM_STRUCTURAL_RELTYPES = new Set([
+    REL_TYPES.DEFINES_FIELD,
+    REL_TYPES.HAS_VALIDATION_RULE,
+    REL_TYPES.HAS_RECORD_TYPE,
+    REL_TYPES.CONTAINS,
+]);
+/** True when `e` is a structural (containment) edge out of an object-like node. */
+export function isUpstreamStructuralEdge(e) {
+    return (UPSTREAM_STRUCTURAL_RELTYPES.has(e.relType) &&
+        STRUCTURE_LEAF_LABELS.has(labelOfQname(e.srcQualifiedName)));
+}
+/** Containment of `rule` survives the caller's rel-type filter. */
+export function containmentAllowed(rule, opts) {
+    if (opts.includeRelTypes && !opts.includeRelTypes.has(rule.relType))
+        return false;
+    return !opts.excludeRelTypes?.has(rule.relType);
+}
+/**
+ * Apply containment folds: drop folded rows, record them (sorted) on the row
+ * standing for them, and list node facts for the remaining rows only. A row
+ * reached only by containment takes the hop / rel / via of the member it
+ * folds when that member was reached by a real edge (a Flow listed for the
+ * FlowVersion that calls the target). Rules never chain (containment.ts), so
+ * one step resolves a fold.
+ *
+ * `rowEdges`: `edges` plus the containment `links`, with each endpoint
+ * remapped to the row listed for it (a folded member to its row; an unlisted
+ * traversal target such as a sibling method to the row it was expanded
+ * through, `displayAs`), deduped, self-loops dropped. Diagrams draw these so
+ * no listed box is left disconnected.
+ */
+export function foldRows(reached, rowAt, foldInto, nodeOf, edges = [], links = [], displayAs = new Map()) {
+    for (const [f, into] of foldInto) {
+        const fi = rowAt.get(f);
+        const ii = rowAt.get(into);
+        if (fi === undefined || ii === undefined)
+            continue;
+        const row = reached[ii];
+        const gone = reached[fi];
+        if (!row || !gone)
+            continue;
+        const folded = [...(row.folded ?? []), f].sort();
+        const adopt = gone.hop < row.hop ||
+            (row.via === "contained" && gone.via !== "contained" && gone.hop <= row.hop);
+        if (adopt) {
+            const { via: _via, ...rest } = row;
+            reached[ii] = {
+                ...rest,
+                hop: gone.hop,
+                relType: gone.relType,
+                ...(gone.via ? { via: gone.via } : {}),
+                folded,
+            };
+        }
+        else {
+            row.folded = folded;
+        }
+    }
+    const rows = reached.filter((r) => !(foldInto.has(r.qualifiedName) && rowAt.has(foldInto.get(r.qualifiedName) ?? "")));
+    const nodes = [];
+    for (const r of rows) {
+        const n = nodeOf.get(r.qualifiedName);
+        if (n)
+            nodes.push(n);
+    }
+    const listed = new Set(rows.map((r) => r.qualifiedName));
+    const resolve = (q) => {
+        let cur = q;
+        for (let i = 0; i < 4; i++) {
+            if (listed.has(cur))
+                return cur;
+            const f = foldInto.get(cur);
+            if (f !== undefined && listed.has(f))
+                return f;
+            const d = displayAs.get(cur);
+            if (d === undefined)
+                return cur;
+            cur = d;
+        }
+        return cur;
+    };
+    const rowEdges = [];
+    const seen = new Set();
+    for (const e of [...edges, ...links]) {
+        const a = resolve(e.srcQualifiedName);
+        const b = resolve(e.dstQualifiedName);
+        if (a === b)
+            continue;
+        const k = `${a}\u0000${e.relType}\u0000${b}`;
+        if (seen.has(k))
+            continue;
+        seen.add(k);
+        rowEdges.push({ srcQualifiedName: a, dstQualifiedName: b, relType: String(e.relType) });
+    }
+    return { rows, nodes, rowEdges };
+}
 /**
  * Hard ceiling on visited nodes per traversal. Prevents an agent — or a
  * crafted call — from blowing memory by asking for depth=5 on a hub like
@@ -13,27 +113,197 @@ function nodeCap() {
     const n = Number.parseInt(raw, 10);
     return Number.isFinite(n) && n > 0 ? n : TRAVERSAL_NODE_CAP_DEFAULT;
 }
-export function findDependents(store, orgId, qname, depth = 3) {
+/**
+ * Upstream BFS: who references `qname`, transitively.
+ *
+ * A reference to a member is a reference to its owner (see containment.ts):
+ * expanding an owner such as an ApexClass also follows the incoming edges of
+ * its members (CONTAINS_METHOD children), so an LWC importing
+ * `ApexMethod:Svc.search(1)` is a dependent of `ApexClass:Svc`. Expanding a
+ * member *seed* follows its own incoming edges plus those of its owner itself,
+ * never those of its sibling members, so a method seed stays method-scoped.
+ * A reached ApexMethod dependent is expanded the same way (its own callers
+ * plus references to its class itself); `componentHops: true` widens it to
+ * the class's other methods. Edges from the owner or its own
+ * members (internal calls) and containment edges are not dependents.
+ *
+ * Containment costs no hop and is listed as one row: a reached FlowVersion
+ * folds into its Flow (whose subflow callers are the next hop), an LWCBundle
+ * into its LWC. An object reached from its own field is a leaf
+ * (`leafStructure`).
+ */
+export function findDependents(store, orgId, qname, depth = 3, opts = {}) {
     const cap = nodeCap();
+    const leafStructure = opts.leafStructure !== false;
+    const componentHops = opts.componentHops === true;
     const visited = new Set();
-    const nodes = [];
+    /** Targets whose incoming edges were already listed (owner or member). */
+    const expanded = new Set();
+    /** Reached nodes kept as structural leaves (not expanded). */
+    const leaves = new Set();
+    const nodeOf = new Map();
     const edges = [];
+    const reached = [];
+    const rowAt = new Map();
+    const foldInto = new Map();
+    /** Containment links between reached nodes (for `rowEdges`). */
+    const links = [];
+    /** Unlisted traversal target -> the node it was expanded through. */
+    const displayAs = new Map();
     let frontier = [qname];
     visited.add(qname);
     let truncated = false;
+    let filtered = 0;
+    let structural = 0;
+    // Containment lookups, memoised per traversal: every reached method of a
+    // class would otherwise re-list the class's members (review M4).
+    const membersMemo = new Map();
+    const ownerMemo = new Map();
+    const membersOf = (q) => {
+        let v = membersMemo.get(q);
+        if (!v) {
+            v = traversalMembers(store, orgId, q);
+            membersMemo.set(q, v);
+        }
+        return v;
+    };
+    const ownerOfMember = (q) => {
+        if (!ownerMemo.has(q))
+            ownerMemo.set(q, traversalOwner(store, orgId, q));
+        return ownerMemo.get(q) ?? null;
+    };
+    // A member seed's owner: its other members stay member-scoped at every hop
+    // (a sibling calling the seed is a dependent; callers of unrelated
+    // siblings are not; review I1).
+    const seedOwn = ownerOfMember(qname);
+    const seedOwner = seedOwn?.rule.memberScoped ? seedOwn.owner : null;
+    /** Record `q` reached; returns false when the node cap is hit. */
+    const reach = (q, hop, relType, next, via) => {
+        visited.add(q);
+        const n = store.getNode(orgId, q);
+        if (n)
+            nodeOf.set(q, n);
+        rowAt.set(q, reached.length);
+        reached.push({
+            qualifiedName: q,
+            label: n?.label ?? labelOfQname(q),
+            hop,
+            relType,
+            hasNode: n !== null,
+            ...(via ? { via } : {}),
+        });
+        next.push(q);
+        return visited.size < cap;
+    };
+    /** Zero-cost, folded containment around a newly reached dependent. */
+    const contain = (q, hop, next) => {
+        const { members, rule } = membersOf(q);
+        if (rule && rule.row !== "both" && containmentAllowed(rule, opts)) {
+            for (const m of members) {
+                if (rule.row === "owner")
+                    foldInto.set(m, q);
+                else if (!foldInto.has(q))
+                    foldInto.set(q, m);
+                links.push({ srcQualifiedName: q, dstQualifiedName: m, relType: rule.relType });
+                if (visited.has(m))
+                    continue;
+                if (!reach(m, hop, rule.relType, next, "contained"))
+                    return false;
+            }
+        }
+        const own = ownerOfMember(q);
+        if (!own || own.rule.row === "both" || !containmentAllowed(own.rule, opts))
+            return true;
+        if (own.rule.row === "owner")
+            foldInto.set(q, own.owner);
+        else
+            foldInto.set(own.owner, q);
+        links.push({ srcQualifiedName: own.owner, dstQualifiedName: q, relType: own.rule.relType });
+        if (visited.has(own.owner))
+            return true;
+        if (!reach(own.owner, hop, own.rule.relType, next, "contained"))
+            return false;
+        return contain(own.owner, hop, next);
+    };
     bfs: for (let d = 0; d < depth && frontier.length > 0; d++) {
         const next = [];
         for (const cur of frontier) {
-            const incoming = store.listEdgesTo(orgId, cur);
-            for (const e of incoming) {
-                edges.push(e);
-                if (!visited.has(e.srcQualifiedName)) {
-                    visited.add(e.srcQualifiedName);
-                    const n = store.getNode(orgId, e.srcQualifiedName);
-                    if (n)
-                        nodes.push(n);
-                    next.push(e.srcQualifiedName);
-                    if (visited.size >= cap) {
+            if (leaves.has(cur))
+                continue;
+            // (target, how a hit through it is reported, the target's own family
+            // whose edges into it are internal, not dependents)
+            const targets = [];
+            const { members } = membersOf(cur);
+            if (members.length > 0) {
+                // An owner: references to any member are references to it (rule 1).
+                const family = new Set([cur, ...members]);
+                targets.push([cur, undefined, family]);
+                for (const m of members)
+                    targets.push([m, "member", family]);
+            }
+            else {
+                const own = ownerOfMember(cur);
+                if (!own) {
+                    targets.push([cur, undefined, new Set([cur])]);
+                }
+                else {
+                    const owner = own.owner;
+                    const siblings = membersOf(owner).members;
+                    const family = new Set([owner, ...siblings, cur]);
+                    if (own.rule.memberScoped && (d === 0 || !componentHops || owner === seedOwner)) {
+                        // A member seed (or a member of the seed's own owner): also
+                        // references to its owner itself, but not to the owner's other
+                        // members (rule 3).
+                        targets.push([cur, undefined, new Set([cur])]);
+                        targets.push([owner, "owner", family]);
+                    }
+                    else {
+                        // A reached member (or a single-member container): the whole
+                        // component, so the next hop is component-level.
+                        targets.push([cur, undefined, family]);
+                        targets.push([owner, "owner", family]);
+                        for (const m of siblings)
+                            if (m !== cur)
+                                targets.push([m, "member", family]);
+                    }
+                }
+            }
+            for (const [target, via, self] of targets) {
+                if (expanded.has(target))
+                    continue;
+                expanded.add(target);
+                if (target !== cur && !displayAs.has(target))
+                    displayAs.set(target, cur);
+                for (const e of store.listEdgesTo(orgId, target)) {
+                    // Containment is structure (rule 2); the owner's own internal
+                    // calls are not dependents.
+                    if (isMemberContainmentEdge(e) ||
+                        traversalContainmentRule(e) !== null ||
+                        self.has(e.srcQualifiedName)) {
+                        continue;
+                    }
+                    // Filter noise (security grants / reflection inferences) before the
+                    // edge contributes a node — otherwise a hub like a class granted to
+                    // 100+ profiles blows the node cap on grant edges alone and the real
+                    // dependency frontier never gets explored.
+                    if (!keepEdge(e, opts)) {
+                        filtered += 1;
+                        continue;
+                    }
+                    edges.push(e);
+                    const src = e.srcQualifiedName;
+                    if (visited.has(src))
+                        continue;
+                    if (!reach(src, d + 1, e.relType, next, via)) {
+                        truncated = true;
+                        break bfs;
+                    }
+                    if (leafStructure && isUpstreamStructuralEdge(e)) {
+                        leaves.add(src);
+                        structural += 1;
+                        continue;
+                    }
+                    if (!contain(src, d + 1, next)) {
                         truncated = true;
                         break bfs;
                     }
@@ -42,6 +312,8 @@ export function findDependents(store, orgId, qname, depth = 3) {
         }
         frontier = next;
     }
-    return { nodes, edges, truncated };
+    const { rows, nodes, rowEdges } = foldRows(reached, rowAt, foldInto, nodeOf, edges, links, displayAs);
+    const found = store.getNode(orgId, qname) !== null || edges.length > 0 || filtered > 0;
+    return { nodes, edges, truncated, filtered, reached: rows, structural, found, rowEdges };
 }
 //# sourceMappingURL=dependents.js.map