gitnexus 1.4.9 → 1.5.0

package/dist/core/ingestion/cobol-processor.js

@@ -14,16 +14,14 @@
  */
 import path from 'node:path';
 import { generateId } from '../../lib/utils.js';
-import { SupportedLanguages } from '../../config/supported-languages.js';
+import { SupportedLanguages } from 'gitnexus-shared';
 import { preprocessCobolSource, extractCobolSymbolsWithRegex, } from './cobol/cobol-preprocessor.js';
 import { expandCopies } from './cobol/cobol-copy-expander.js';
 import { processJclFiles } from './cobol/jcl-processor.js';
 // ---------------------------------------------------------------------------
 // File detection
 // ---------------------------------------------------------------------------
-const COBOL_EXTENSIONS = new Set([
-    '.cob', '.cbl', '.cobol', '.cpy', '.copybook',
-]);
+const COBOL_EXTENSIONS = new Set(['.cob', '.cbl', '.cobol', '.cpy', '.copybook']);
 const JCL_EXTENSIONS = new Set(['.jcl', '.job', '.proc']);
 const COPYBOOK_EXTENSIONS = new Set(['.cpy', '.copybook']);
 /** Returns true if the file is a COBOL or copybook file. */
@@ -131,7 +129,7 @@ export const processCobol = (graph, files, allPathSet) => {
         result.calls += extracted.calls.length;
         result.copies += extracted.copies.length;
         result.execSqlBlocks += extracted.execSqlBlocks.length;
-        result.sqlIncludes += extracted.execSqlBlocks.filter(s => s.includeMember).length;
+        result.sqlIncludes += extracted.execSqlBlocks.filter((s) => s.includeMember).length;
         result.execCicsBlocks += extracted.execCicsBlocks.length;
         result.entryPoints += extracted.entryPoints.length;
         result.moves += extracted.moves.length;
@@ -150,7 +148,7 @@ export const processCobol = (graph, files, allPathSet) => {
     // This covers both `cobol-call-unresolved` and CICS LINK/XCTL edges
     // whose targets contain `<unresolved>:`.
     const unresolvedToRemove = [];
-    graph.forEachRelationship(rel => {
+    graph.forEachRelationship((rel) => {
         if (rel.type !== 'CALLS')
             return;
         const match = rel.targetId.match(/<unresolved>:(.+)/);
@@ -159,7 +157,8 @@ export const processCobol = (graph, files, allPathSet) => {
         const resolvedId = moduleNodeIds.get(match[1]);
         if (!resolvedId)
             return;
-        if (rel.reason?.startsWith('cobol-call-unresolved') || rel.reason === 'cobol-cancel-unresolved') {
+        if (rel.reason?.startsWith('cobol-call-unresolved') ||
+            rel.reason === 'cobol-cancel-unresolved') {
             // Replace unresolved CALL/CANCEL with resolved edge
             const resolvedReason = rel.reason === 'cobol-cancel-unresolved' ? 'cobol-cancel' : 'cobol-call';
             graph.addRelationship({
@@ -191,7 +190,7 @@ export const processCobol = (graph, files, allPathSet) => {
     }
     // ── 5. Process JCL files ───────────────────────────────────────────
     if (jclFiles.length > 0) {
-        const jclPaths = jclFiles.map(f => f.path);
+        const jclPaths = jclFiles.map((f) => f.path);
         const jclContents = new Map();
         for (const f of jclFiles) {
             jclContents.set(f.path, f.content);
@@ -237,9 +236,12 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
         const metaDesc = [
             extracted.programMetadata.author && `author:${extracted.programMetadata.author}`,
             extracted.programMetadata.dateWritten && `date:${extracted.programMetadata.dateWritten}`,
-            extracted.programMetadata.dateCompiled && `compiled:${extracted.programMetadata.dateCompiled}`,
+            extracted.programMetadata.dateCompiled &&
+                `compiled:${extracted.programMetadata.dateCompiled}`,
             extracted.programMetadata.installation && `install:${extracted.programMetadata.installation}`,
-        ].filter(Boolean).join(' ');
+        ]
+            .filter(Boolean)
+            .join(' ');
         graph.addNode({
             id: moduleId,
             label: 'Module',
@@ -289,7 +291,9 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
             },
         });
         // Find enclosing program by line-range containment
-        const enclosing = extracted.programs.find(p => p.startLine < prog.startLine && p.endLine > prog.endLine && p.nestingDepth < prog.nestingDepth);
+        const enclosing = extracted.programs.find((p) => p.startLine < prog.startLine &&
+            p.endLine > prog.endLine &&
+            p.nestingDepth < prog.nestingDepth);
         const nestedParent = enclosing
             ? (programModuleIds.get(enclosing.name.toUpperCase()) ?? moduleId ?? fileNodeId)
             : (moduleId ?? fileNodeId);
@@ -309,9 +313,7 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
     const sectionNodeIds = new Map();
     for (let i = 0; i < extracted.sections.length; i++) {
         const sec = extracted.sections[i];
-        const nextLine = i + 1 < extracted.sections.length
-            ? extracted.sections[i + 1].line - 1
-            : lines.length;
+        const nextLine = i + 1 < extracted.sections.length ? extracted.sections[i + 1].line - 1 : lines.length;
         const owningPgm = findOwningProgramName(sec.line, extracted.programs);
         const secId = generateId('Namespace', `${filePath}:${owningPgm ? owningPgm + ':' : ''}${sec.name}`);
         graph.addNode({
@@ -341,9 +343,7 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
     const paraNodeIds = new Map();
     for (let i = 0; i < extracted.paragraphs.length; i++) {
         const para = extracted.paragraphs[i];
-        const nextLine = i + 1 < extracted.paragraphs.length
-            ? extracted.paragraphs[i + 1].line - 1
-            : lines.length;
+        const nextLine = i + 1 < extracted.paragraphs.length ? extracted.paragraphs[i + 1].line - 1 : lines.length;
         const owningPgmPara = findOwningProgramName(para.line, extracted.programs);
         const paraId = generateId('Function', `${filePath}:${owningPgmPara ? owningPgmPara + ':' : ''}${para.name}`);
         graph.addNode({
@@ -359,8 +359,9 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
             },
         });
         // Parent: find the containing section, or fall back to module/file
-        const containerId = findContainingSection(para.line, extracted.sections, sectionNodeIds, extracted.programs)
-            ?? (programModuleIds.get(owningPgmPara ?? '') ?? parentId);
+        const containerId = findContainingSection(para.line, extracted.sections, sectionNodeIds, extracted.programs) ??
+            programModuleIds.get(owningPgmPara ?? '') ??
+            parentId;
         graph.addRelationship({
             id: generateId('CONTAINS', `${containerId}->${paraId}`),
             type: 'CONTAINS',
@@ -421,15 +422,16 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
     // Helper: look up paragraph/section by name scoped to the owning program
     const scopedParaLookup = (name, lineNum) => {
         const pgm = findOwningProgramName(lineNum, extracted.programs);
-        return paraNodeIds.get(`${pgm ?? ''}:${name.toUpperCase()}`)
-            ?? sectionNodeIds.get(`${pgm ?? ''}:${name.toUpperCase()}`);
+        return (paraNodeIds.get(`${pgm ?? ''}:${name.toUpperCase()}`) ??
+            sectionNodeIds.get(`${pgm ?? ''}:${name.toUpperCase()}`));
     };
     const scopedCallerLookup = (name, lineNum) => {
         if (!name)
             return owningModuleId(lineNum);
         const pgm = findOwningProgramName(lineNum, extracted.programs);
-        return paraNodeIds.get(`${pgm ?? ''}:${name.toUpperCase()}`)
-            ?? (programModuleIds.get(pgm ?? '') ?? parentId);
+        return (paraNodeIds.get(`${pgm ?? ''}:${name.toUpperCase()}`) ??
+            programModuleIds.get(pgm ?? '') ??
+            parentId);
     };
     /** Resolve the owning program's module ID for a given line (for nested program edge attribution). */
     const owningModuleId = (lineNum) => {
@@ -526,8 +528,7 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
         }
         const targetModuleId = moduleNodeIds.get(call.target.toUpperCase());
         // Create edge even if target not yet known — use a synthetic target id
-        const targetId = targetModuleId
-            ?? generateId('Module', `<unresolved>:${call.target.toUpperCase()}`);
+        const targetId = targetModuleId ?? generateId('Module', `<unresolved>:${call.target.toUpperCase()}`);
         const callOwner = owningModuleId(call.line);
         graph.addRelationship({
             id: generateId('CALLS', `${callOwner}->call->${call.target}:L${call.line}`),
@@ -668,12 +669,15 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
                 language: SupportedLanguages.Cobol,
                 description: [
                     cics.mapName && `map:${cics.mapName}`,
-                    cics.programName && `program:${cics.programName}${cics.programIsLiteral === false ? ' (dynamic)' : ''}`,
+                    cics.programName &&
+                        `program:${cics.programName}${cics.programIsLiteral === false ? ' (dynamic)' : ''}`,
                     cics.transId && `transid:${cics.transId}`,
                     cics.fileName && `file:${cics.fileName}`,
                     cics.queueName && `queue:${cics.queueName}`,
                     cics.labelName && `label:${cics.labelName}`,
-                ].filter(Boolean).join(' ') || undefined,
+                ]
+                    .filter(Boolean)
+                    .join(' ') || undefined,
             },
         });
         const cicsOwner = owningModuleId(cics.line);
@@ -694,26 +698,32 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
                     label: 'CodeElement',
                     properties: {
                         name: `CICS ${cics.command} ${cics.programName}`,
-                        filePath, startLine: cics.line, endLine: cics.line,
+                        filePath,
+                        startLine: cics.line,
+                        endLine: cics.line,
                         language: SupportedLanguages.Cobol,
                         description: `cics-dynamic-program (target is data item ${cics.programName})`,
                     },
                 });
                 graph.addRelationship({
                     id: generateId('CONTAINS', `${cicsOwner}->cics-dynamic-pgm:${cics.programName}:L${cics.line}`),
-                    type: 'CONTAINS', sourceId: cicsOwner,
+                    type: 'CONTAINS',
+                    sourceId: cicsOwner,
                     targetId: generateId('CodeElement', `${filePath}:cics-dynamic-pgm:${cics.programName}:L${cics.line}`),
-                    confidence: 1.0, reason: 'cics-dynamic-program',
+                    confidence: 1.0,
+                    reason: 'cics-dynamic-program',
                 });
             }
             else {
                 const cicsTargetModuleId = moduleNodeIds.get(cics.programName.toUpperCase());
-                const targetId = cicsTargetModuleId
-                    ?? generateId('Module', `<unresolved>:${cics.programName.toUpperCase()}`);
+                const targetId = cicsTargetModuleId ??
+                    generateId('Module', `<unresolved>:${cics.programName.toUpperCase()}`);
                 const cicsReason = `cics-${cics.command.toLowerCase()}`;
                 graph.addRelationship({
                     id: generateId('CALLS', `${cicsOwner}->cics-${cics.command.toLowerCase()}->${cics.programName}:L${cics.line}`),
-                    type: 'CALLS', sourceId: cicsOwner, targetId,
+                    type: 'CALLS',
+                    sourceId: cicsOwner,
+                    targetId,
                     confidence: cicsTargetModuleId ? 0.95 : 0.5,
                     reason: cicsTargetModuleId ? cicsReason : `${cicsReason}-unresolved`,
                 });
@@ -723,27 +733,44 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
         if (cics.fileName) {
             const fileRecordId = generateId('Record', `<cics-file>:${cics.fileName.toUpperCase()}`);
             const ioCommand = cics.command.toUpperCase();
-            const isRead = ['READ', 'STARTBR', 'READNEXT', 'READPREV', 'READ NEXT', 'READ PREV', 'ENDBR'].includes(ioCommand);
+            const isRead = [
+                'READ',
+                'STARTBR',
+                'READNEXT',
+                'READPREV',
+                'READ NEXT',
+                'READ PREV',
+                'ENDBR',
+            ].includes(ioCommand);
             const isWrite = ['WRITE', 'REWRITE', 'DELETE'].includes(ioCommand);
             const reason = isRead ? 'cics-file-read' : isWrite ? 'cics-file-write' : 'cics-file-access';
             graph.addRelationship({
                 id: generateId('ACCESSES', `${cicsId}->file->${cics.fileName}:L${cics.line}`),
-                type: 'ACCESSES', sourceId: cicsId, targetId: fileRecordId,
-                confidence: 0.9, reason,
+                type: 'ACCESSES',
+                sourceId: cicsId,
+                targetId: fileRecordId,
+                confidence: 0.9,
+                reason,
             });
         }
         // CICS QUEUE -> ACCESSES edge with differentiated reason (WRITEQ/READQ/DELETEQ TS/TD)
         if (cics.queueName) {
             const queueId = generateId('Record', `<queue>:${cics.queueName}`);
             const qCmd = cics.command.toUpperCase();
-            const qReason = qCmd.startsWith('READQ') ? 'cics-queue-read'
-                : qCmd.startsWith('WRITEQ') ? 'cics-queue-write'
-                    : qCmd.startsWith('DELETEQ') ? 'cics-queue-delete'
+            const qReason = qCmd.startsWith('READQ')
+                ? 'cics-queue-read'
+                : qCmd.startsWith('WRITEQ')
+                    ? 'cics-queue-write'
+                    : qCmd.startsWith('DELETEQ')
+                        ? 'cics-queue-delete'
                         : 'cics-queue';
             graph.addRelationship({
                 id: generateId('ACCESSES', `${cicsId}->queue->${cics.queueName}:L${cics.line}`),
-                type: 'ACCESSES', sourceId: cicsId, targetId: queueId,
-                confidence: 0.85, reason: qReason,
+                type: 'ACCESSES',
+                sourceId: cicsId,
+                targetId: queueId,
+                confidence: 0.85,
+                reason: qReason,
             });
         }
         // CICS RETURN/START TRANSID -> CALLS edge (transaction flow)
@@ -753,7 +780,9 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
                 const transNodeId = generateId('CodeElement', `<transid>:${cics.transId}`);
                 graph.addRelationship({
                     id: generateId('CALLS', `${cicsOwner}->${cmd === 'RETURN' ? 'return' : 'start'}-transid->${cics.transId}:L${cics.line}`),
-                    type: 'CALLS', sourceId: cicsOwner, targetId: transNodeId,
+                    type: 'CALLS',
+                    sourceId: cicsOwner,
+                    targetId: transNodeId,
                     confidence: 0.8,
                     reason: cmd === 'RETURN' ? 'cics-return-transid' : 'cics-start-transid',
                 });
@@ -764,8 +793,11 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
             const mapId = generateId('Record', `<map>:${cics.mapName}`);
             graph.addRelationship({
                 id: generateId('ACCESSES', `${cicsId}->map->${cics.mapName}:L${cics.line}`),
-                type: 'ACCESSES', sourceId: cicsId, targetId: mapId,
-                confidence: 0.85, reason: 'cics-map',
+                type: 'ACCESSES',
+                sourceId: cicsId,
+                targetId: mapId,
+                confidence: 0.85,
+                reason: 'cics-map',
             });
         }
         // CICS INTO(data-area) -> ACCESSES edge (data write target)
@@ -774,8 +806,11 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
             if (intoPropId) {
                 graph.addRelationship({
                     id: generateId('ACCESSES', `${cicsId}->into->${cics.intoField}:L${cics.line}`),
-                    type: 'ACCESSES', sourceId: cicsId, targetId: intoPropId,
-                    confidence: 0.9, reason: 'cics-receive-into',
+                    type: 'ACCESSES',
+                    sourceId: cicsId,
+                    targetId: intoPropId,
+                    confidence: 0.9,
+                    reason: 'cics-receive-into',
                 });
             }
         }
@@ -785,8 +820,11 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
             if (fromPropId) {
                 graph.addRelationship({
                     id: generateId('ACCESSES', `${cicsId}->from->${cics.fromField}:L${cics.line}`),
-                    type: 'ACCESSES', sourceId: cicsId, targetId: fromPropId,
-                    confidence: 0.9, reason: 'cics-send-from',
+                    type: 'ACCESSES',
+                    sourceId: cicsId,
+                    targetId: fromPropId,
+                    confidence: 0.9,
+                    reason: 'cics-send-from',
                 });
             }
         }
@@ -796,8 +834,11 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
             if (labelTargetId) {
                 graph.addRelationship({
                     id: generateId('CALLS', `${cicsOwner}->abend-label->${cics.labelName}:L${cics.line}`),
-                    type: 'CALLS', sourceId: cicsOwner, targetId: labelTargetId,
-                    confidence: 0.9, reason: 'cics-handle-abend',
+                    type: 'CALLS',
+                    sourceId: cicsOwner,
+                    targetId: labelTargetId,
+                    confidence: 0.9,
+                    reason: 'cics-handle-abend',
                 });
             }
         }
@@ -953,7 +994,9 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
                     dli.segmentName && `segment:${dli.segmentName}`,
                     dli.pcbNumber !== undefined && `pcb:${dli.pcbNumber}`,
                     dli.psbName && `psb:${dli.psbName}`,
-                ].filter(Boolean).join(' ') || undefined,
+                ]
+                    .filter(Boolean)
+                    .join(' ') || undefined,
             },
         });
         graph.addRelationship({
@@ -1125,7 +1168,9 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
                 label: 'CodeElement',
                 properties: {
                     name: `CANCEL ${cancel.target}`,
-                    filePath, startLine: cancel.line, endLine: cancel.line,
+                    filePath,
+                    startLine: cancel.line,
+                    endLine: cancel.line,
                     language: SupportedLanguages.Cobol,
                     description: 'dynamic-cancel (target is a data item, not resolvable statically)',
                 },
@@ -1133,15 +1178,16 @@ function mapToGraph(graph, extracted, file, copyResolutions, moduleNodeIds) {
             const cancelOwner = owningModuleId(cancel.line);
             graph.addRelationship({
                 id: generateId('CONTAINS', `${cancelOwner}->dynamic-cancel:${cancel.target}:L${cancel.line}`),
-                type: 'CONTAINS', sourceId: cancelOwner,
+                type: 'CONTAINS',
+                sourceId: cancelOwner,
                 targetId: generateId('CodeElement', `${filePath}:dynamic-cancel:${cancel.target}:L${cancel.line}`),
-                confidence: 1.0, reason: 'cobol-dynamic-cancel',
+                confidence: 1.0,
+                reason: 'cobol-dynamic-cancel',
             });
             continue;
         }
         const targetModuleId = moduleNodeIds.get(cancel.target.toUpperCase());
-        const targetId = targetModuleId
-            ?? generateId('Module', `<unresolved>:${cancel.target.toUpperCase()}`);
+        const targetId = targetModuleId ?? generateId('Module', `<unresolved>:${cancel.target.toUpperCase()}`);
         const cancelCallOwner = owningModuleId(cancel.line);
         graph.addRelationship({
             id: generateId('CALLS', `${cancelCallOwner}->cancel->${cancel.target}:L${cancel.line}`),

package/dist/core/ingestion/community-processor.js

@@ -53,8 +53,11 @@ export const processCommunities = async (knowledgeGraph, onProgress) => {
     onProgress?.('Building graph for community detection...', 0);
     // Pre-check total symbol count to determine large-graph mode before building
     let symbolCount = 0;
-    knowledgeGraph.forEachNode(node => {
-        if (node.label === 'Function' || node.label === 'Class' || node.label === 'Method' || node.label === 'Interface') {
+    knowledgeGraph.forEachNode((node) => {
+        if (node.label === 'Function' ||
+            node.label === 'Class' ||
+            node.label === 'Method' ||
+            node.label === 'Interface') {
             symbolCount++;
         }
     });
@@ -64,7 +67,7 @@ export const processCommunities = async (knowledgeGraph, onProgress) => {
         return {
             communities: [],
             memberships: [],
-            stats: { totalCommunities: 0, modularity: 0, nodesProcessed: 0 }
+            stats: { totalCommunities: 0, modularity: 0, nodesProcessed: 0 },
         };
     }
     const nodeCount = graph.order;
@@ -89,7 +92,9 @@ export const processCommunities = async (knowledgeGraph, onProgress) => {
             onProgress?.('Community detection timed out, using fallback...', 60);
             // Fallback: assign all nodes to community 0
             const communities = {};
-            graph.forEachNode((node) => { communities[node] = 0; });
+            graph.forEachNode((node) => {
+                communities[node] = 0;
+            });
             details = { communities, count: 1, modularity: 0 };
         }
         else {
@@ -116,7 +121,7 @@ export const processCommunities = async (knowledgeGraph, onProgress) => {
             totalCommunities: details.count,
             modularity: details.modularity,
             nodesProcessed: graph.order,
-        }
+        },
     };
 };
 // ============================================================================
@@ -129,12 +134,13 @@ export const processCommunities = async (knowledgeGraph, onProgress) => {
  */
 const MIN_CONFIDENCE_LARGE = 0.5;
 const buildGraphologyGraph = (knowledgeGraph, isLarge) => {
-    const graph = new Graph({ type: 'undirected', allowSelfLoops: false });
+    const GraphCtor = Graph;
+    const graph = new GraphCtor({ type: 'undirected', allowSelfLoops: false });
     const symbolTypes = new Set(['Function', 'Class', 'Method', 'Interface']);
     const clusteringRelTypes = new Set(['CALLS', 'EXTENDS', 'IMPLEMENTS']);
     const connectedNodes = new Set();
     const nodeDegree = new Map();
-    knowledgeGraph.forEachRelationship(rel => {
+    knowledgeGraph.forEachRelationship((rel) => {
         if (!clusteringRelTypes.has(rel.type) || rel.sourceId === rel.targetId)
             return;
         if (isLarge && rel.confidence < MIN_CONFIDENCE_LARGE)
@@ -144,7 +150,7 @@ const buildGraphologyGraph = (knowledgeGraph, isLarge) => {
         nodeDegree.set(rel.sourceId, (nodeDegree.get(rel.sourceId) || 0) + 1);
         nodeDegree.set(rel.targetId, (nodeDegree.get(rel.targetId) || 0) + 1);
     });
-    knowledgeGraph.forEachNode(node => {
+    knowledgeGraph.forEachNode((node) => {
         if (!symbolTypes.has(node.label) || !connectedNodes.has(node.id))
             return;
         // For large graphs, skip degree-1 nodes — they just become singletons or
@@ -157,12 +163,14 @@ const buildGraphologyGraph = (knowledgeGraph, isLarge) => {
             type: node.label,
         });
     });
-    knowledgeGraph.forEachRelationship(rel => {
+    knowledgeGraph.forEachRelationship((rel) => {
         if (!clusteringRelTypes.has(rel.type))
             return;
         if (isLarge && rel.confidence < MIN_CONFIDENCE_LARGE)
             return;
-        if (graph.hasNode(rel.sourceId) && graph.hasNode(rel.targetId) && rel.sourceId !== rel.targetId) {
+        if (graph.hasNode(rel.sourceId) &&
+            graph.hasNode(rel.targetId) &&
+            rel.sourceId !== rel.targetId) {
             if (!graph.hasEdge(rel.sourceId, rel.targetId)) {
                 graph.addEdge(rel.sourceId, rel.targetId);
             }
@@ -220,7 +228,7 @@ const createCommunityNodes = (communities, communityCount, graph, knowledgeGraph
 const generateHeuristicLabel = (memberIds, nodePathMap, graph, commNum) => {
     // Collect folder names from file paths
     const folderCounts = new Map();
-    memberIds.forEach(nodeId => {
+    memberIds.forEach((nodeId) => {
         const filePath = nodePathMap.get(nodeId) || '';
         const parts = filePath.split('/').filter(Boolean);
         // Get the most specific folder (parent directory)
@@ -247,7 +255,7 @@ const generateHeuristicLabel = (memberIds, nodePathMap, graph, commNum) => {
     }
     // Fallback: use function names to detect patterns
     const names = [];
-    memberIds.forEach(nodeId => {
+    memberIds.forEach((nodeId) => {
         const name = graph.getNodeAttribute(nodeId, 'name');
         if (name)
             names.push(name);
@@ -290,9 +298,7 @@ const calculateCohesion = (memberIds, graph) => {
     const memberSet = new Set(memberIds);
     // Sample up to 50 members for large communities
     const SAMPLE_SIZE = 50;
-    const sample = memberIds.length <= SAMPLE_SIZE
-        ? memberIds
-        : memberIds.slice(0, SAMPLE_SIZE);
+    const sample = memberIds.length <= SAMPLE_SIZE ? memberIds : memberIds.slice(0, SAMPLE_SIZE);
     let internalEdges = 0;
     let totalEdges = 0;
     for (const nodeId of sample) {

package/dist/core/ingestion/entry-point-scoring.d.ts

@@ -9,7 +9,7 @@
  *
  * This module is language-agnostic - language-specific patterns are defined per language.
  */
-import { SupportedLanguages } from '../../config/supported-languages.js';
+import { SupportedLanguages } from 'gitnexus-shared';
 export declare const ENTRY_POINT_PATTERNS: {
     javascript: RegExp[];
     typescript: RegExp[];

package/dist/core/ingestion/entry-point-scoring.js

@@ -10,7 +10,7 @@
  * This module is language-agnostic - language-specific patterns are defined per language.
  */
 import { detectFrameworkFromPath } from './framework-detection.js';
-import { SupportedLanguages } from '../../config/supported-languages.js';
+import { SupportedLanguages } from 'gitnexus-shared';
 // ============================================================================
 // NAME PATTERNS - All 13 supported languages
 // ============================================================================
@@ -213,7 +213,7 @@ export const ENTRY_POINT_PATTERNS = {
     [SupportedLanguages.Cobol]: [], // Standalone regex processor — no tree-sitter entry points
 };
 /** Pre-computed merged patterns (universal + language-specific) to avoid per-call array allocation. */
-const MERGED_ENTRY_POINT_PATTERNS = Object.fromEntries(Object.values(SupportedLanguages).map(lang => [
+const MERGED_ENTRY_POINT_PATTERNS = Object.fromEntries(Object.values(SupportedLanguages).map((lang) => [
     lang,
     [...UNIVERSAL_ENTRY_POINT_PATTERNS, ...(ENTRY_POINT_PATTERNS[lang] ?? [])],
 ]));
@@ -257,8 +257,7 @@ const UTILITY_PATTERNS = [
  * @param calleeCount - Number of functions this function calls
  * @returns Score and array of reasons explaining the score
  */
-export function calculateEntryPointScore(name, language, isExported, callerCount, calleeCount, filePath = '' // Optional for backwards compatibility
-) {
+export function calculateEntryPointScore(name, language, isExported, callerCount, calleeCount, filePath = '') {
     const reasons = [];
     // Must have outgoing calls to be an entry point (we need to trace forward)
     if (calleeCount === 0) {
@@ -276,14 +275,14 @@ export function calculateEntryPointScore(name, language, isExported, callerCount
     // Name pattern scoring
     let nameMultiplier = 1.0;
     // Check negative patterns first (utilities get penalized)
-    if (UTILITY_PATTERNS.some(p => p.test(name))) {
+    if (UTILITY_PATTERNS.some((p) => p.test(name))) {
         nameMultiplier = 0.3; // Significant penalty
         reasons.push('utility-pattern');
     }
     else {
         // Check positive patterns
         const allPatterns = MERGED_ENTRY_POINT_PATTERNS[language];
-        if (allPatterns?.some(p => p.test(name))) {
+        if (allPatterns?.some((p) => p.test(name))) {
             nameMultiplier = 1.5; // Bonus for matching entry point pattern
             reasons.push('entry-pattern');
         }

package/dist/core/ingestion/export-detection.js

@@ -54,12 +54,25 @@ export const javaExportChecker = (node, _name) => {
 };
 /** C# declaration node types for sibling modifier scanning. */
 const CSHARP_DECL_TYPES = new Set([
-    'method_declaration', 'local_function_statement', 'constructor_declaration',
-    'class_declaration', 'interface_declaration', 'struct_declaration',
-    'enum_declaration', 'record_declaration', 'record_struct_declaration',
-    'record_class_declaration', 'delegate_declaration',
-    'property_declaration', 'field_declaration', 'event_declaration',
-    'namespace_declaration', 'file_scoped_namespace_declaration',
+    'method_declaration',
+    'local_function_statement',
+    'constructor_declaration',
+    'class_declaration',
+    'interface_declaration',
+    'struct_declaration',
+    'enum_declaration',
+    'record_declaration',
+    // tree-sitter-c-sharp absorbs 'record struct' and 'record class' into
+    // record_declaration — these two node types are listed defensively but
+    // never emitted by the grammar in practice (verified against ^0.23.1).
+    'record_struct_declaration',
+    'record_class_declaration',
+    'delegate_declaration',
+    'property_declaration',
+    'field_declaration',
+    'event_declaration',
+    'namespace_declaration',
+    'file_scoped_namespace_declaration',
 ]);
 /**
  * C#: modifier nodes are SIBLINGS of the name node inside the declaration.
@@ -89,9 +102,19 @@ export const goExportChecker = (_node, name) => {
 };
 /** Rust declaration node types for sibling visibility_modifier scanning. */
 const RUST_DECL_TYPES = new Set([
-    'function_item', 'struct_item', 'enum_item', 'trait_item', 'impl_item',
-    'union_item', 'type_item', 'const_item', 'static_item', 'mod_item',
-    'use_declaration', 'associated_type', 'function_signature_item',
+    'function_item',
+    'struct_item',
+    'enum_item',
+    'trait_item',
+    'impl_item',
+    'union_item',
+    'type_item',
+    'const_item',
+    'static_item',
+    'mod_item',
+    'use_declaration',
+    'associated_type',
+    'function_signature_item',
 ]);
 /**
  * Rust: visibility_modifier is a SIBLING of the name node within the declaration node

package/dist/core/ingestion/field-extractor.d.ts

@@ -1,5 +1,5 @@
 import type { SyntaxNode } from './utils/ast-helpers.js';
-import { SupportedLanguages } from '../../config/supported-languages.js';
+import { SupportedLanguages } from 'gitnexus-shared';
 import type { FieldExtractorContext, ExtractedFields, FieldVisibility } from './field-types.js';
 /**
  * Language-specific field extractor

package/dist/core/ingestion/field-extractors/configs/c-cpp.js

@@ -1,5 +1,5 @@
 // gitnexus/src/core/ingestion/field-extractors/configs/c-cpp.ts
-import { SupportedLanguages } from '../../../../config/supported-languages.js';
+import { SupportedLanguages } from 'gitnexus-shared';
 import { hasKeyword } from './helpers.js';
 import { extractSimpleTypeName } from '../../type-extractors/shared.js';
 /**
@@ -46,8 +46,11 @@ function extractFieldType(node) {
         return extractSimpleTypeName(typeNode) ?? typeNode.text?.trim();
     // fallback: first child that is a type node
     const first = node.firstNamedChild;
-    if (first && (first.type === 'type_identifier' || first.type === 'primitive_type'
-        || first.type === 'sized_type_specifier' || first.type === 'template_type')) {
+    if (first &&
+        (first.type === 'type_identifier' ||
+            first.type === 'primitive_type' ||
+            first.type === 'sized_type_specifier' ||
+            first.type === 'template_type')) {
         return extractSimpleTypeName(first) ?? first.text?.trim();
     }
     return undefined;
@@ -57,11 +60,7 @@ function extractFieldType(node) {
 // ---------------------------------------------------------------------------
 export const cppConfig = {
     language: SupportedLanguages.CPlusPlus,
-    typeDeclarationNodes: [
-        'struct_specifier',
-        'class_specifier',
-        'union_specifier',
-    ],
+    typeDeclarationNodes: ['struct_specifier', 'class_specifier', 'union_specifier'],
     fieldNodeTypes: ['field_declaration'],
     bodyNodeTypes: ['field_declaration_list'],
     defaultVisibility: 'private', // C++ class default is private
@@ -87,10 +86,7 @@ export const cppConfig = {
 // ---------------------------------------------------------------------------
 export const cConfig = {
     language: SupportedLanguages.C,
-    typeDeclarationNodes: [
-        'struct_specifier',
-        'union_specifier',
-    ],
+    typeDeclarationNodes: ['struct_specifier', 'union_specifier'],
     fieldNodeTypes: ['field_declaration'],
     bodyNodeTypes: ['field_declaration_list'],
     defaultVisibility: 'public', // C structs are always public