@grafema/core 0.1.0-alpha.5 → 0.2.0-beta

package/dist/plugins/validation/TypeScriptDeadCodeValidator.js

@@ -28,11 +28,12 @@ export class TypeScriptDeadCodeValidator extends Plugin {
     }
     async execute(context) {
         const { graph } = context;
-        console.log('[TypeScriptDeadCodeValidator] Checking for dead TypeScript code...');
+        const logger = this.log(context);
+        logger.info('Starting TypeScript dead code analysis');
         const startTime = Date.now();
         const issues = [];
         // Collect all interfaces
-        console.log('[TypeScriptDeadCodeValidator] Collecting interfaces...');
+        logger.debug('Collecting interfaces');
         const interfaces = new Map();
         for await (const node of graph.queryNodes({ nodeType: 'INTERFACE' })) {
             // Skip external/reference interfaces
@@ -46,9 +47,9 @@ export class TypeScriptDeadCodeValidator extends Plugin {
                 properties: node.properties
             });
         }
-        console.log(`[TypeScriptDeadCodeValidator] Found ${interfaces.size} interfaces`);
+        logger.debug('Interfaces collected', { count: interfaces.size });
         // Find interfaces with IMPLEMENTS or EXTENDS edges
-        console.log('[TypeScriptDeadCodeValidator] Checking implementations...');
+        logger.debug('Checking implementations');
         const implementedInterfaces = new Map();
         // Get all edges and filter by type (no queryEdges in GraphBackend yet)
         const allEdges = await graph.getAllEdges?.() ?? [];
@@ -124,27 +125,27 @@ export class TypeScriptDeadCodeValidator extends Plugin {
             totalTypes: typeCount,
             timeSeconds: totalTime
         };
-        console.log('[TypeScriptDeadCodeValidator] Summary:', summary);
+        logger.info('Analysis complete', { ...summary });
         // Report issues
         const warnings = issues.filter(i => i.severity === 'WARNING');
         const infos = issues.filter(i => i.severity === 'INFO');
         if (warnings.length > 0) {
-            console.log(`[TypeScriptDeadCodeValidator] ⚠️  ${warnings.length} warning(s):`);
+            logger.warn('Warnings found', { count: warnings.length });
             for (const issue of warnings) {
-                console.log(`  ⚠️  ${issue.message}`);
+                logger.warn(issue.message);
             }
         }
         if (infos.length > 0) {
-            console.log(`[TypeScriptDeadCodeValidator] ℹ️  ${infos.length} info(s):`);
+            logger.info('Info messages', { count: infos.length });
             for (const issue of infos.slice(0, 5)) { // Limit to first 5
-                console.log(`  ℹ️  ${issue.message}`);
+                logger.info(issue.message);
             }
             if (infos.length > 5) {
-                console.log(`  ... and ${infos.length - 5} more`);
+                logger.debug(`... and ${infos.length - 5} more`);
             }
         }
         if (issues.length === 0) {
-            console.log('[TypeScriptDeadCodeValidator] ✅ No dead TypeScript code detected');
+            logger.info('No dead TypeScript code detected');
         }
         return createSuccessResult({ nodes: 0, edges: 0 }, { summary, issues });
     }

package/dist/plugins/vcs/GitPlugin.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GitPlugin.d.ts","sourceRoot":"","sources":["../../../src/plugins/vcs/GitPlugin.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAc,MAAM,gBAAgB,CAAC;AACvD,OAAO,KAAK,EAAE,SAAS,EAAE,iBAAiB,EAAE,WAAW,EAAE,QAAQ,EAAY,MAAM,gBAAgB,CAAC;AAUpG;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,qBAAa,SAAU,SAAQ,SAAS;IACtC,OAAO,CAAC,MAAM,CAAS;gBAEX,MAAM,GAAE,SAAc;IAKlC,IAAI,QAAQ,IAAI,iBAAiB,CAMhC;IAED;;OAEG;IACG,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAerC;;OAEG;IACG,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;IAsD/C;;OAEG;IACG,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAiBnE;;OAEG;IACG,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;IAgBtD;;OAEG;IACG,gBAAgB,IAAI,OAAO,CAAC,MAAM,CAAC;IASzC;;OAEG;IACG,iBAAiB,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IASjD;;OAEG;IACG,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IASnD;;OAEG;IAEH;;OAEG;YACW,KAAK;IAOnB;;OAEG;IACH,OAAO,CAAC,eAAe;IAgCvB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAgDzB;;OAEG;IACH,OAAO,CAAC,YAAY;IAIpB;;;OAGG;IACG,kBAAkB,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAU7C;;OAEG;IACG,iBAAiB,IAAI,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IAiBrD;;OAEG;IACG,qBAAqB,IAAI,OAAO,CAAC,OAAO,CAAC;CAIhD"}
+{"version":3,"file":"GitPlugin.d.ts","sourceRoot":"","sources":["../../../src/plugins/vcs/GitPlugin.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAc,MAAM,gBAAgB,CAAC;AACvD,OAAO,KAAK,EAAE,SAAS,EAAE,iBAAiB,EAAE,WAAW,EAAE,QAAQ,EAAY,MAAM,gBAAgB,CAAC;AAWpG;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,qBAAa,SAAU,SAAQ,SAAS;IACtC,OAAO,CAAC,MAAM,CAAS;gBAEX,MAAM,GAAE,SAAc;IAKlC,IAAI,QAAQ,IAAI,iBAAiB,CAMhC;IAED;;OAEG;IACG,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAerC;;OAEG;IACG,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;IA0D/C;;OAEG;IACG,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAiBnE;;OAEG;IACG,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;IAoBtD;;OAEG;IACG,gBAAgB,IAAI,OAAO,CAAC,MAAM,CAAC;IAczC;;OAEG;IACG,iBAAiB,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAcjD;;OAEG;IACG,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IASnD;;OAEG;IAEH;;OAEG;YACW,KAAK;IAOnB;;OAEG;IACH,OAAO,CAAC,eAAe;IAgCvB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAgDzB;;OAEG;IACH,OAAO,CAAC,YAAY;IAIpB;;;OAGG;IACG,kBAAkB,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAc7C;;OAEG;IACG,iBAAiB,IAAI,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IAsBrD;;OAEG;IACG,qBAAqB,IAAI,OAAO,CAAC,OAAO,CAAC;CAIhD"}

package/dist/plugins/vcs/GitPlugin.js

@@ -5,6 +5,7 @@
  * Обнаруживает изменённые файлы и предоставляет их содержимое
  */
 import { VCSPlugin, FileStatus } from './VCSPlugin.js';
+import { FileAccessError } from '../../errors/GrafemaError.js';
 import { exec } from 'child_process';
 import { promisify } from 'util';
 import { join } from 'path';
@@ -88,8 +89,7 @@ export class GitPlugin extends VCSPlugin {
             return files;
         }
         catch (error) {
-            console.error('[GitPlugin] Failed to get changed files:', error.message);
-            return [];
+            throw new FileAccessError(`Failed to get changed files: ${error.message}`, 'ERR_GIT_ACCESS_DENIED', { plugin: 'GitPlugin' }, 'Check that git is installed and this is a valid git repository');
         }
     }
     /**
@@ -124,8 +124,7 @@ export class GitPlugin extends VCSPlugin {
             return this._parseUnifiedDiff(filePath, stdout);
         }
         catch (error) {
-            console.error(`[GitPlugin] Failed to get diff for ${filePath}:`, error.message);
-            return { path: filePath, hunks: [] };
+            throw new FileAccessError(`Failed to get diff for ${filePath}: ${error.message}`, 'ERR_GIT_ACCESS_DENIED', { plugin: 'GitPlugin', filePath }, 'Ensure the file is tracked by git and the working directory is accessible');
         }
     }
     /**
@@ -136,8 +135,8 @@ export class GitPlugin extends VCSPlugin {
             const { stdout } = await this._exec('git rev-parse --abbrev-ref HEAD');
             return stdout.trim();
         }
-        catch {
-            return 'unknown';
+        catch (error) {
+            throw new FileAccessError(`Failed to get current branch: ${error.message}`, 'ERR_GIT_ACCESS_DENIED', { plugin: 'GitPlugin' }, 'Ensure this is a valid git repository with at least one commit');
         }
     }
     /**
@@ -148,8 +147,8 @@ export class GitPlugin extends VCSPlugin {
             const { stdout } = await this._exec('git rev-parse HEAD');
             return stdout.trim();
         }
-        catch {
-            return null;
+        catch (error) {
+            throw new FileAccessError(`Failed to get last commit hash: ${error.message}`, 'ERR_GIT_NOT_FOUND', { plugin: 'GitPlugin' }, 'Ensure this is a valid git repository with at least one commit');
         }
     }
     /**
@@ -262,8 +261,7 @@ export class GitPlugin extends VCSPlugin {
             return stdout.trim().split('\n').filter(line => line.length > 0);
         }
         catch (error) {
-            console.error('[GitPlugin] Failed to get tracked files:', error.message);
-            return [];
+            throw new FileAccessError(`Failed to get tracked files: ${error.message}`, 'ERR_GIT_ACCESS_DENIED', { plugin: 'GitPlugin' }, 'Check that git is installed and this is a valid git repository');
         }
     }
     /**
@@ -281,8 +279,8 @@ export class GitPlugin extends VCSPlugin {
                 message: lines[4]
             };
         }
-        catch {
-            return null;
+        catch (error) {
+            throw new FileAccessError(`Failed to get last commit info: ${error.message}`, 'ERR_GIT_NOT_FOUND', { plugin: 'GitPlugin' }, 'Ensure this is a valid git repository with at least one commit');
         }
     }
     /**

package/dist/plugins/vcs/VCSPlugin.d.ts

@@ -11,6 +11,7 @@
  * - Mercurial
  * - Perforce
  */
+import type { Logger } from '../../logging/Logger.js';
 /**
  * VCS Plugin configuration
  */
@@ -124,10 +125,10 @@ export declare class VCSPluginFactory {
     /**
      * Автоматически определить и создать подходящий VCS плагин
      */
-    static detect(config?: VCSConfig): Promise<VCSPlugin | null>;
+    static detect(config?: VCSConfig, logger?: Logger): Promise<VCSPlugin | null>;
     /**
      * Создать плагин по имени
      */
-    static create(name: string, config?: VCSConfig): VCSPlugin | null;
+    static create(name: string, config?: VCSConfig, logger?: Logger): VCSPlugin | null;
 }
 //# sourceMappingURL=VCSPlugin.d.ts.map

package/dist/plugins/vcs/VCSPlugin.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"VCSPlugin.d.ts","sourceRoot":"","sources":["../../../src/plugins/vcs/VCSPlugin.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,KAAK,CAAC;IACZ,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,QAAQ,EAAE,CAAC;CACnB;AAED,8BAAsB,SAAS;IAC7B,MAAM,EAAE,SAAS,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;gBAEL,MAAM,GAAE,SAAc;IAKlC;;OAEG;IACH,QAAQ,KAAK,QAAQ,IAAI,iBAAiB,CAAC;IAE3C;;OAEG;IACH,QAAQ,CAAC,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAExC;;OAEG;IACH,QAAQ,CAAC,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;IAElD;;OAEG;IACH,QAAQ,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAEtE;;OAEG;IACH,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;IAEzD;;OAEG;IACH,QAAQ,CAAC,gBAAgB,IAAI,OAAO,CAAC,MAAM,CAAC;IAE5C;;OAEG;IACH,QAAQ,CAAC,iBAAiB,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAEpD;;OAEG;IACH,QAAQ,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAEtD;;OAEG;IACG,qBAAqB,IAAI,OAAO,CAAC,OAAO,CAAC;CAIhD;AAED;;GAEG;AACH,eAAO,MAAM,UAAU;;;;;;;CAOb,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,OAAO,UAAU,CAAC,MAAM,OAAO,UAAU,CAAC,CAAC;AAExE;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,KAAK,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,CAAC;CACrC;AAED;;;GAGG;AACH,qBAAa,gBAAgB;IAC3B,MAAM,CAAC,gBAAgB,EAAE,oBAAoB,EAAE,CAAM;IAErD;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,oBAAoB,GAAG,IAAI;IAIxD;;OAEG;WACU,MAAM,CAAC,MAAM,GAAE,SAAc,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAkBtE;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,SAAc,GAAG,SAAS,GAAG,IAAI;CAYtE"}
+{"version":3,"file":"VCSPlugin.d.ts","sourceRoot":"","sources":["../../../src/plugins/vcs/VCSPlugin.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAEtD;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,KAAK,CAAC;IACZ,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,QAAQ,EAAE,CAAC;CACnB;AAED,8BAAsB,SAAS;IAC7B,MAAM,EAAE,SAAS,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;gBAEL,MAAM,GAAE,SAAc;IAKlC;;OAEG;IACH,QAAQ,KAAK,QAAQ,IAAI,iBAAiB,CAAC;IAE3C;;OAEG;IACH,QAAQ,CAAC,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAExC;;OAEG;IACH,QAAQ,CAAC,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;IAElD;;OAEG;IACH,QAAQ,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAEtE;;OAEG;IACH,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;IAEzD;;OAEG;IACH,QAAQ,CAAC,gBAAgB,IAAI,OAAO,CAAC,MAAM,CAAC;IAE5C;;OAEG;IACH,QAAQ,CAAC,iBAAiB,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAEpD;;OAEG;IACH,QAAQ,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAEtD;;OAEG;IACG,qBAAqB,IAAI,OAAO,CAAC,OAAO,CAAC;CAIhD;AAED;;GAEG;AACH,eAAO,MAAM,UAAU;;;;;;;CAOb,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,OAAO,UAAU,CAAC,MAAM,OAAO,UAAU,CAAC,CAAC;AAExE;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,KAAK,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,CAAC;CACrC;AAED;;;GAGG;AACH,qBAAa,gBAAgB;IAC3B,MAAM,CAAC,gBAAgB,EAAE,oBAAoB,EAAE,CAAM;IAErD;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,oBAAoB,GAAG,IAAI;IAIxD;;OAEG;WACU,MAAM,CAAC,MAAM,GAAE,SAAc,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAkBvF;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,SAAc,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;CAYvF"}

package/dist/plugins/vcs/VCSPlugin.js

@@ -52,12 +52,12 @@ export class VCSPluginFactory {
     /**
      * Автоматически определить и создать подходящий VCS плагин
      */
-    static async detect(config = {}) {
+    static async detect(config = {}, logger) {
         for (const PluginClass of this.availablePlugins) {
             const plugin = new PluginClass(config);
             try {
                 if (await plugin.isAvailable()) {
-                    console.log(`[VCS] Detected ${plugin.metadata.name}`);
+                    logger?.info('VCS detected', { name: plugin.metadata.name });
                     return plugin;
                 }
             }
@@ -65,16 +65,16 @@ export class VCSPluginFactory {
                 // Игнорируем ошибки и пробуем следующий плагин
             }
         }
-        console.warn('[VCS] No VCS system detected');
+        logger?.warn('No VCS system detected');
         return null;
     }
     /**
      * Создать плагин по имени
      */
-    static create(name, config = {}) {
+    static create(name, config = {}, logger) {
         const PluginClass = this.availablePlugins.find(Plugin => new Plugin(config).metadata.name === name);
         if (!PluginClass) {
-            console.error(`[VCS] Plugin "${name}" not found`);
+            logger?.error('VCS plugin not found', { name });
             return null;
         }
         return new PluginClass(config);

package/dist/queries/findCallsInFunction.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Find all CALL and METHOD_CALL nodes inside a function.
+ *
+ * Graph structure:
+ * ```
+ * FUNCTION -[HAS_SCOPE]-> SCOPE -[CONTAINS]-> CALL
+ *                         SCOPE -[CONTAINS]-> METHOD_CALL
+ *                         SCOPE -[CONTAINS]-> SCOPE (nested blocks)
+ * ```
+ *
+ * Algorithm:
+ * 1. Get function's scope via HAS_SCOPE edge
+ * 2. BFS through CONTAINS edges, collecting CALL and METHOD_CALL nodes
+ * 3. Stop at nested FUNCTION/CLASS boundaries (don't enter inner functions)
+ * 4. For each call, check CALLS edge to determine if resolved
+ * 5. 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;;;;;;;;;;;;;;;;;;;;;GAqBG;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,EAAE,MAAM,CAAC;QACb,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;AAED;;;;;;;GAOG;AACH,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,YAAY,EACrB,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,gBAAqB,GAC7B,OAAO,CAAC,QAAQ,EAAE,CAAC,CAkErB"}

package/dist/queries/findCallsInFunction.js

@@ -0,0 +1,135 @@
+/**
+ * Find all CALL and METHOD_CALL nodes inside a function.
+ *
+ * Graph structure:
+ * ```
+ * FUNCTION -[HAS_SCOPE]-> SCOPE -[CONTAINS]-> CALL
+ *                         SCOPE -[CONTAINS]-> METHOD_CALL
+ *                         SCOPE -[CONTAINS]-> SCOPE (nested blocks)
+ * ```
+ *
+ * Algorithm:
+ * 1. Get function's scope via HAS_SCOPE edge
+ * 2. BFS through CONTAINS edges, collecting CALL and METHOD_CALL nodes
+ * 3. Stop at nested FUNCTION/CLASS boundaries (don't enter inner functions)
+ * 4. For each call, check CALLS edge to determine if resolved
+ * 5. 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
+ */
+/**
+ * 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 = 10, 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: Get function's scope via HAS_SCOPE
+    const hasScopeEdges = await backend.getOutgoingEdges(functionId, ['HAS_SCOPE']);
+    // BFS queue: { nodeId, currentDepth }
+    const queue = [];
+    for (const edge of hasScopeEdges) {
+        queue.push({ id: edge.dst, depth: 0 });
+    }
+    // Step 2: BFS through scopes
+    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;
+            // Collect CALL and METHOD_CALL nodes
+            if (child.type === 'CALL' || child.type === 'METHOD_CALL') {
+                const callInfo = await buildCallInfo(backend, child, 0);
+                calls.push(callInfo);
+                // Transitive: follow resolved calls
+                if (transitive && callInfo.resolved && callInfo.target) {
+                    await collectTransitiveCalls(backend, callInfo.target.id, 1, // Starting at depth 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 });
+            }
+            // Skip FUNCTION, CLASS - they have their own scope hierarchy
+        }
+    }
+    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,
+                file: targetNode.file,
+                line: targetNode.line,
+            };
+        }
+    }
+    return {
+        id: callNode.id,
+        name: callNode.name,
+        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: 10,
+        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);
+        }
+    }
+}

package/dist/queries/findContainingFunction.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Find the FUNCTION, CLASS, or MODULE that contains a node.
+ *
+ * Graph structure (backward traversal):
+ * ```
+ * CALL <- CONTAINS <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * VARIABLE <- DECLARES <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * ```
+ *
+ * Algorithm:
+ * 1. BFS up the containment tree via CONTAINS and DECLARES edges
+ * 2. Also follow HAS_SCOPE edges (connects FUNCTION to its body SCOPE)
+ * 3. Stop when we find FUNCTION, CLASS, or MODULE
+ *
+ * @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: 15)
+ * @returns CallerInfo or null if no container found
+ */
+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;;;;;;;;;;;;;;;GAeG;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,EAAE,MAAM,CAAC;QACb,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;AAED;;;;;;;GAOG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,MAAM,EACd,QAAQ,GAAE,MAAW,GACpB,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAkC5B"}

package/dist/queries/findContainingFunction.js

@@ -0,0 +1,54 @@
+/**
+ * Find the FUNCTION, CLASS, or MODULE that contains a node.
+ *
+ * Graph structure (backward traversal):
+ * ```
+ * CALL <- CONTAINS <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * VARIABLE <- DECLARES <- SCOPE <- ... <- SCOPE <- HAS_SCOPE <- FUNCTION
+ * ```
+ *
+ * Algorithm:
+ * 1. BFS up the containment tree via CONTAINS and DECLARES edges
+ * 2. Also follow HAS_SCOPE edges (connects FUNCTION to its body SCOPE)
+ * 3. Stop when we find FUNCTION, CLASS, or MODULE
+ *
+ * @module queries/findContainingFunction
+ */
+/**
+ * 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: 15)
+ * @returns CallerInfo or null if no container found
+ */
+export async function findContainingFunction(backend, nodeId, maxDepth = 15) {
+    const visited = new Set();
+    const queue = [{ id: nodeId, depth: 0 }];
+    while (queue.length > 0) {
+        const { id, depth } = queue.shift();
+        if (visited.has(id) || depth > maxDepth)
+            continue;
+        visited.add(id);
+        // Get incoming edges: CONTAINS, HAS_SCOPE, and DECLARES (for variables)
+        const edges = await backend.getIncomingEdges(id, ['CONTAINS', 'HAS_SCOPE', 'DECLARES']);
+        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') {
+                return {
+                    id: parentNode.id,
+                    name: parentNode.name || '<anonymous>',
+                    type: parentNode.type,
+                    file: parentNode.file,
+                    line: parentNode.line,
+                };
+            }
+            // Continue searching
+            queue.push({ id: parentNode.id, depth: depth + 1 });
+        }
+    }
+    return null;
+}

package/dist/queries/index.d.ts

@@ -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 type { CallInfo, CallerInfo, FindCallsOptions } from './types.js';
+export type { TracedValue, ValueSource, UnknownReason, TraceValuesOptions, ValueSetResult, TraceValuesGraphBackend, NondeterministicPattern, } from './types.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;AAErH,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACzE,YAAY,EACV,WAAW,EACX,WAAW,EACX,aAAa,EACb,kBAAkB,EAClB,cAAc,EACd,uBAAuB,EACvB,uBAAuB,GACxB,MAAM,YAAY,CAAC"}

package/dist/queries/index.js

@@ -0,0 +1,11 @@
+/**
+ * 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';

package/dist/queries/traceValues.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Value Tracing Utility (REG-244)
+ *
+ * Traces a node through ASSIGNED_FROM/DERIVES_FROM edges to find
+ * all possible literal values or mark as unknown.
+ *
+ * Graph structure:
+ * ```
+ * VARIABLE -[ASSIGNED_FROM]-> LITERAL (concrete value)
+ * VARIABLE -[ASSIGNED_FROM]-> PARAMETER (unknown: runtime input)
+ * VARIABLE -[ASSIGNED_FROM]-> CALL (unknown: function return)
+ * VARIABLE -[DERIVES_FROM]-> EXPRESSION (check nondeterministic patterns)
+ * VARIABLE -[ASSIGNED_FROM]-> VARIABLE (chain - recurse)
+ * ```
+ *
+ * Used by:
+ * - CLI trace command (sink-based tracing)
+ * - ValueDomainAnalyzer (computed member access resolution)
+ *
+ * @module queries/traceValues
+ */
+import type { TracedValue, TraceValuesOptions, TraceValuesGraphBackend, ValueSetResult, NondeterministicPattern } from './types.js';
+/**
+ * Nondeterministic MemberExpression patterns.
+ * object.property combinations that represent external/user input.
+ */
+export declare const NONDETERMINISTIC_PATTERNS: NondeterministicPattern[];
+/**
+ * Nondeterministic object prefixes.
+ * Any property access on these is nondeterministic.
+ */
+export declare const NONDETERMINISTIC_OBJECTS: string[];
+/**
+ * Trace a node to all its possible literal values.
+ *
+ * Starting from the given node, follows ASSIGNED_FROM (and optionally
+ * DERIVES_FROM) edges backwards to find:
+ * - LITERAL nodes: concrete values
+ * - PARAMETER nodes: runtime inputs (unknown)
+ * - CALL nodes: function return values (unknown)
+ * - EXPRESSION nodes: checks for nondeterministic patterns
+ *
+ * @param backend - Graph backend for queries
+ * @param nodeId - Starting node ID
+ * @param options - Traversal options
+ * @returns Array of traced values with sources
+ *
+ * @example
+ * const values = await traceValues(backend, variableId);
+ * for (const v of values) {
+ *   if (v.isUnknown) {
+ *     console.log(`Unknown from ${v.source.file}:${v.source.line} (${v.reason})`);
+ *   } else {
+ *     console.log(`Value: ${v.value} from ${v.source.file}:${v.source.line}`);
+ *   }
+ * }
+ */
+export declare function traceValues(backend: TraceValuesGraphBackend, nodeId: string, options?: TraceValuesOptions): Promise<TracedValue[]>;
+/**
+ * Aggregate traced values into a simplified result.
+ * Useful for consumers who don't need source locations.
+ *
+ * Note: null and undefined values are NOT included in the values array.
+ * If you need to detect "assigned to null", check the raw TracedValue[] instead.
+ *
+ * @param traced - Array of traced values
+ * @returns Aggregated result with unique values and hasUnknown flag
+ */
+export declare function aggregateValues(traced: TracedValue[]): ValueSetResult;
+//# sourceMappingURL=traceValues.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"traceValues.d.ts","sourceRoot":"","sources":["../../src/queries/traceValues.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EACV,WAAW,EACX,kBAAkB,EAClB,uBAAuB,EACvB,cAAc,EACd,uBAAuB,EAExB,MAAM,YAAY,CAAC;AAMpB;;;GAGG;AACH,eAAO,MAAM,yBAAyB,EAAE,uBAAuB,EAiB9D,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,wBAAwB,EAAE,MAAM,EAO5C,CAAC;AAMF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAsB,WAAW,CAC/B,OAAO,EAAE,uBAAuB,EAChC,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE,kBAAkB,GAC3B,OAAO,CAAC,WAAW,EAAE,CAAC,CAoBxB;AAuPD;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,cAAc,CAgBrE"}