@autodev/codebase 1.0.0 → 1.0.1

package/dist/index.js

@@ -45454,7 +45454,7 @@ function parseMarkdown(content) {
 }
 
 // Private constant
-const DEFAULT_MIN_COMPONENT_LINES_VALUE = 4;
+const DEFAULT_MIN_COMPONENT_LINES_VALUE = 2;
 // Getter function for MIN_COMPONENT_LINES (for easier testing)
 let currentMinComponentLines = DEFAULT_MIN_COMPONENT_LINES_VALUE;
 /**
@@ -61829,8 +61829,6 @@ class BaseAnalyzer {
     // ═══════════════════════════════════════════════════════
     async analyze() {
         try {
-            // 0. Create module node for tracking top-level calls
-            this.createModuleNode();
             const tree = this.parser.parse(this.content);
             const root = tree.rootNode;
             // 1. Extract imports first (for resolution)
@@ -61898,8 +61896,8 @@ class BaseAnalyzer {
             if (calleeInfo) {
                 // 使用 CallInfo 进行过滤判断
                 if (!this.shouldFilterCall(node, calleeInfo)) {
-                    // Use currentFunc if inside a function, otherwise use module node ID
-                    const caller = currentFunc || this.getModuleNodeId();
+                    // Use currentFunc if inside a function, otherwise ensure module node exists
+                    const caller = currentFunc || this.ensureModuleNode();
                     // 根据调用类型决定如何传递 callee 参数
                     if (calleeInfo.isGlobalCall) {
                         // 全局直接调用（如 setTimeout）：尝试用 importMap 解析
@@ -62011,6 +62009,24 @@ class BaseAnalyzer {
     getModuleNodeId() {
         return this.getModulePath();
     }
+    /**
+     * Ensure module node exists, creating it lazily if needed.
+     * Returns the module node ID.
+     *
+     * This method is called when a top-level call is detected.
+     * By creating module nodes on-demand, we avoid creating nodes for files
+     * that don't have any top-level calls, reducing graph noise.
+     */
+    ensureModuleNode() {
+        const moduleId = this.getModuleNodeId();
+        // If module node already exists, return its ID
+        if (this.nodes.has(moduleId)) {
+            return moduleId;
+        }
+        // Otherwise, create the module node now
+        this.createModuleNode();
+        return moduleId;
+    }
     addEdge(caller, calleeName, line) {
         let resolved;
         // 1. 尝试直接匹配（命名导入：import { foo } from './module'）
@@ -63360,14 +63376,15 @@ function buildCalleeTree(nodes, rootNode, visited, currentDepth, maxDepth) {
         const depNode = nodes.get(depId);
         if (!depNode)
             continue;
+        const childDepth = currentDepth + 1;
         const treeNode = {
             id: depNode.id,
             name: depNode.name,
             filePath: depNode.filePath,
             line: depNode.startLine,
             endLine: depNode.endLine,
-            depth: currentDepth,
-            children: buildCalleeTree(nodes, depNode, visited, currentDepth + 1, maxDepth)
+            depth: childDepth,
+            children: buildCalleeTree(nodes, depNode, visited, childDepth, maxDepth)
         };
         children.push(treeNode);
     }
@@ -63385,14 +63402,15 @@ function buildCallerTree(nodes, targetNodeId, visited, currentDepth, maxDepth) {
     // Find all nodes that depend on the target node
     for (const node of nodes.values()) {
         if (node.dependsOn.has(targetNodeId)) {
+            const childDepth = currentDepth + 1;
             const treeNode = {
                 id: node.id,
                 name: node.name,
                 filePath: node.filePath,
                 line: node.startLine,
                 endLine: node.endLine,
-                depth: currentDepth,
-                children: buildCallerTree(nodes, node.id, visited, currentDepth + 1, maxDepth)
+                depth: childDepth,
+                children: buildCallerTree(nodes, node.id, visited, childDepth, maxDepth)
             };
             children.push(treeNode);
         }
@@ -63455,7 +63473,7 @@ function findDirectConnections(matchedNodes, adj) {
 /**
  * BFS to find shortest path between two nodes
  */
-function findShortestPath(adj, startId, endId, maxLength = 10) {
+function findShortestPath(adj, startId, endId, maxLength) {
     if (startId === endId) {
         return [startId];
     }
@@ -63482,13 +63500,13 @@ function findShortestPath(adj, startId, endId, maxLength = 10) {
 /**
  * Find all chains connecting queried nodes
  */
-function findChains(matchedNodes, adj) {
+function findChains(matchedNodes, adj, maxDepth) {
     const chains = [];
     const n = matchedNodes.length;
     // Find paths between all pairs
     for (let i = 0; i < n; i++) {
         for (let j = i + 1; j < n; j++) {
-            const path = findShortestPath(adj, matchedNodes[i].id, matchedNodes[j].id);
+            const path = findShortestPath(adj, matchedNodes[i].id, matchedNodes[j].id, maxDepth);
             if (path && path.length > 1) {
                 chains.push({
                     path,
@@ -63505,9 +63523,10 @@ function findChains(matchedNodes, adj) {
  *
  * @param nodes - Node map
  * @param query - Comma-separated function names/patterns
+ * @param maxDepth - Maximum depth for path finding
  * @returns Connection analysis result
  */
-function analyzeConnections(nodes, query) {
+function analyzeConnections(nodes, query, maxDepth) {
     // Find matching nodes
     const matchedNodes = findMatchingNodes(nodes, query);
     if (matchedNodes.length === 0) {
@@ -63524,7 +63543,7 @@ function analyzeConnections(nodes, query) {
     // Find direct connections
     const directConnections = findDirectConnections(matchedNodes);
     // Find chains
-    const chains = findChains(matchedNodes, adj);
+    const chains = findChains(matchedNodes, adj, maxDepth);
     // Collect all involved nodes
     const involvedIds = new Set();
     for (const conn of directConnections) {