@zbigniewsobiecki/squint 1.0.0

package/dist/commands/llm/_shared/module-prompts.js

@@ -0,0 +1,395 @@
+/**
+ * Prompt builders for the two-phase module tree LLM process.
+ */
+/**
+ * Build the system prompt for Phase 1 (tree structure generation).
+ */
+export function buildTreeSystemPrompt() {
+    return `You are a software architect designing a module structure for a codebase.
+The root "project" module already exists. Propose child modules to organize the codebase.
+
+## Your Task
+Analyze the provided domain/role information and directory structure to propose a hierarchical module tree.
+The tree should reflect logical groupings of functionality, not just mirror the file system.
+
+## Output Format
+Respond with **only** a CSV table:
+
+\`\`\`csv
+type,parent_path,slug,name,description,is_test
+module,project,frontend,"Frontend","UI components and screens",false
+module,project,backend,"Backend","Server-side logic and APIs",false
+module,project,testing,"Testing","Test utilities and helpers",true
+module,project.frontend,screens,"Screens","Application screens",false
+module,project.frontend,components,"Components","Reusable UI components",false
+module,project.backend,services,"Services","Business logic services",false
+module,project.backend,api,"API","HTTP endpoint handlers",false
+module,project.testing,factories,"Test Factories","Mock data generators for tests",true
+\`\`\`
+
+## Test Classification
+For each module, set is_test to "true" if the module exists solely to support testing:
+- Test utilities, mock factories, fixture generators, test helpers
+- Test data builders, spec runners, integration test support
+- Anything that wouldn't ship in a production build
+
+Set is_test to "false" for all production code modules.
+Test classification is inherited: if a parent is test, children should also be test.
+
+## Slug Rules
+- Must start with lowercase letter
+- Only lowercase letters, numbers, and hyphens allowed
+- No consecutive hyphens (e.g., "my--module" is invalid)
+- No trailing hyphens (e.g., "my-module-" is invalid)
+- Maximum 50 characters
+
+## Guidelines
+- Create 3-5 levels of depth at most
+- Group by functionality/domain, not by file type
+- Use domain tags to inform module boundaries
+- Consider architectural layers (e.g., presentation, business logic, data)
+- Keep module names concise but descriptive
+- Each parent_path must be a valid path (either "project" or a previously defined module)
+- For API layers (controllers, routes, services), create entity-specific modules:
+  - backend.api.controllers.users (not just backend.api.controllers)
+  - backend.api.controllers.products
+  - backend.services.user-management
+  This enables accurate per-entity flow tracing.
+
+## Business Domain Parity (CRITICAL)
+- Every business entity domain MUST be a first-class branch.
+  If the codebase has customers, vehicles, and sales — each gets equal treatment.
+  Do NOT bury one domain under "Infrastructure" or "Misc" while others get their own branch.
+  The domains list below tells you which business entities exist — ensure each one appears
+  in the tree at the same structural level.
+
+## Test Code Segregation
+- Test/spec code MUST go in its own top-level branch (e.g., project.testing).
+  Do NOT mix test helpers, mocks, fixtures, or data generators into business domain branches.
+  Use the symbol names, file paths, purposes, and domain tags to determine what is test code —
+  look for test utilities, mock factories, fixture generators, and spec helpers.
+
+## Infrastructure Scope
+- The "infrastructure" or "utility" branch should ONLY contain true cross-cutting concerns:
+  database connections, logging, configuration, error handling base classes.
+  Business logic services, controllers, and routes are NOT infrastructure —
+  they belong under their respective business domain branches.`;
+}
+/**
+ * Build the user prompt for Phase 1 (tree structure generation).
+ */
+export function buildTreeUserPrompt(context) {
+    const parts = [];
+    parts.push('## Codebase Overview');
+    parts.push(`Total symbols: ${context.totalSymbolCount}`);
+    if (context.maxModules && context.maxModules > 0) {
+        const initialTarget = Math.floor(context.maxModules * 0.4);
+        parts.push(`Module budget: ${context.maxModules} total. Create ~${initialTarget} modules now — oversized leaves will be split automatically later. Focus on the top 2–3 levels.`);
+    }
+    parts.push('');
+    // Domains with sample symbols
+    parts.push(`## Domains Found (${context.domains.length})`);
+    parts.push('');
+    for (const domain of context.domains) {
+        parts.push(`### ${domain.domain} (${domain.count} symbols)`);
+        parts.push('Sample symbols:');
+        for (const sym of domain.sampleSymbols) {
+            const roleStr = sym.role ? ` [${sym.role}]` : '';
+            parts.push(`- ${sym.name} (${sym.kind})${roleStr}`);
+        }
+        parts.push('');
+    }
+    // Directory structure (full — the LLM needs the complete picture to design modules)
+    parts.push('## Directory Structure');
+    for (const dir of context.directoryStructure) {
+        parts.push(`- ${dir.path} (${dir.symbolCount} symbols)`);
+    }
+    parts.push('');
+    parts.push('Propose a module tree structure in CSV format.');
+    return parts.join('\n');
+}
+// ============================================================
+// Helpers
+// ============================================================
+/**
+ * Check if a file path is a test file based on naming conventions.
+ */
+export function isTestFile(filePath) {
+    const segments = filePath.split('/');
+    const fileName = segments[segments.length - 1] ?? '';
+    return (fileName.endsWith('.test.ts') ||
+        fileName.endsWith('.test.tsx') ||
+        fileName.endsWith('.spec.ts') ||
+        fileName.endsWith('.spec.tsx') ||
+        segments.includes('__tests__'));
+}
+/**
+ * Build the system prompt for Phase 2 (symbol assignment).
+ */
+export function buildAssignmentSystemPrompt() {
+    return `You are a software architect assigning symbols to modules.
+Each symbol must be assigned to exactly ONE module path.
+
+## Your Task
+For each symbol, choose the most appropriate module based on:
+1. The symbol's purpose and role
+2. The symbol's domain tags
+3. The symbol's file path
+4. The module descriptions
+
+## Output Format
+Respond with **only** a CSV table:
+
+\`\`\`csv
+type,symbol_id,module_path
+assignment,42,project.frontend.screens.login
+assignment,87,project.backend.services.auth
+assignment,123,project.shared.utils
+\`\`\`
+
+## Guidelines
+- Every symbol must be assigned to exactly one module
+- Module paths must match existing modules in the tree
+- Prefer more specific modules over general ones
+- Group related symbols together
+- Consider the file path as a hint but prioritize functionality
+
+## Completeness Requirement
+CRITICAL: Your response MUST contain exactly one assignment row for EVERY symbol listed.
+If unsure about the best module, assign to the closest parent module. Never skip a symbol.
+
+## Test Symbol Rules
+- Symbols from test files (*.test.ts, *.spec.ts) that are NOT exported are test-file-local.
+  Assign them to the nearest test module (project.testing.*) — never to production modules.
+- Only exported symbols from dedicated test utility files (test/helpers/*, test/factories/*)
+  belong in specific test infrastructure modules (e.g., project.testing.factories.customers).
+- Non-exported symbols from test files are inline mocks/fixtures — assign them to a general
+  test module like project.testing.helpers or project.testing.mocks, not to granular sub-modules.`;
+}
+/**
+ * Format module tree for display in user prompt.
+ */
+export function formatModuleTreeForPrompt(modules, directoryHints) {
+    const lines = [];
+    // Sort by depth then path
+    const sorted = [...modules].sort((a, b) => {
+        if (a.depth !== b.depth)
+            return a.depth - b.depth;
+        return a.fullPath.localeCompare(b.fullPath);
+    });
+    for (const mod of sorted) {
+        const indent = '  '.repeat(mod.depth);
+        const desc = mod.description ? ` - ${mod.description}` : '';
+        const hints = directoryHints?.get(mod.id);
+        const hintStr = hints?.length ? ` [${hints.join(', ')}]` : '';
+        lines.push(`${indent}${mod.fullPath}: ${mod.name}${desc}${hintStr}`);
+    }
+    return lines.join('\n');
+}
+/**
+ * Build the user prompt for Phase 2 (symbol assignment batch).
+ */
+export function buildAssignmentUserPrompt(modules, symbols, directoryHints) {
+    const parts = [];
+    // Module tree
+    parts.push('## Available Modules');
+    parts.push('');
+    parts.push(formatModuleTreeForPrompt(modules, directoryHints));
+    parts.push('');
+    // Symbols to assign
+    parts.push(`## Symbols to Assign (${symbols.length})`);
+    parts.push('');
+    for (const sym of symbols) {
+        parts.push(`### #${sym.id}: ${sym.name} (${sym.kind})`);
+        parts.push(`File: ${sym.filePath}`);
+        if (!sym.isExported) {
+            parts.push('Exported: no (file-local symbol)');
+        }
+        if (isTestFile(sym.filePath)) {
+            parts.push('Test file: yes');
+        }
+        if (sym.purpose) {
+            parts.push(`Purpose: ${sym.purpose}`);
+        }
+        if (sym.domain && sym.domain.length > 0) {
+            parts.push(`Domains: ${sym.domain.join(', ')}`);
+        }
+        if (sym.role) {
+            parts.push(`Role: ${sym.role}`);
+        }
+        parts.push('');
+    }
+    parts.push(`IMPORTANT: You MUST output exactly ${symbols.length} assignment rows — one for each of the ${symbols.length} symbols above. Do not skip any.`);
+    return parts.join('\n');
+}
+/**
+ * Convert AnnotatedSymbolInfo to SymbolForAssignment.
+ */
+export function toSymbolForAssignment(sym) {
+    return {
+        id: sym.id,
+        name: sym.name,
+        kind: sym.kind,
+        filePath: sym.filePath,
+        isExported: sym.isExported,
+        purpose: sym.purpose,
+        domain: sym.domain,
+        role: sym.role,
+    };
+}
+/**
+ * Build the system prompt for Phase 3 (module deepening).
+ */
+export function buildDeepenSystemPrompt() {
+    return `You are a software architect splitting a large module into smaller sub-modules.
+
+## Your Task
+A module has too many members and needs to be split into 2-5 smaller sub-modules.
+Analyze the member symbols and propose sub-modules based on patterns in:
+- Names (e.g., use*Customer* → customers sub-module)
+- File paths (same file often = same sub-module)
+- Functionality (CRUD operations, queries, mutations, etc.)
+- Entity/domain groupings (customers, sales, vehicles, etc.)
+
+## Output Format
+Respond with **only** a CSV table with two row types:
+
+\`\`\`csv
+type,parent_path,slug,name,description,definition_id
+module,project.frontend.hooks.data-fetching,customers,"Customer Hooks","Hooks for customer data",
+module,project.frontend.hooks.data-fetching,sales,"Sales Hooks","Hooks for sales data",
+reassign,project.frontend.hooks.data-fetching.customers,,,,42
+reassign,project.frontend.hooks.data-fetching.customers,,,,43
+reassign,project.frontend.hooks.data-fetching.sales,,,,87
+\`\`\`
+
+Row types:
+- \`module\`: Creates a new sub-module. parent_path is the current module being split. Leave definition_id empty.
+- \`reassign\`: Moves a symbol to a sub-module. parent_path is the target module path (new sub-module). definition_id is required, other fields empty.
+
+## Slug Rules
+- Must start with lowercase letter
+- Only lowercase letters, numbers, and hyphens allowed
+- No consecutive hyphens
+- No trailing hyphens
+- Maximum 50 characters
+
+## Guidelines
+- Create 2-5 sub-modules (not more)
+- Every member MUST be reassigned to exactly one sub-module
+- Group related symbols together
+- Use clear, descriptive slugs based on the grouping pattern
+- Do NOT leave any members in the parent module
+- For API layer modules (controllers, routes, handlers), prioritize splitting by entity/domain
+  even if member count is low, because each entity typically has separate user flows`;
+}
+/**
+ * Build the user prompt for Phase 3 (module deepening).
+ */
+export function buildDeepenUserPrompt(module) {
+    const parts = [];
+    parts.push('## Module to Split');
+    parts.push(`Path: ${module.fullPath}`);
+    parts.push(`Name: ${module.name}`);
+    parts.push(`Members (${module.members.length}):`);
+    parts.push('');
+    for (const member of module.members) {
+        const tags = [];
+        if (isTestFile(member.filePath))
+            tags.push('test-file');
+        if (!member.isExported)
+            tags.push('not exported');
+        const tagStr = tags.length > 0 ? ` [${tags.join(', ')}]` : '';
+        parts.push(`- #${member.definitionId}: ${member.name} (${member.kind}) from ${member.filePath}${tagStr}`);
+    }
+    parts.push('');
+    parts.push('Propose sub-modules and reassign all members to them.');
+    return parts.join('\n');
+}
+/**
+ * Build the system prompt for ancestor rebalancing.
+ */
+export function buildRebalanceSystemPrompt() {
+    return `You are a software architect reviewing symbol assignments after a module was split into sub-modules.
+
+## Your Task
+Symbols are currently assigned to ancestor (parent/grandparent) modules. New sub-modules have been created below.
+Review each symbol and decide if it now fits better in one of the new sub-modules.
+Only reassign symbols that clearly belong in a new sub-module — leave ambiguous ones where they are.
+
+## Output Format
+Respond with **only** a CSV table. Only include rows for symbols you want to MOVE.
+Symbols not mentioned will stay in their current module.
+
+\`\`\`csv
+type,symbol_id,module_path
+assignment,42,project.frontend.hooks.customers
+assignment,87,project.frontend.hooks.sales
+\`\`\`
+
+## Guidelines
+- Only move a symbol if the new sub-module is a clearly better fit
+- Consider the symbol's name, kind, file path, and the sub-module descriptions
+- When in doubt, leave the symbol where it is
+- Module paths must match one of the new sub-modules listed below
+- If no symbols should be moved, respond with just the CSV header`;
+}
+/**
+ * Build the system prompt for aggressive branch pushdown.
+ * Unlike rebalance (conservative), this pushes ALL direct members to children.
+ */
+export function buildBranchPushdownSystemPrompt() {
+    return `You are a software architect pushing symbols from a parent module down to its children.
+
+## Your Task
+A module has both direct members AND child modules. Every symbol should be moved to
+the most appropriate child module. Only leave a symbol in the parent if NONE of the
+children are even remotely relevant.
+
+## Output Format
+Respond with **only** a CSV table. Include a row for EVERY symbol you want to move.
+
+\`\`\`csv
+type,symbol_id,module_path
+assignment,42,project.frontend.hooks.customers
+\`\`\`
+
+## Guidelines
+- Move EVERY symbol to the most appropriate child module
+- When choosing between children, prefer the child whose members share the same file or directory
+- Consider symbol name, kind, and file path
+- Module paths must match one of the child modules listed below
+- Only leave a symbol in the parent if absolutely none of the children fit
+- CRITICAL: Output a row for every symbol. Do not skip any.`;
+}
+/**
+ * Build the user prompt for ancestor rebalancing.
+ */
+export function buildRebalanceUserPrompt(ancestorSymbols, newSubModules) {
+    const parts = [];
+    parts.push('## New Sub-Modules');
+    parts.push('');
+    for (const sub of newSubModules) {
+        const desc = sub.description ? ` - ${sub.description}` : '';
+        parts.push(`- ${sub.path}: ${sub.name}${desc}`);
+    }
+    parts.push('');
+    parts.push('## Symbols Currently in Ancestor Modules');
+    parts.push('');
+    for (const group of ancestorSymbols) {
+        parts.push(`### ${group.modulePath} (${group.symbols.length} symbols)`);
+        for (const sym of group.symbols) {
+            const tags = [];
+            if (isTestFile(sym.filePath))
+                tags.push('test-file');
+            if (!sym.isExported)
+                tags.push('not exported');
+            const tagStr = tags.length > 0 ? ` [${tags.join(', ')}]` : '';
+            parts.push(`- #${sym.id}: ${sym.name} (${sym.kind}) from ${sym.filePath}${tagStr}`);
+        }
+        parts.push('');
+    }
+    parts.push('Reassign any symbols that now fit better in the new sub-modules.');
+    return parts.join('\n');
+}
+//# sourceMappingURL=module-prompts.js.map

package/dist/commands/llm/_shared/module-prompts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"module-prompts.js","sourceRoot":"","sources":["../../../../src/commands/llm/_shared/module-prompts.ts"],"names":[],"mappings":"AAAA;;GAEG;AA+BH;;GAEG;AACH,MAAM,UAAU,qBAAqB;IACnC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;+DAoEsD,CAAC;AAChE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAA8B;IAChE,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IACnC,KAAK,CAAC,IAAI,CAAC,kBAAkB,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;IACzD,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QACjD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAC3D,KAAK,CAAC,IAAI,CACR,kBAAkB,OAAO,CAAC,UAAU,mBAAmB,aAAa,iGAAiG,CACtK,CAAC;IACJ,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,8BAA8B;IAC9B,KAAK,CAAC,IAAI,CAAC,qBAAqB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACrC,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,WAAW,CAAC,CAAC;QAC7D,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,OAAO,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,oFAAoF;IACpF,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,WAAW,WAAW,CAAC,CAAC;IAC3D,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;IAE7D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,+DAA+D;AAC/D,UAAU;AACV,+DAA+D;AAE/D;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,QAAgB;IACzC,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACrD,OAAO,CACL,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC7B,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC;QAC9B,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;QAC7B,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC;QAC9B,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAC/B,CAAC;AACJ,CAAC;AAiBD;;GAEG;AACH,MAAM,UAAU,2BAA2B;IACzC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kGAqCyF,CAAC;AACnG,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,OAAiB,EAAE,cAAsC;IACjG,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,0BAA0B;IAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,OAAO,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,MAAM,KAAK,GAAG,cAAc,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,QAAQ,KAAK,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,OAAO,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,OAAiB,EACjB,OAA8B,EAC9B,cAAsC;IAEtC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,cAAc;IACd,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IACnC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC;IAC/D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,oBAAoB;IACpB,KAAK,CAAC,IAAI,CAAC,yBAAyB,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IACvD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;QACxD,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;YACb,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI,CACR,sCAAsC,OAAO,CAAC,MAAM,0CAA0C,OAAO,CAAC,MAAM,kCAAkC,CAC/I,CAAC;IAEF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,GAAwB;IAC5D,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,IAAI,EAAE,GAAG,CAAC,IAAI;KACf,CAAC;AACJ,CAAC;AAqBD;;GAEG;AACH,MAAM,UAAU,uBAAuB;IACrC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;qFAwC4E,CAAC;AACtF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAA0B;IAC9D,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACjC,KAAK,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;IACvC,KAAK,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACnC,KAAK,CAAC,IAAI,CAAC,YAAY,MAAM,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;IAClD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACpC,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAI,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,CAAC,UAAU;YAAE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,KAAK,CAAC,IAAI,CAAC,MAAM,MAAM,CAAC,YAAY,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,UAAU,MAAM,CAAC,QAAQ,GAAG,MAAM,EAAE,CAAC,CAAC;IAC5G,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,CAAC,IAAI,CAAC,uDAAuD,CAAC,CAAC;IAEpE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAkBD;;GAEG;AACH,MAAM,UAAU,0BAA0B;IACxC,OAAO;;;;;;;;;;;;;;;;;;;;;;kEAsByD,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,+BAA+B;IAC7C,OAAO;;;;;;;;;;;;;;;;;;;;;4DAqBmD,CAAC;AAC7D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CACtC,eAAsC,EACtC,aAAiC;IAEjC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IACjC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;IACvD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,OAAO,CAAC,MAAM,WAAW,CAAC,CAAC;QACxE,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,IAAI,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACrD,IAAI,CAAC,GAAG,CAAC,UAAU;gBAAE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9D,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,UAAU,GAAG,CAAC,QAAQ,GAAG,MAAM,EAAE,CAAC,CAAC;QACtF,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,kEAAkE,CAAC,CAAC;IAE/E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/commands/llm/_shared/process-utils.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Process group detection via import graph connectivity (union-find).
+ *
+ * Replaces the old layer-utils.ts which hardcoded frontend/backend classification.
+ * Instead of classifying modules by path keywords, we compute connected components
+ * in the non-type-only import graph. Modules whose files share a connected component
+ * are in the same OS process. Modules with no import connectivity are in separate
+ * processes and may communicate via runtime protocols (HTTP, IPC, queues, etc.).
+ */
+import type { IndexDatabase } from '../../../db/database-facade.js';
+import type { Module } from '../../../db/schema.js';
+export interface ProcessGroups {
+    /** moduleId → groupId */
+    moduleToGroup: Map<number, number>;
+    /** groupId → modules in that group */
+    groupToModules: Map<number, Module[]>;
+    /** Number of distinct process groups */
+    groupCount: number;
+}
+/**
+ * Compute process groups from import graph connectivity.
+ *
+ * 1. Get all file→module mappings
+ * 2. Get runtime (non-type-only) import edges between files
+ * 3. Union-find on file IDs using the edges → each file gets a group representative
+ * 4. Map each module to its group via its files' representatives (majority vote)
+ * 5. Build the ProcessGroups result
+ */
+export declare function computeProcessGroups(db: IndexDatabase): ProcessGroups;
+/**
+ * Check if two modules are in the same process group.
+ */
+export declare function areSameProcess(fromId: number, toId: number, groups: ProcessGroups): boolean;
+/**
+ * Human-readable description of the process relationship between two modules.
+ */
+export declare function getProcessDescription(fromId: number, toId: number, groups: ProcessGroups): string;
+/**
+ * Derive a label for a process group from its modules' common ancestor path.
+ *
+ * - If all modules start with `project.frontend.*` → label is "frontend"
+ * - If mixed → use the depth-1 ancestors as the label (e.g., "backend, shared")
+ */
+export declare function getProcessGroupLabel(modules: Module[]): string;
+/**
+ * Get all pairs of process groups for cross-process inference.
+ * Returns pairs of (groupA modules, groupB modules) for each unique group pair.
+ * Excludes singleton groups — a single-module group has no internal structure
+ * worth inferring cross-process communication for.
+ */
+export declare function getCrossProcessGroupPairs(groups: ProcessGroups): Array<[Module[], Module[]]>;
+//# sourceMappingURL=process-utils.d.ts.map

package/dist/commands/llm/_shared/process-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"process-utils.d.ts","sourceRoot":"","sources":["../../../../src/commands/llm/_shared/process-utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AACpE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAEpD,MAAM,WAAW,aAAa;IAC5B,yBAAyB;IACzB,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,sCAAsC;IACtC,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACtC,wCAAwC;IACxC,UAAU,EAAE,MAAM,CAAC;CACpB;AAmDD;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,aAAa,GAAG,aAAa,CAoErE;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,GAAG,OAAO,CAQ3F;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,GAAG,MAAM,CAKjG;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CA6C9D;AAED;;;;;GAKG;AACH,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,aAAa,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAkB5F"}

package/dist/commands/llm/_shared/process-utils.js

@@ -0,0 +1,214 @@
+/**
+ * Process group detection via import graph connectivity (union-find).
+ *
+ * Replaces the old layer-utils.ts which hardcoded frontend/backend classification.
+ * Instead of classifying modules by path keywords, we compute connected components
+ * in the non-type-only import graph. Modules whose files share a connected component
+ * are in the same OS process. Modules with no import connectivity are in separate
+ * processes and may communicate via runtime protocols (HTTP, IPC, queues, etc.).
+ */
+// ============================================================
+// Union-Find
+// ============================================================
+class UnionFind {
+    parent = new Map();
+    rank = new Map();
+    find(x) {
+        if (!this.parent.has(x)) {
+            this.parent.set(x, x);
+            this.rank.set(x, 0);
+        }
+        let root = x;
+        while (this.parent.get(root) !== root) {
+            root = this.parent.get(root);
+        }
+        // Path compression
+        let current = x;
+        while (current !== root) {
+            const next = this.parent.get(current);
+            this.parent.set(current, root);
+            current = next;
+        }
+        return root;
+    }
+    union(a, b) {
+        const rootA = this.find(a);
+        const rootB = this.find(b);
+        if (rootA === rootB)
+            return;
+        const rankA = this.rank.get(rootA);
+        const rankB = this.rank.get(rootB);
+        if (rankA < rankB) {
+            this.parent.set(rootA, rootB);
+        }
+        else if (rankA > rankB) {
+            this.parent.set(rootB, rootA);
+        }
+        else {
+            this.parent.set(rootB, rootA);
+            this.rank.set(rootA, rankA + 1);
+        }
+    }
+}
+// ============================================================
+// Public API
+// ============================================================
+/**
+ * Compute process groups from import graph connectivity.
+ *
+ * 1. Get all file→module mappings
+ * 2. Get runtime (non-type-only) import edges between files
+ * 3. Union-find on file IDs using the edges → each file gets a group representative
+ * 4. Map each module to its group via its files' representatives (majority vote)
+ * 5. Build the ProcessGroups result
+ */
+export function computeProcessGroups(db) {
+    const fileToModule = db.interactions.getFileToModuleMap();
+    const importEdges = db.interactions.getRuntimeImportEdges();
+    const allModules = db.modules.getAll();
+    // Build union-find over file IDs
+    const uf = new UnionFind();
+    // Ensure all files with module assignments are in the UF
+    for (const fileId of fileToModule.keys()) {
+        uf.find(fileId);
+    }
+    // Union files connected by runtime imports
+    for (const edge of importEdges) {
+        uf.union(edge.fromFileId, edge.toFileId);
+    }
+    // Map each module to its group representative via its files
+    // A module's group = the representative of the majority of its files
+    const moduleFiles = new Map(); // moduleId → fileIds
+    for (const [fileId, moduleId] of fileToModule) {
+        const files = moduleFiles.get(moduleId) ?? [];
+        files.push(fileId);
+        moduleFiles.set(moduleId, files);
+    }
+    const moduleToGroup = new Map();
+    const groupToModules = new Map();
+    for (const mod of allModules) {
+        const files = moduleFiles.get(mod.id);
+        if (!files || files.length === 0) {
+            // Module has no files with definitions → assign to its own isolated group
+            const isolatedGroup = -mod.id; // negative to avoid collision with file-based groups
+            moduleToGroup.set(mod.id, isolatedGroup);
+            groupToModules.set(isolatedGroup, [mod]);
+            continue;
+        }
+        // Count representative occurrences to find majority group
+        const repCounts = new Map();
+        for (const fileId of files) {
+            const rep = uf.find(fileId);
+            repCounts.set(rep, (repCounts.get(rep) ?? 0) + 1);
+        }
+        // Pick the representative with the most files
+        let bestRep = -1;
+        let bestCount = 0;
+        for (const [rep, count] of repCounts) {
+            if (count > bestCount) {
+                bestRep = rep;
+                bestCount = count;
+            }
+        }
+        moduleToGroup.set(mod.id, bestRep);
+        const existing = groupToModules.get(bestRep) ?? [];
+        existing.push(mod);
+        groupToModules.set(bestRep, existing);
+    }
+    return {
+        moduleToGroup,
+        groupToModules,
+        groupCount: groupToModules.size,
+    };
+}
+/**
+ * Check if two modules are in the same process group.
+ */
+export function areSameProcess(fromId, toId, groups) {
+    const fromGroup = groups.moduleToGroup.get(fromId);
+    const toGroup = groups.moduleToGroup.get(toId);
+    // If either module has no group, treat as same-process (conservative)
+    if (fromGroup === undefined || toGroup === undefined)
+        return true;
+    return fromGroup === toGroup;
+}
+/**
+ * Human-readable description of the process relationship between two modules.
+ */
+export function getProcessDescription(fromId, toId, groups) {
+    if (areSameProcess(fromId, toId, groups)) {
+        return 'same-process (shared import graph)';
+    }
+    return 'separate-process (no import connectivity)';
+}
+/**
+ * Derive a label for a process group from its modules' common ancestor path.
+ *
+ * - If all modules start with `project.frontend.*` → label is "frontend"
+ * - If mixed → use the depth-1 ancestors as the label (e.g., "backend, shared")
+ */
+export function getProcessGroupLabel(modules) {
+    if (modules.length === 0)
+        return 'empty';
+    if (modules.length === 1) {
+        const parts = modules[0].fullPath.split('.');
+        return parts.length > 1 ? parts[1] : parts[0];
+    }
+    // Find common path prefix segments
+    const allParts = modules.map((m) => m.fullPath.split('.'));
+    const minLen = Math.min(...allParts.map((p) => p.length));
+    let commonDepth = 0;
+    for (let i = 0; i < minLen; i++) {
+        const seg = allParts[0][i];
+        if (allParts.every((p) => p[i] === seg)) {
+            commonDepth = i + 1;
+        }
+        else {
+            break;
+        }
+    }
+    if (commonDepth > 1) {
+        // Use the deepest common segment as the label (skip project root)
+        const commonPath = allParts[0].slice(0, commonDepth).join('.');
+        const parts = commonPath.split('.');
+        return parts.slice(1).join('.');
+    }
+    // Root-only or no common prefix: use the most frequent depth-1 segment
+    const segCounts = new Map();
+    for (const parts of allParts) {
+        const seg = parts.length > 1 ? parts[1] : parts[0];
+        segCounts.set(seg, (segCounts.get(seg) ?? 0) + 1);
+    }
+    let bestSeg = '';
+    let bestCount = 0;
+    for (const [seg, count] of segCounts) {
+        if (count > bestCount) {
+            bestSeg = seg;
+            bestCount = count;
+        }
+    }
+    return bestSeg;
+}
+/**
+ * Get all pairs of process groups for cross-process inference.
+ * Returns pairs of (groupA modules, groupB modules) for each unique group pair.
+ * Excludes singleton groups — a single-module group has no internal structure
+ * worth inferring cross-process communication for.
+ */
+export function getCrossProcessGroupPairs(groups) {
+    // Filter out all singleton groups regardless of ID sign
+    const groupIds = Array.from(groups.groupToModules.keys()).filter((gid) => {
+        const mods = groups.groupToModules.get(gid);
+        return mods.length > 1;
+    });
+    const pairs = [];
+    for (let i = 0; i < groupIds.length; i++) {
+        for (let j = i + 1; j < groupIds.length; j++) {
+            const modulesA = groups.groupToModules.get(groupIds[i]);
+            const modulesB = groups.groupToModules.get(groupIds[j]);
+            pairs.push([modulesA, modulesB]);
+        }
+    }
+    return pairs;
+}
+//# sourceMappingURL=process-utils.js.map