@grafema/util 0.3.0-beta

package/dist/queries/NodeContext.js

@@ -0,0 +1,196 @@
+/**
+ * Node Context — shared data logic for building node neighborhood context
+ *
+ * Extracts source code preview and all incoming/outgoing edges
+ * for a given node, grouped by edge type.
+ *
+ * Used by CLI (grafema context) and MCP (get_context tool).
+ * Consumers handle their own formatting; this module provides data only.
+ *
+ * @module queries/NodeContext
+ */
+import { existsSync, readFileSync } from 'fs';
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+/**
+ * Edge types that are structural/containment — shown in compact form.
+ * These describe HOW code is nested, not WHAT it does.
+ */
+export const STRUCTURAL_EDGE_TYPES = new Set([
+    'CONTAINS',
+    'HAS_SCOPE',
+    'DECLARES',
+    'DEFINES',
+    'HAS_CONDITION',
+    'HAS_CASE',
+    'HAS_DEFAULT',
+    'HAS_CONSEQUENT',
+    'HAS_ALTERNATE',
+    'HAS_BODY',
+    'HAS_INIT',
+    'HAS_UPDATE',
+    'HAS_CATCH',
+    'HAS_FINALLY',
+    'HAS_PARAMETER',
+    'HAS_PROPERTY',
+    'HAS_ELEMENT',
+    'USES',
+    'GOVERNS',
+    'VIOLATES',
+    'AFFECTS',
+    'UNKNOWN',
+]);
+// ---------------------------------------------------------------------------
+// Default file reader
+// ---------------------------------------------------------------------------
+function defaultReadFileContent(filePath) {
+    if (!existsSync(filePath))
+        return null;
+    try {
+        return readFileSync(filePath, 'utf-8');
+    }
+    catch {
+        return null;
+    }
+}
+// ---------------------------------------------------------------------------
+// Core function
+// ---------------------------------------------------------------------------
+/**
+ * Build full node context: source preview + all edges with connected nodes.
+ *
+ * @param backend  - Graph backend for queries
+ * @param node     - The node to build context for (already looked up by caller)
+ * @param options  - Context options
+ * @returns NodeContext with source preview and grouped edges
+ */
+export async function buildNodeContext(backend, node, options = {}) {
+    const { contextLines = 3, edgeTypeFilter = null, readFileContent = defaultReadFileContent, } = options;
+    // Source code preview
+    let source = null;
+    if (node.file && node.line) {
+        const content = readFileContent(node.file);
+        if (content) {
+            const allLines = content.split('\n');
+            const line = node.line;
+            const startLine = Math.max(1, line - contextLines);
+            const endLine = Math.min(allLines.length, line + contextLines + 12);
+            source = {
+                file: node.file,
+                startLine,
+                endLine,
+                lines: allLines.slice(startLine - 1, endLine),
+            };
+        }
+    }
+    // Outgoing edges
+    const rawOutgoing = await backend.getOutgoingEdges(node.id);
+    const outgoing = await groupEdges(backend, rawOutgoing, 'dst', edgeTypeFilter);
+    // Incoming edges
+    const rawIncoming = await backend.getIncomingEdges(node.id);
+    const incoming = await groupEdges(backend, rawIncoming, 'src', edgeTypeFilter);
+    return { node, source, outgoing, incoming };
+}
+// ---------------------------------------------------------------------------
+// Edge grouping
+// ---------------------------------------------------------------------------
+/**
+ * Group edges by type and resolve connected nodes.
+ *
+ * Sort order: non-structural edges first (alphabetical),
+ * then structural edges (alphabetical).
+ */
+async function groupEdges(backend, edges, nodeField, edgeTypeFilter) {
+    const groups = new Map();
+    for (const edge of edges) {
+        const edgeType = edge.type || 'UNKNOWN';
+        // Apply edge type filter
+        if (edgeTypeFilter && !edgeTypeFilter.has(edgeType))
+            continue;
+        const connectedId = edge[nodeField];
+        const connectedNode = await backend.getNode(connectedId);
+        if (!groups.has(edgeType)) {
+            groups.set(edgeType, []);
+        }
+        groups.get(edgeType).push({ edge, node: connectedNode });
+    }
+    // Sort groups: primary edges first, then structural
+    return Array.from(groups.entries())
+        .sort(([a], [b]) => {
+        const aStructural = STRUCTURAL_EDGE_TYPES.has(a);
+        const bStructural = STRUCTURAL_EDGE_TYPES.has(b);
+        if (aStructural !== bStructural)
+            return aStructural ? 1 : -1;
+        return a.localeCompare(b);
+    })
+        .map(([edgeType, edgeList]) => ({ edgeType, edges: edgeList }));
+}
+// ---------------------------------------------------------------------------
+// Display helpers
+// ---------------------------------------------------------------------------
+/**
+ * Get display name for a node based on its type.
+ *
+ * Special cases:
+ * - HTTP routes: "METHOD /path"
+ * - HTTP requests: "METHOD url"
+ * - Socket.IO: event name
+ * - Default: node.name or node.id
+ */
+export function getNodeDisplayName(node) {
+    // HTTP nodes: method + path/url
+    if (node.type === 'http:route') {
+        const method = node.method;
+        const path = node.path;
+        if (method && path)
+            return `${method} ${path}`;
+    }
+    if (node.type === 'http:request') {
+        const method = node.method;
+        const url = node.url;
+        if (method && url)
+            return `${method} ${url}`;
+    }
+    // Socket.IO: event name
+    if (node.type === 'socketio:emit' || node.type === 'socketio:on') {
+        const event = node.event;
+        if (event)
+            return event;
+    }
+    // Anonymous arrows/expressions → λ
+    if (node.name === '<arrow>' || node.name === '<expression>')
+        return 'λ';
+    // Default: name or ID fallback
+    if (node.name && !node.name.startsWith('{'))
+        return node.name;
+    return node.id;
+}
+/**
+ * Format edge metadata for inline display (only meaningful fields).
+ *
+ * Returns a string like "  [arg0]" or "" if no relevant metadata.
+ */
+export function formatEdgeMetadata(edge) {
+    const parts = [];
+    const meta = edge.metadata || {};
+    if (edge.type === 'PASSES_ARGUMENT' || edge.type === 'RECEIVES_ARGUMENT') {
+        if ('argIndex' in meta) {
+            parts.push(`arg${meta.argIndex}`);
+        }
+    }
+    if (edge.type === 'FLOWS_INTO') {
+        if ('mutationMethod' in meta)
+            parts.push(`via ${meta.mutationMethod}`);
+    }
+    if (edge.type === 'HAS_PROPERTY') {
+        if ('propertyName' in meta)
+            parts.push(`key: ${meta.propertyName}`);
+    }
+    if (edge.type === 'ITERATES_OVER') {
+        if ('iterates' in meta)
+            parts.push(`${meta.iterates}`);
+    }
+    return parts.length > 0 ? `  [${parts.join(', ')}]` : '';
+}
+//# sourceMappingURL=NodeContext.js.map

package/dist/queries/NodeContext.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NodeContext.js","sourceRoot":"","sources":["../../src/queries/NodeContext.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAmB9C,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAAC;IAC3C,UAAU;IACV,WAAW;IACX,UAAU;IACV,SAAS;IACT,eAAe;IACf,UAAU;IACV,aAAa;IACb,gBAAgB;IAChB,eAAe;IACf,UAAU;IACV,UAAU;IACV,YAAY;IACZ,WAAW;IACX,aAAa;IACb,eAAe;IACf,cAAc;IACd,aAAa;IACb,MAAM;IACN,SAAS;IACT,UAAU;IACV,SAAS;IACT,SAAS;CACV,CAAC,CAAC;AA2CH,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E,SAAS,sBAAsB,CAAC,QAAgB;IAC9C,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,OAAqB,EACrB,IAAoB,EACpB,UAAmC,EAAE;IAErC,MAAM,EACJ,YAAY,GAAG,CAAC,EAChB,cAAc,GAAG,IAAI,EACrB,eAAe,GAAG,sBAAsB,GACzC,GAAG,OAAO,CAAC;IAEZ,sBAAsB;IACtB,IAAI,MAAM,GAAyB,IAAI,CAAC;IACxC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAc,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,YAAY,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,GAAG,YAAY,GAAG,EAAE,CAAC,CAAC;YACpE,MAAM,GAAG;gBACP,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,SAAS;gBACT,OAAO;gBACP,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,EAAE,OAAO,CAAC;aAC9C,CAAC;QACJ,CAAC;IACH,CAAC;IAED,iBAAiB;IACjB,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5D,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IAE/E,iBAAiB;IACjB,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5D,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;IAE/E,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAC9C,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;;;GAKG;AACH,KAAK,UAAU,UAAU,CACvB,OAAqB,EACrB,KAAmB,EACnB,SAAwB,EACxB,cAAkC;IAElC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IAEjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;QAExC,yBAAyB;QACzB,IAAI,cAAc,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS;QAE9D,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAEzD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC3B,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;IAC5D,CAAC;IAED,oDAAoD;IACpD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SAChC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;QACjB,MAAM,WAAW,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,WAAW,KAAK,WAAW;YAAE,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AACpE,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAoB;IACrD,gCAAgC;IAChC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,MAA4B,CAAC;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,IAA0B,CAAC;QAC7C,IAAI,MAAM,IAAI,IAAI;YAAE,OAAO,GAAG,MAAM,IAAI,IAAI,EAAE,CAAC;IACjD,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,MAA4B,CAAC;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAyB,CAAC;QAC3C,IAAI,MAAM,IAAI,GAAG;YAAE,OAAO,GAAG,MAAM,IAAI,GAAG,EAAE,CAAC;IAC/C,CAAC;IAED,wBAAwB;IACxB,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACjE,MAAM,KAAK,GAAG,IAAI,CAAC,KAA2B,CAAC;QAC/C,IAAI,KAAK;YAAE,OAAO,KAAK,CAAC;IAC1B,CAAC;IAED,mCAAmC;IACnC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc;QAAE,OAAO,GAAG,CAAC;IAExE,+BAA+B;IAC/B,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC;IAC9D,OAAO,IAAI,CAAC,EAAE,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAgB;IACjD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;IAEjC,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACzE,IAAI,UAAU,IAAI,IAAI,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QAC/B,IAAI,gBAAgB,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;IACzE,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QACjC,IAAI,cAAc,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;QAClC,IAAI,UAAU,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3D,CAAC"}

package/dist/queries/findCallsInFunction.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Find all CALL and METHOD_CALL nodes inside a function.
+ *
+ * Supports two graph layouts:
+ *
+ * Layout A (scope chain — legacy JS analyzer):
+ * ```
+ * FUNCTION -[HAS_SCOPE]-> SCOPE -[CONTAINS]-> CALL
+ *                         SCOPE -[CONTAINS]-> METHOD_CALL
+ *                         SCOPE -[CONTAINS]-> SCOPE (nested blocks)
+ * ```
+ *
+ * Layout B (direct edges — Rust orchestrator):
+ * ```
+ * FUNCTION -[AWAITS|RETURNS|THROWS|...]--> CALL / METHOD_CALL
+ * ```
+ * The orchestrator links functions directly to their call nodes via
+ * semantic edge types (AWAITS for async calls, RETURNS for return
+ * expressions, THROWS for throw expressions, etc.).
+ *
+ * Algorithm:
+ * 1. Try HAS_SCOPE path first (Layout A)
+ * 2. If no HAS_SCOPE edges, fall back to direct edges (Layout B):
+ *    collect all outgoing edges, keep those targeting CALL/METHOD_CALL nodes
+ * 3. For each call, check CALLS edge to determine if resolved
+ * 4. If transitive=true, recursively follow resolved CALLS edges
+ *
+ * Performance: O(S + C) where S = scopes, C = calls
+ * For functions with 100 calls, expect ~200 DB operations.
+ *
+ * @module queries/findCallsInFunction
+ */
+import type { CallInfo, FindCallsOptions } from './types.js';
+/**
+ * Graph backend interface (minimal surface)
+ */
+interface GraphBackend {
+    getNode(id: string): Promise<{
+        id: string;
+        type: string;
+        name?: string;
+        file?: string;
+        line?: number;
+        object?: string;
+    } | null>;
+    getOutgoingEdges(nodeId: string, edgeTypes: string[] | null): Promise<Array<{
+        src: string;
+        dst: string;
+        type: string;
+    }>>;
+}
+/**
+ * Find all CALL and METHOD_CALL nodes inside a function.
+ *
+ * @param backend - Graph backend for queries
+ * @param functionId - ID of the FUNCTION node
+ * @param options - Options for traversal
+ * @returns Array of CallInfo objects
+ */
+export declare function findCallsInFunction(backend: GraphBackend, functionId: string, options?: FindCallsOptions): Promise<CallInfo[]>;
+export {};
+//# sourceMappingURL=findCallsInFunction.d.ts.map

package/dist/queries/findCallsInFunction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findCallsInFunction.d.ts","sourceRoot":"","sources":["../../src/queries/findCallsInFunction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE7D;;GAEG;AACH,UAAU,YAAY;IACpB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;QAC3B,EAAE,EAAE,MAAM,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,IAAI,CAAC,CAAC;IACV,gBAAgB,CACd,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,GACzB,OAAO,CAAC,KAAK,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;CAC/D;AAWD;;;;;;;GAOG;AACH,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,YAAY,EACrB,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,gBAAqB,GAC7B,OAAO,CAAC,QAAQ,EAAE,CAAC,CA0FrB"}

package/dist/queries/findCallsInFunction.js

@@ -0,0 +1,169 @@
+/**
+ * Find all CALL and METHOD_CALL nodes inside a function.
+ *
+ * Supports two graph layouts:
+ *
+ * Layout A (scope chain — legacy JS analyzer):
+ * ```
+ * FUNCTION -[HAS_SCOPE]-> SCOPE -[CONTAINS]-> CALL
+ *                         SCOPE -[CONTAINS]-> METHOD_CALL
+ *                         SCOPE -[CONTAINS]-> SCOPE (nested blocks)
+ * ```
+ *
+ * Layout B (direct edges — Rust orchestrator):
+ * ```
+ * FUNCTION -[AWAITS|RETURNS|THROWS|...]--> CALL / METHOD_CALL
+ * ```
+ * The orchestrator links functions directly to their call nodes via
+ * semantic edge types (AWAITS for async calls, RETURNS for return
+ * expressions, THROWS for throw expressions, etc.).
+ *
+ * Algorithm:
+ * 1. Try HAS_SCOPE path first (Layout A)
+ * 2. If no HAS_SCOPE edges, fall back to direct edges (Layout B):
+ *    collect all outgoing edges, keep those targeting CALL/METHOD_CALL nodes
+ * 3. For each call, check CALLS edge to determine if resolved
+ * 4. If transitive=true, recursively follow resolved CALLS edges
+ *
+ * Performance: O(S + C) where S = scopes, C = calls
+ * For functions with 100 calls, expect ~200 DB operations.
+ *
+ * @module queries/findCallsInFunction
+ */
+/**
+ * Maximum BFS depth for downward scope traversal.
+ *
+ * Each depth level = one CONTAINS hop through nested scopes.
+ * Typical function bodies: 2-5 scope levels (if → loop → try → ...).
+ * Set to 10 to cover deep nesting while bounding traversal in malformed graphs.
+ */
+const DEFAULT_MAX_SCOPE_DEPTH = 10;
+/**
+ * Find all CALL and METHOD_CALL nodes inside a function.
+ *
+ * @param backend - Graph backend for queries
+ * @param functionId - ID of the FUNCTION node
+ * @param options - Options for traversal
+ * @returns Array of CallInfo objects
+ */
+export async function findCallsInFunction(backend, functionId, options = {}) {
+    const { maxDepth = DEFAULT_MAX_SCOPE_DEPTH, transitive = false, transitiveDepth = 5, } = options;
+    const calls = [];
+    const visited = new Set();
+    const seenTargets = new Set(); // For deduplication in transitive mode
+    // Add the starting function to seenTargets to prevent cycles back to it
+    if (transitive) {
+        seenTargets.add(functionId);
+    }
+    // Step 1: Try HAS_SCOPE path (Layout A — scope chain)
+    const hasScopeEdges = await backend.getOutgoingEdges(functionId, ['HAS_SCOPE']);
+    if (hasScopeEdges.length > 0) {
+        // Layout A: BFS through scope chain
+        const queue = [];
+        for (const edge of hasScopeEdges) {
+            queue.push({ id: edge.dst, depth: 0 });
+        }
+        while (queue.length > 0) {
+            const { id, depth } = queue.shift();
+            if (visited.has(id) || depth > maxDepth)
+                continue;
+            visited.add(id);
+            const containsEdges = await backend.getOutgoingEdges(id, ['CONTAINS']);
+            for (const edge of containsEdges) {
+                const child = await backend.getNode(edge.dst);
+                if (!child)
+                    continue;
+                if (child.type === 'CALL' || child.type === 'METHOD_CALL') {
+                    const callInfo = await buildCallInfo(backend, child, 0);
+                    calls.push(callInfo);
+                    if (transitive && callInfo.resolved && callInfo.target) {
+                        await collectTransitiveCalls(backend, callInfo.target.id, 1, transitiveDepth, calls, seenTargets);
+                    }
+                }
+                // Continue into nested scopes, but NOT into nested functions/classes
+                if (child.type === 'SCOPE') {
+                    queue.push({ id: child.id, depth: depth + 1 });
+                }
+            }
+        }
+    }
+    else {
+        // Layout B: Direct edges from FUNCTION to CALL/METHOD_CALL nodes
+        // The Rust orchestrator links functions to calls via semantic edge types
+        // (AWAITS, RETURNS, THROWS, etc.) instead of HAS_SCOPE -> CONTAINS.
+        const allOutgoing = await backend.getOutgoingEdges(functionId, null);
+        for (const edge of allOutgoing) {
+            const child = await backend.getNode(edge.dst);
+            if (!child)
+                continue;
+            if (child.type === 'CALL' || child.type === 'METHOD_CALL') {
+                const callInfo = await buildCallInfo(backend, child, 0);
+                calls.push(callInfo);
+                if (transitive && callInfo.resolved && callInfo.target) {
+                    await collectTransitiveCalls(backend, callInfo.target.id, 1, transitiveDepth, calls, seenTargets);
+                }
+            }
+        }
+    }
+    return calls;
+}
+/**
+ * Build CallInfo from a call node
+ */
+async function buildCallInfo(backend, callNode, depth) {
+    // Check for CALLS edge (resolved target)
+    const callsEdges = await backend.getOutgoingEdges(callNode.id, ['CALLS']);
+    const isResolved = callsEdges.length > 0;
+    let target = undefined;
+    if (isResolved) {
+        const targetNode = await backend.getNode(callsEdges[0].dst);
+        if (targetNode) {
+            target = {
+                id: targetNode.id,
+                name: targetNode.name ?? '<anonymous>',
+                file: targetNode.file,
+                line: targetNode.line,
+            };
+        }
+    }
+    return {
+        id: callNode.id,
+        name: callNode.name ?? '<unknown>',
+        type: callNode.type,
+        object: callNode.object,
+        resolved: isResolved,
+        target,
+        file: callNode.file,
+        line: callNode.line,
+        depth,
+    };
+}
+/**
+ * Recursively collect transitive calls
+ *
+ * Infinite loop prevention:
+ * - Track seen function IDs in seenTargets
+ * - Stop when we've seen a function before (handles recursion)
+ * - Stop at transitiveDepth limit
+ */
+async function collectTransitiveCalls(backend, functionId, currentDepth, maxTransitiveDepth, calls, seenTargets) {
+    // Prevent infinite loops and limit depth
+    if (seenTargets.has(functionId) || currentDepth > maxTransitiveDepth) {
+        return;
+    }
+    seenTargets.add(functionId);
+    // Find calls in this function (non-transitive to avoid recursion)
+    const innerCalls = await findCallsInFunction(backend, functionId, {
+        maxDepth: DEFAULT_MAX_SCOPE_DEPTH,
+        transitive: false,
+    });
+    for (const call of innerCalls) {
+        // Add with updated depth
+        calls.push({ ...call, depth: currentDepth });
+        // Continue transitively if resolved
+        if (call.resolved && call.target) {
+            await collectTransitiveCalls(backend, call.target.id, currentDepth + 1, maxTransitiveDepth, calls, seenTargets);
+        }
+    }
+}
+//# sourceMappingURL=findCallsInFunction.js.map

package/dist/queries/findCallsInFunction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findCallsInFunction.js","sourceRoot":"","sources":["../../src/queries/findCallsInFunction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAsBH;;;;;;GAMG;AACH,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAEnC;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,OAAqB,EACrB,UAAkB,EAClB,UAA4B,EAAE;IAE9B,MAAM,EACJ,QAAQ,GAAG,uBAAuB,EAClC,UAAU,GAAG,KAAK,EAClB,eAAe,GAAG,CAAC,GACpB,GAAG,OAAO,CAAC;IAEZ,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC,CAAC,uCAAuC;IAE9E,wEAAwE;IACxE,IAAI,UAAU,EAAE,CAAC;QACf,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC9B,CAAC;IAED,sDAAsD;IACtD,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC;IAEhF,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,oCAAoC;QACpC,MAAM,KAAK,GAAyC,EAAE,CAAC;QAEvD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAErC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YAClD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;YAEvE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC9C,IAAI,CAAC,KAAK;oBAAE,SAAS;gBAErB,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;oBAC1D,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;oBACxD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAErB,IAAI,UAAU,IAAI,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;wBACvD,MAAM,sBAAsB,CAC1B,OAAO,EACP,QAAQ,CAAC,MAAM,CAAC,EAAE,EAClB,CAAC,EACD,eAAe,EACf,KAAK,EACL,WAAW,CACZ,CAAC;oBACJ,CAAC;gBACH,CAAC;gBAED,qEAAqE;gBACrE,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,iEAAiE;QACjE,yEAAyE;QACzE,oEAAoE;QACpE,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAErE,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9C,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBAC1D,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;gBACxD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAErB,IAAI,UAAU,IAAI,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACvD,MAAM,sBAAsB,CAC1B,OAAO,EACP,QAAQ,CAAC,MAAM,CAAC,EAAE,EAClB,CAAC,EACD,eAAe,EACf,KAAK,EACL,WAAW,CACZ,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,aAAa,CAC1B,OAAqB,EACrB,QAAoG,EACpG,KAAa;IAEb,yCAAyC;IACzC,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1E,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAEzC,IAAI,MAAM,GAAG,SAAS,CAAC;IACvB,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5D,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,GAAG;gBACP,EAAE,EAAE,UAAU,CAAC,EAAE;gBACjB,IAAI,EAAE,UAAU,CAAC,IAAI,IAAI,aAAa;gBACtC,IAAI,EAAE,UAAU,CAAC,IAAI;gBACrB,IAAI,EAAE,UAAU,CAAC,IAAI;aACtB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO;QACL,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,WAAW;QAClC,IAAI,EAAE,QAAQ,CAAC,IAA8B;QAC7C,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,QAAQ,EAAE,UAAU;QACpB,MAAM;QACN,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,KAAK;KACN,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,sBAAsB,CACnC,OAAqB,EACrB,UAAkB,EAClB,YAAoB,EACpB,kBAA0B,EAC1B,KAAiB,EACjB,WAAwB;IAExB,yCAAyC;IACzC,IAAI,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,YAAY,GAAG,kBAAkB,EAAE,CAAC;QACrE,OAAO;IACT,CAAC;IACD,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAE5B,kEAAkE;IAClE,MAAM,UAAU,GAAG,MAAM,mBAAmB,CAAC,OAAO,EAAE,UAAU,EAAE;QAChE,QAAQ,EAAE,uBAAuB;QACjC,UAAU,EAAE,KAAK;KAClB,CAAC,CAAC;IAEH,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,yBAAyB;QACzB,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;QAE7C,oCAAoC;QACpC,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjC,MAAM,sBAAsB,CAC1B,OAAO,EACP,IAAI,CAAC,MAAM,CAAC,EAAE,EACd,YAAY,GAAG,CAAC,EAChB,kBAAkB,EAClB,KAAK,EACL,WAAW,CACZ,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/queries/findContainingFunction.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Find the FUNCTION, CLASS, or MODULE that contains a node.
+ *
+ * Supports two graph layouts:
+ *
+ * Layout A (scope chain — legacy JS analyzer):
+ * ```
+ * CALL <- CONTAINS <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * VARIABLE <- DECLARES <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * ```
+ *
+ * Layout B (direct edges — Rust orchestrator):
+ * ```
+ * CALL <- AWAITS|RETURNS|THROWS <- FUNCTION
+ * ```
+ * The orchestrator links functions directly to their call nodes via
+ * semantic edge types. These incoming edges on a CALL node point
+ * directly back to the containing FUNCTION.
+ *
+ * Algorithm:
+ * 1. BFS up via CONTAINS, HAS_SCOPE, DECLARES (Layout A)
+ * 2. Also follow AWAITS, RETURNS, THROWS incoming edges (Layout B)
+ * 3. Stop when we find FUNCTION, CLASS, or MODULE
+ * 4. Prefer FUNCTION over MODULE (FUNCTION is more specific)
+ *
+ * @module queries/findContainingFunction
+ */
+import type { CallerInfo } from './types.js';
+/**
+ * Graph backend interface (minimal surface)
+ */
+interface GraphBackend {
+    getNode(id: string): Promise<{
+        id: string;
+        type: string;
+        name?: string;
+        file?: string;
+        line?: number;
+    } | null>;
+    getIncomingEdges(nodeId: string, edgeTypes: string[] | null): Promise<Array<{
+        src: string;
+        dst: string;
+        type: string;
+    }>>;
+}
+/**
+ * Find the FUNCTION, CLASS, or MODULE that contains a node.
+ *
+ * @param backend - Graph backend for queries
+ * @param nodeId - ID of the node to find container for
+ * @param maxDepth - Maximum traversal depth (default: {@link DEFAULT_MAX_DEPTH}).
+ *   Traversal visits depths 0 through maxDepth inclusive.
+ * @returns CallerInfo or null if no container found within maxDepth hops
+ */
+export declare function findContainingFunction(backend: GraphBackend, nodeId: string, maxDepth?: number): Promise<CallerInfo | null>;
+export {};
+//# sourceMappingURL=findContainingFunction.d.ts.map

package/dist/queries/findContainingFunction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findContainingFunction.d.ts","sourceRoot":"","sources":["../../src/queries/findContainingFunction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE7C;;GAEG;AACH,UAAU,YAAY;IACpB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;QAC3B,EAAE,EAAE,MAAM,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,IAAI,CAAC,EAAE,MAAM,CAAC;KACf,GAAG,IAAI,CAAC,CAAC;IACV,gBAAgB,CACd,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,GACzB,OAAO,CAAC,KAAK,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;CAC/D;AAYD;;;;;;;;GAQG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,MAAM,EACd,QAAQ,GAAE,MAA0B,GACnC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAqD5B"}

package/dist/queries/findContainingFunction.js

@@ -0,0 +1,91 @@
+/**
+ * Find the FUNCTION, CLASS, or MODULE that contains a node.
+ *
+ * Supports two graph layouts:
+ *
+ * Layout A (scope chain — legacy JS analyzer):
+ * ```
+ * CALL <- CONTAINS <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * VARIABLE <- DECLARES <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * ```
+ *
+ * Layout B (direct edges — Rust orchestrator):
+ * ```
+ * CALL <- AWAITS|RETURNS|THROWS <- FUNCTION
+ * ```
+ * The orchestrator links functions directly to their call nodes via
+ * semantic edge types. These incoming edges on a CALL node point
+ * directly back to the containing FUNCTION.
+ *
+ * Algorithm:
+ * 1. BFS up via CONTAINS, HAS_SCOPE, DECLARES (Layout A)
+ * 2. Also follow AWAITS, RETURNS, THROWS incoming edges (Layout B)
+ * 3. Stop when we find FUNCTION, CLASS, or MODULE
+ * 4. Prefer FUNCTION over MODULE (FUNCTION is more specific)
+ *
+ * @module queries/findContainingFunction
+ */
+/**
+ * Maximum BFS depth for upward containment traversal.
+ *
+ * Each depth level = one CONTAINS/HAS_SCOPE/DECLARES hop.
+ * Typical real-world nesting: 3-7 levels (function body → if → loop → try → ...).
+ * Set to 15 to handle pathological cases (deeply nested callbacks, complex control flow)
+ * while still bounding traversal in malformed graphs.
+ */
+const DEFAULT_MAX_DEPTH = 15;
+/**
+ * Find the FUNCTION, CLASS, or MODULE that contains a node.
+ *
+ * @param backend - Graph backend for queries
+ * @param nodeId - ID of the node to find container for
+ * @param maxDepth - Maximum traversal depth (default: {@link DEFAULT_MAX_DEPTH}).
+ *   Traversal visits depths 0 through maxDepth inclusive.
+ * @returns CallerInfo or null if no container found within maxDepth hops
+ */
+export async function findContainingFunction(backend, nodeId, maxDepth = DEFAULT_MAX_DEPTH) {
+    const visited = new Set();
+    const queue = [{ id: nodeId, depth: 0 }];
+    // Collect all candidates so we can prefer FUNCTION over MODULE
+    let bestCandidate = null;
+    while (queue.length > 0) {
+        const { id, depth } = queue.shift();
+        if (visited.has(id) || depth > maxDepth)
+            continue;
+        visited.add(id);
+        // Layout A edges: CONTAINS, HAS_SCOPE, DECLARES (scope chain traversal)
+        // Layout B edges: AWAITS, RETURNS, THROWS (direct function-to-call edges)
+        const edges = await backend.getIncomingEdges(id, [
+            'CONTAINS', 'HAS_SCOPE', 'DECLARES',
+            'AWAITS', 'RETURNS', 'THROWS',
+        ]);
+        for (const edge of edges) {
+            const parentNode = await backend.getNode(edge.src);
+            if (!parentNode || visited.has(parentNode.id))
+                continue;
+            // Found container!
+            if (parentNode.type === 'FUNCTION' || parentNode.type === 'CLASS' || parentNode.type === 'MODULE') {
+                const candidate = {
+                    id: parentNode.id,
+                    name: parentNode.name || '<anonymous>',
+                    type: parentNode.type,
+                    file: parentNode.file,
+                    line: parentNode.line,
+                };
+                // FUNCTION/CLASS is most specific — return immediately
+                if (parentNode.type === 'FUNCTION' || parentNode.type === 'CLASS') {
+                    return candidate;
+                }
+                // MODULE is less specific — keep as fallback, continue searching
+                if (!bestCandidate) {
+                    bestCandidate = candidate;
+                }
+                continue;
+            }
+            // Continue searching
+            queue.push({ id: parentNode.id, depth: depth + 1 });
+        }
+    }
+    return bestCandidate;
+}
+//# sourceMappingURL=findContainingFunction.js.map

package/dist/queries/findContainingFunction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findContainingFunction.js","sourceRoot":"","sources":["../../src/queries/findContainingFunction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAqBH;;;;;;;GAOG;AACH,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAqB,EACrB,MAAc,EACd,WAAmB,iBAAiB;IAEpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAE/E,+DAA+D;IAC/D,IAAI,aAAa,GAAsB,IAAI,CAAC;IAE5C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAErC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,GAAG,QAAQ;YAAE,SAAS;QAClD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEhB,wEAAwE;QACxE,0EAA0E;QAC1E,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE;YAC/C,UAAU,EAAE,WAAW,EAAE,UAAU;YACnC,QAAQ,EAAE,SAAS,EAAE,QAAQ;SAC9B,CAAC,CAAC;QAEH,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnD,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAAE,SAAS;YAExD,mBAAmB;YACnB,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAClG,MAAM,SAAS,GAAe;oBAC5B,EAAE,EAAE,UAAU,CAAC,EAAE;oBACjB,IAAI,EAAE,UAAU,CAAC,IAAI,IAAI,aAAa;oBACtC,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,IAAI,EAAE,UAAU,CAAC,IAAI;iBACtB,CAAC;gBAEF,uDAAuD;gBACvD,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAClE,OAAO,SAAS,CAAC;gBACnB,CAAC;gBAED,iEAAiE;gBACjE,IAAI,CAAC,aAAa,EAAE,CAAC;oBACnB,aAAa,GAAG,SAAS,CAAC;gBAC5B,CAAC;gBAED,SAAS;YACX,CAAC;YAED,qBAAqB;YACrB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC"}

package/dist/queries/index.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Graph Query Utilities
+ *
+ * Shared utilities for querying the code graph.
+ * Used by MCP, CLI, and other tools.
+ *
+ * @module queries
+ */
+export { findCallsInFunction } from './findCallsInFunction.js';
+export { findContainingFunction } from './findContainingFunction.js';
+export { traceValues, aggregateValues, NONDETERMINISTIC_PATTERNS, NONDETERMINISTIC_OBJECTS } from './traceValues.js';
+export { traceDataflow, traceForwardBFS, traceBackwardBFS } from './traceDataflow.js';
+export { buildNodeContext, getNodeDisplayName, formatEdgeMetadata, STRUCTURAL_EDGE_TYPES, } from './NodeContext.js';
+export type { CallInfo, CallerInfo, FindCallsOptions } from './types.js';
+export type { EdgeWithNode, EdgeGroup, SourcePreview, NodeContext, BuildNodeContextOptions, } from './NodeContext.js';
+export type { TracedValue, ValueSource, UnknownReason, TraceValuesOptions, ValueSetResult, TraceValuesGraphBackend, NondeterministicPattern, } from './types.js';
+export type { DataflowNode, DataflowEdge, DataflowBackend, TraceDataflowOptions, TraceDataflowResult, } from './traceDataflow.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/queries/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,yBAAyB,EAAE,wBAAwB,EAAE,MAAM,kBAAkB,CAAC;AACrH,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtF,OAAO,EACL,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,EAClB,qBAAqB,GACtB,MAAM,kBAAkB,CAAC;AAE1B,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACzE,YAAY,EACV,YAAY,EACZ,SAAS,EACT,aAAa,EACb,WAAW,EACX,uBAAuB,GACxB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EACV,WAAW,EACX,WAAW,EACX,aAAa,EACb,kBAAkB,EAClB,cAAc,EACd,uBAAuB,EACvB,uBAAuB,GACxB,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,YAAY,EACZ,YAAY,EACZ,eAAe,EACf,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,oBAAoB,CAAC"}

package/dist/queries/index.js

@@ -0,0 +1,14 @@
+/**
+ * Graph Query Utilities
+ *
+ * Shared utilities for querying the code graph.
+ * Used by MCP, CLI, and other tools.
+ *
+ * @module queries
+ */
+export { findCallsInFunction } from './findCallsInFunction.js';
+export { findContainingFunction } from './findContainingFunction.js';
+export { traceValues, aggregateValues, NONDETERMINISTIC_PATTERNS, NONDETERMINISTIC_OBJECTS } from './traceValues.js';
+export { traceDataflow, traceForwardBFS, traceBackwardBFS } from './traceDataflow.js';
+export { buildNodeContext, getNodeDisplayName, formatEdgeMetadata, STRUCTURAL_EDGE_TYPES, } from './NodeContext.js';
+//# sourceMappingURL=index.js.map

package/dist/queries/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/queries/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,yBAAyB,EAAE,wBAAwB,EAAE,MAAM,kBAAkB,CAAC;AACrH,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtF,OAAO,EACL,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,EAClB,qBAAqB,GACtB,MAAM,kBAAkB,CAAC"}