@optave/codegraph 2.5.1 → 3.0.0

package/src/cochange.js

@@ -11,6 +11,7 @@ import path from 'node:path';
 import { normalizePath } from './constants.js';
 import { closeDb, findDbPath, initSchema, openDb, openReadonlyOrFail } from './db.js';
 import { warn } from './logger.js';
+import { paginateResult } from './paginate.js';
 import { isTestFile } from './queries.js';
 
 /**
@@ -313,7 +314,8 @@ export function coChangeData(file, customDbPath, opts = {}) {
   const meta = getCoChangeMeta(db);
   closeDb(db);
 
-  return { file: resolvedFile, partners, meta };
+  const base = { file: resolvedFile, partners, meta };
+  return paginateResult(base, 'partners', { limit: opts.limit, offset: opts.offset });
 }
 
 /**
@@ -365,7 +367,8 @@ export function coChangeTopData(customDbPath, opts = {}) {
   const meta = getCoChangeMeta(db);
   closeDb(db);
 
-  return { pairs, meta };
+  const base = { pairs, meta };
+  return paginateResult(base, 'pairs', { limit: opts.limit, offset: opts.offset });
 }
 
 /**

package/src/communities.js

@@ -2,6 +2,7 @@ import path from 'node:path';
 import Graph from 'graphology';
 import louvain from 'graphology-communities-louvain';
 import { openReadonlyOrFail } from './db.js';
+import { paginateResult, printNdjson } from './paginate.js';
 import { isTestFile } from './queries.js';
 
 // ─── Graph Construction ───────────────────────────────────────────────
@@ -201,7 +202,7 @@ export function communitiesData(customDbPath, opts = {}) {
 
   const driftScore = Math.round(((splitRatio + mergeRatio) / 2) * 100);
 
-  return {
+  const base = {
     communities: opts.drift ? [] : communities,
     modularity: +modularity.toFixed(4),
     drift: { splitCandidates, mergeCandidates },
@@ -212,6 +213,7 @@ export function communitiesData(customDbPath, opts = {}) {
       driftScore,
     },
   };
+  return paginateResult(base, 'communities', { limit: opts.limit, offset: opts.offset });
 }
 
 /**
@@ -238,6 +240,10 @@ export function communitySummaryForStats(customDbPath, opts = {}) {
 export function communities(customDbPath, opts = {}) {
   const data = communitiesData(customDbPath, opts);
 
+  if (opts.ndjson) {
+    printNdjson(data, 'communities');
+    return;
+  }
   if (opts.json) {
     console.log(JSON.stringify(data, null, 2));
     return;

package/src/complexity.js

@@ -3,6 +3,7 @@ import path from 'node:path';
 import { loadConfig } from './config.js';
 import { openReadonlyOrFail } from './db.js';
 import { info } from './logger.js';
+import { paginateResult, printNdjson } from './paginate.js';
 import { LANGUAGE_REGISTRY } from './parser.js';
 import { isTestFile } from './queries.js';
 
@@ -182,7 +183,7 @@ const CSHARP_RULES = {
     'if_statement',
     'else_clause',
     'for_statement',
-    'for_each_statement',
+    'foreach_statement',
     'while_statement',
     'do_statement',
     'catch_clause',
@@ -196,7 +197,7 @@ const CSHARP_RULES = {
   nestingNodes: new Set([
     'if_statement',
     'for_statement',
-    'for_each_statement',
+    'foreach_statement',
     'while_statement',
     'do_statement',
     'catch_clause',
@@ -210,9 +211,9 @@ const CSHARP_RULES = {
     'local_function_statement',
   ]),
   ifNodeType: 'if_statement',
-  elseNodeType: 'else_clause',
+  elseNodeType: null,
   elifNodeType: null,
-  elseViaAlternative: false,
+  elseViaAlternative: true,
   switchLikeNodes: new Set(['switch_statement']),
 };
 
@@ -290,7 +291,7 @@ export const COMPLEXITY_RULES = new Map([
   ['go', GO_RULES],
   ['rust', RUST_RULES],
   ['java', JAVA_RULES],
-  ['c_sharp', CSHARP_RULES],
+  ['csharp', CSHARP_RULES],
   ['ruby', RUBY_RULES],
   ['php', PHP_RULES],
 ]);
@@ -1025,7 +1026,7 @@ export const HALSTEAD_RULES = new Map([
   ['go', GO_HALSTEAD],
   ['rust', RUST_HALSTEAD],
   ['java', JAVA_HALSTEAD],
-  ['c_sharp', CSHARP_HALSTEAD],
+  ['csharp', CSHARP_HALSTEAD],
   ['ruby', RUBY_HALSTEAD],
   ['php', PHP_HALSTEAD],
 ]);
@@ -1115,7 +1116,7 @@ const COMMENT_PREFIXES = new Map([
   ['go', C_STYLE_PREFIXES],
   ['rust', C_STYLE_PREFIXES],
   ['java', C_STYLE_PREFIXES],
-  ['c_sharp', C_STYLE_PREFIXES],
+  ['csharp', C_STYLE_PREFIXES],
   ['python', ['#']],
   ['ruby', ['#']],
   ['php', ['//', '#', '/*', '*', '*/']],
@@ -1573,7 +1574,7 @@ export function computeAllMetrics(functionNode, langId) {
 /**
  * Find the function body node in a parse tree that matches a given line range.
  */
-function findFunctionNode(rootNode, startLine, _endLine, rules) {
+export function findFunctionNode(rootNode, startLine, _endLine, rules) {
   // tree-sitter lines are 0-indexed
   const targetStart = startLine - 1;
 
@@ -1799,7 +1800,6 @@ export async function buildComplexityMetrics(db, fileSymbols, rootDir, _engineOp
  */
 export function complexityData(customDbPath, opts = {}) {
   const db = openReadonlyOrFail(customDbPath);
-  const limit = opts.limit || 20;
   const sort = opts.sort || 'cognitive';
   const noTests = opts.noTests || false;
   const aboveThreshold = opts.aboveThreshold || false;
@@ -1887,13 +1887,19 @@ export function complexityData(customDbPath, opts = {}) {
        FROM function_complexity fc
        JOIN nodes n ON fc.node_id = n.id
        ${where} ${having}
-       ORDER BY ${orderBy}
-       LIMIT ?`,
+       ORDER BY ${orderBy}`,
       )
-      .all(...params, limit);
+      .all(...params);
   } catch {
+    // Check if graph has nodes even though complexity table is missing/empty
+    let hasGraph = false;
+    try {
+      hasGraph = db.prepare('SELECT COUNT(*) as c FROM nodes').get().c > 0;
+    } catch {
+      /* ignore */
+    }
     db.close();
-    return { functions: [], summary: null, thresholds };
+    return { functions: [], summary: null, thresholds, hasGraph };
   }
 
   // Post-filter test files if needed (belt-and-suspenders for isTestFile)
@@ -1979,8 +1985,99 @@ export function complexityData(customDbPath, opts = {}) {
     /* ignore */
   }
 
+  // When summary is null (no complexity rows), check if graph has nodes
+  let hasGraph = false;
+  if (summary === null) {
+    try {
+      hasGraph = db.prepare('SELECT COUNT(*) as c FROM nodes').get().c > 0;
+    } catch {
+      /* ignore */
+    }
+  }
+
   db.close();
-  return { functions, summary, thresholds };
+  const base = { functions, summary, thresholds, hasGraph };
+  return paginateResult(base, 'functions', { limit: opts.limit, offset: opts.offset });
+}
+
+/**
+ * Generator: stream complexity rows one-by-one using .iterate() for memory efficiency.
+ * @param {string} [customDbPath]
+ * @param {object} [opts]
+ * @param {boolean} [opts.noTests]
+ * @param {string} [opts.file]
+ * @param {string} [opts.target]
+ * @param {string} [opts.kind]
+ * @param {string} [opts.sort]
+ * @yields {{ name: string, kind: string, file: string, line: number, cognitive: number, cyclomatic: number, maxNesting: number, loc: number, sloc: number }}
+ */
+export function* iterComplexity(customDbPath, opts = {}) {
+  const db = openReadonlyOrFail(customDbPath);
+  try {
+    const noTests = opts.noTests || false;
+    const sort = opts.sort || 'cognitive';
+
+    let where = "WHERE n.kind IN ('function','method')";
+    const params = [];
+
+    if (noTests) {
+      where += ` AND n.file NOT LIKE '%.test.%'
+         AND n.file NOT LIKE '%.spec.%'
+         AND n.file NOT LIKE '%__test__%'
+         AND n.file NOT LIKE '%__tests__%'
+         AND n.file NOT LIKE '%.stories.%'`;
+    }
+    if (opts.target) {
+      where += ' AND n.name LIKE ?';
+      params.push(`%${opts.target}%`);
+    }
+    if (opts.file) {
+      where += ' AND n.file LIKE ?';
+      params.push(`%${opts.file}%`);
+    }
+    if (opts.kind) {
+      where += ' AND n.kind = ?';
+      params.push(opts.kind);
+    }
+
+    const orderMap = {
+      cognitive: 'fc.cognitive DESC',
+      cyclomatic: 'fc.cyclomatic DESC',
+      nesting: 'fc.max_nesting DESC',
+      mi: 'fc.maintainability_index ASC',
+      volume: 'fc.halstead_volume DESC',
+      effort: 'fc.halstead_effort DESC',
+      bugs: 'fc.halstead_bugs DESC',
+      loc: 'fc.loc DESC',
+    };
+    const orderBy = orderMap[sort] || 'fc.cognitive DESC';
+
+    const stmt = db.prepare(
+      `SELECT n.name, n.kind, n.file, n.line, n.end_line,
+              fc.cognitive, fc.cyclomatic, fc.max_nesting, fc.loc, fc.sloc
+       FROM function_complexity fc
+       JOIN nodes n ON fc.node_id = n.id
+       ${where}
+       ORDER BY ${orderBy}`,
+    );
+    for (const r of stmt.iterate(...params)) {
+      if (noTests && isTestFile(r.file)) continue;
+      yield {
+        name: r.name,
+        kind: r.kind,
+        file: r.file,
+        line: r.line,
+        endLine: r.end_line || null,
+        cognitive: r.cognitive,
+        cyclomatic: r.cyclomatic,
+        maxNesting: r.max_nesting,
+        loc: r.loc || 0,
+        sloc: r.sloc || 0,
+      };
+    }
+  } finally {
+    db.close();
+  }
 }
 
 /**
@@ -1989,6 +2086,10 @@ export function complexityData(customDbPath, opts = {}) {
 export function complexity(customDbPath, opts = {}) {
   const data = complexityData(customDbPath, opts);
 
+  if (opts.ndjson) {
+    printNdjson(data, 'functions');
+    return;
+  }
   if (opts.json) {
     console.log(JSON.stringify(data, null, 2));
     return;
@@ -1996,9 +2097,15 @@ export function complexity(customDbPath, opts = {}) {
 
   if (data.functions.length === 0) {
     if (data.summary === null) {
-      console.log(
-        '\nNo complexity data found. Run "codegraph build" first to analyze your codebase.\n',
-      );
+      if (data.hasGraph) {
+        console.log(
+          '\nNo complexity data found, but a graph exists. Run "codegraph build --no-incremental" to populate complexity metrics.\n',
+        );
+      } else {
+        console.log(
+          '\nNo complexity data found. Run "codegraph build" first to analyze your codebase.\n',
+        );
+      }
     } else {
       console.log('\nNo functions match the given filters.\n');
     }

package/src/config.js

@@ -14,6 +14,7 @@ export const DEFAULTS = {
   build: {
     incremental: true,
     dbPath: '.codegraph/graph.db',
+    driftThreshold: 0.2,
   },
   query: {
     defaultDepth: 3,
@@ -36,7 +37,16 @@ export const DEFAULTS = {
       fanIn: { warn: null, fail: null },
       fanOut: { warn: null, fail: null },
       noCycles: { warn: null, fail: null },
+      boundaries: { warn: null, fail: null },
     },
+    boundaries: null,
+  },
+  check: {
+    cycles: true,
+    blastRadius: null,
+    signatures: true,
+    boundaries: true,
+    depth: 3,
   },
   coChange: {
     since: '1 year ago',