@optave/codegraph 3.1.1 → 3.1.2

package/src/communities.js

@@ -1,10 +1,15 @@
 import path from 'node:path';
 import Graph from 'graphology';
 import louvain from 'graphology-communities-louvain';
-import { openReadonlyOrFail } from './db.js';
+import {
+  getCallableNodes,
+  getCallEdges,
+  getFileNodesAll,
+  getImportEdges,
+  openReadonlyOrFail,
+} from './db.js';
+import { isTestFile } from './infrastructure/test-filter.js';
 import { paginateResult } from './paginate.js';
-import { outputResult } from './result-formatter.js';
-import { isTestFile } from './test-filter.js';
 
 // ─── Graph Construction ───────────────────────────────────────────────
 
@@ -22,9 +27,7 @@ function buildGraphologyGraph(db, opts = {}) {
 
   if (opts.functions) {
     // Function-level: nodes = function/method/class symbols, edges = calls
-    let nodes = db
-      .prepare("SELECT id, name, kind, file FROM nodes WHERE kind IN ('function','method','class')")
-      .all();
+    let nodes = getCallableNodes(db);
     if (opts.noTests) nodes = nodes.filter((n) => !isTestFile(n.file));
 
     const nodeIds = new Set();
@@ -34,7 +37,7 @@ function buildGraphologyGraph(db, opts = {}) {
       nodeIds.add(n.id);
     }
 
-    const edges = db.prepare("SELECT source_id, target_id FROM edges WHERE kind = 'calls'").all();
+    const edges = getCallEdges(db);
     for (const e of edges) {
       if (!nodeIds.has(e.source_id) || !nodeIds.has(e.target_id)) continue;
       const src = String(e.source_id);
@@ -46,7 +49,7 @@ function buildGraphologyGraph(db, opts = {}) {
     }
   } else {
     // File-level: nodes = files, edges = imports + imports-type (deduplicated, cross-file)
-    let nodes = db.prepare("SELECT id, name, file FROM nodes WHERE kind = 'file'").all();
+    let nodes = getFileNodesAll(db);
     if (opts.noTests) nodes = nodes.filter((n) => !isTestFile(n.file));
 
     const nodeIds = new Set();
@@ -56,9 +59,7 @@ function buildGraphologyGraph(db, opts = {}) {
       nodeIds.add(n.id);
     }
 
-    const edges = db
-      .prepare("SELECT source_id, target_id FROM edges WHERE kind IN ('imports','imports-type')")
-      .all();
+    const edges = getImportEdges(db);
     for (const e of edges) {
       if (!nodeIds.has(e.source_id) || !nodeIds.has(e.target_id)) continue;
       const src = String(e.source_id);
@@ -232,75 +233,3 @@ export function communitySummaryForStats(customDbPath, opts = {}) {
   const data = communitiesData(customDbPath, { ...opts, drift: true });
   return data.summary;
 }
-
-// ─── CLI Display ──────────────────────────────────────────────────────
-
-/**
- * CLI entry point: run community detection and print results.
- *
- * @param {string} [customDbPath]
- * @param {object} [opts]
- */
-export function communities(customDbPath, opts = {}) {
-  const data = communitiesData(customDbPath, opts);
-
-  if (outputResult(data, 'communities', opts)) return;
-
-  if (data.summary.communityCount === 0) {
-    console.log(
-      '\nNo communities detected. The graph may be too small or disconnected.\n' +
-        'Run "codegraph build" first to populate the graph.\n',
-    );
-    return;
-  }
-
-  const mode = opts.functions ? 'Function' : 'File';
-  console.log(`\n# ${mode}-Level Communities\n`);
-  console.log(
-    `  ${data.summary.communityCount} communities | ${data.summary.nodeCount} nodes | modularity: ${data.summary.modularity} | drift: ${data.summary.driftScore}%\n`,
-  );
-
-  if (!opts.drift) {
-    for (const c of data.communities) {
-      const dirs = Object.entries(c.directories)
-        .sort((a, b) => b[1] - a[1])
-        .map(([d, n]) => `${d} (${n})`)
-        .join(', ');
-      console.log(`  Community ${c.id} (${c.size} members): ${dirs}`);
-      if (c.members) {
-        const shown = c.members.slice(0, 8);
-        for (const m of shown) {
-          const kind = m.kind ? ` [${m.kind}]` : '';
-          console.log(`    - ${m.name}${kind}  ${m.file}`);
-        }
-        if (c.members.length > 8) {
-          console.log(`    ... and ${c.members.length - 8} more`);
-        }
-      }
-    }
-  }
-
-  // Drift analysis
-  const d = data.drift;
-  if (d.splitCandidates.length > 0 || d.mergeCandidates.length > 0) {
-    console.log(`\n# Drift Analysis (score: ${data.summary.driftScore}%)\n`);
-
-    if (d.splitCandidates.length > 0) {
-      console.log('  Split candidates (directories spanning multiple communities):');
-      for (const s of d.splitCandidates.slice(0, 10)) {
-        console.log(`    - ${s.directory} → ${s.communityCount} communities`);
-      }
-    }
-
-    if (d.mergeCandidates.length > 0) {
-      console.log('  Merge candidates (communities spanning multiple directories):');
-      for (const m of d.mergeCandidates.slice(0, 10)) {
-        console.log(
-          `    - Community ${m.communityId} (${m.size} members) → ${m.directoryCount} dirs: ${m.directories.join(', ')}`,
-        );
-      }
-    }
-  }
-
-  console.log();
-}

package/src/complexity.js

@@ -1,19 +1,23 @@
 import fs from 'node:fs';
 import path from 'node:path';
+import {
+  computeLOCMetrics as _computeLOCMetrics,
+  computeMaintainabilityIndex as _computeMaintainabilityIndex,
+} from './ast-analysis/metrics.js';
 import { COMPLEXITY_RULES, HALSTEAD_RULES } from './ast-analysis/rules/index.js';
 import {
   findFunctionNode as _findFunctionNode,
   buildExtensionSet,
   buildExtToLangMap,
 } from './ast-analysis/shared.js';
+import { walkWithVisitors } from './ast-analysis/visitor.js';
+import { createComplexityVisitor } from './ast-analysis/visitors/complexity-visitor.js';
 import { loadConfig } from './config.js';
-import { openReadonlyOrFail } from './db.js';
+import { getFunctionNodeId, openReadonlyOrFail } from './db.js';
+import { isTestFile } from './infrastructure/test-filter.js';
 import { info } from './logger.js';
 import { paginateResult } from './paginate.js';
 
-import { outputResult } from './result-formatter.js';
-import { isTestFile } from './test-filter.js';
-
 // Re-export rules for backward compatibility
 export { COMPLEXITY_RULES, HALSTEAD_RULES };
 
@@ -95,80 +99,12 @@ export function computeHalsteadMetrics(functionNode, language) {
 }
 
 // ─── LOC Metrics Computation ──────────────────────────────────────────────
-
-const C_STYLE_PREFIXES = ['//', '/*', '*', '*/'];
-
-const COMMENT_PREFIXES = new Map([
-  ['javascript', C_STYLE_PREFIXES],
-  ['typescript', C_STYLE_PREFIXES],
-  ['tsx', C_STYLE_PREFIXES],
-  ['go', C_STYLE_PREFIXES],
-  ['rust', C_STYLE_PREFIXES],
-  ['java', C_STYLE_PREFIXES],
-  ['csharp', C_STYLE_PREFIXES],
-  ['python', ['#']],
-  ['ruby', ['#']],
-  ['php', ['//', '#', '/*', '*', '*/']],
-]);
-
-/**
- * Compute LOC metrics from a function node's source text.
- *
- * @param {object} functionNode - tree-sitter node
- * @param {string} [language] - Language ID (falls back to C-style prefixes)
- * @returns {{ loc: number, sloc: number, commentLines: number }}
- */
-export function computeLOCMetrics(functionNode, language) {
-  const text = functionNode.text;
-  const lines = text.split('\n');
-  const loc = lines.length;
-  const prefixes = (language && COMMENT_PREFIXES.get(language)) || C_STYLE_PREFIXES;
-
-  let commentLines = 0;
-  let blankLines = 0;
-
-  for (const line of lines) {
-    const trimmed = line.trim();
-    if (trimmed === '') {
-      blankLines++;
-    } else if (prefixes.some((p) => trimmed.startsWith(p))) {
-      commentLines++;
-    }
-  }
-
-  const sloc = Math.max(1, loc - blankLines - commentLines);
-  return { loc, sloc, commentLines };
-}
+// Delegated to ast-analysis/metrics.js; re-exported for backward compatibility.
+export const computeLOCMetrics = _computeLOCMetrics;
 
 // ─── Maintainability Index ────────────────────────────────────────────────
-
-/**
- * Compute normalized Maintainability Index (0-100 scale).
- *
- * Original SEI formula: MI = 171 - 5.2*ln(V) - 0.23*G - 16.2*ln(LOC) + 50*sin(sqrt(2.4*CM))
- * Microsoft normalization: max(0, min(100, MI * 100/171))
- *
- * @param {number} volume - Halstead volume
- * @param {number} cyclomatic - Cyclomatic complexity
- * @param {number} sloc - Source lines of code
- * @param {number} [commentRatio] - Comment ratio (0-1), optional
- * @returns {number} Normalized MI (0-100)
- */
-export function computeMaintainabilityIndex(volume, cyclomatic, sloc, commentRatio) {
-  // Guard against zero/negative values in logarithms
-  const safeVolume = Math.max(volume, 1);
-  const safeSLOC = Math.max(sloc, 1);
-
-  let mi = 171 - 5.2 * Math.log(safeVolume) - 0.23 * cyclomatic - 16.2 * Math.log(safeSLOC);
-
-  if (commentRatio != null && commentRatio > 0) {
-    mi += 50 * Math.sin(Math.sqrt(2.4 * commentRatio));
-  }
-
-  // Microsoft normalization: 0-100 scale
-  const normalized = Math.max(0, Math.min(100, (mi * 100) / 171));
-  return +normalized.toFixed(1);
-}
+// Delegated to ast-analysis/metrics.js; re-exported for backward compatibility.
+export const computeMaintainabilityIndex = _computeMaintainabilityIndex;
 
 // ─── Algorithm: Single-Traversal DFS ──────────────────────────────────────
 
@@ -346,6 +282,8 @@ export function computeFunctionComplexity(functionNode, language) {
  * traversal, avoiding two separate DFS walks per function node at build time.
  * LOC is text-based (not tree-based) and computed separately (very cheap).
  *
+ * Now delegates to the complexity visitor via the unified walker.
+ *
  * @param {object} functionNode - tree-sitter node for the function
  * @param {string} langId - Language ID (e.g. 'javascript', 'python')
  * @returns {{ cognitive: number, cyclomatic: number, maxNesting: number, halstead: object|null, loc: object, mi: number } | null}
@@ -355,207 +293,34 @@ export function computeAllMetrics(functionNode, langId) {
   if (!cRules) return null;
   const hRules = HALSTEAD_RULES.get(langId);
 
-  // ── Complexity state ──
-  let cognitive = 0;
-  let cyclomatic = 1; // McCabe starts at 1
-  let maxNesting = 0;
-
-  // ── Halstead state ──
-  const operators = hRules ? new Map() : null;
-  const operands = hRules ? new Map() : null;
-
-  function walk(node, nestingLevel, isTopFunction, halsteadSkip) {
-    if (!node) return;
-
-    const type = node.type;
-
-    // ── Halstead classification ──
-    // Propagate skip through type-annotation subtrees (e.g. TS generics, Java type params)
-    const skipH = halsteadSkip || (hRules ? hRules.skipTypes.has(type) : false);
-    if (hRules && !skipH) {
-      // Compound operators (non-leaf): count node type as operator
-      if (hRules.compoundOperators.has(type)) {
-        operators.set(type, (operators.get(type) || 0) + 1);
-      }
-      // Leaf nodes: classify as operator or operand
-      if (node.childCount === 0) {
-        if (hRules.operatorLeafTypes.has(type)) {
-          operators.set(type, (operators.get(type) || 0) + 1);
-        } else if (hRules.operandLeafTypes.has(type)) {
-          const text = node.text;
-          operands.set(text, (operands.get(text) || 0) + 1);
-        }
-      }
-    }
-
-    // ── Complexity: track nesting depth ──
-    if (nestingLevel > maxNesting) maxNesting = nestingLevel;
-
-    // Handle logical operators in binary expressions
-    if (type === cRules.logicalNodeType) {
-      const op = node.child(1)?.type;
-      if (op && cRules.logicalOperators.has(op)) {
-        cyclomatic++;
-        const parent = node.parent;
-        let sameSequence = false;
-        if (parent && parent.type === cRules.logicalNodeType) {
-          const parentOp = parent.child(1)?.type;
-          if (parentOp === op) sameSequence = true;
-        }
-        if (!sameSequence) cognitive++;
-        for (let i = 0; i < node.childCount; i++) {
-          walk(node.child(i), nestingLevel, false, skipH);
-        }
-        return;
-      }
-    }
-
-    // Handle optional chaining (cyclomatic only)
-    if (type === cRules.optionalChainType) {
-      cyclomatic++;
-    }
-
-    // Handle branch/control flow nodes (skip keyword leaf tokens like Ruby's `if`)
-    if (cRules.branchNodes.has(type) && node.childCount > 0) {
-      // Pattern A: else clause wraps if (JS/C#/Rust)
-      if (cRules.elseNodeType && type === cRules.elseNodeType) {
-        const firstChild = node.namedChild(0);
-        if (firstChild && firstChild.type === cRules.ifNodeType) {
-          for (let i = 0; i < node.childCount; i++) {
-            walk(node.child(i), nestingLevel, false, skipH);
-          }
-          return;
-        }
-        cognitive++;
-        for (let i = 0; i < node.childCount; i++) {
-          walk(node.child(i), nestingLevel, false, skipH);
-        }
-        return;
-      }
-
-      // Pattern B: explicit elif node (Python/Ruby/PHP)
-      if (cRules.elifNodeType && type === cRules.elifNodeType) {
-        cognitive++;
-        cyclomatic++;
-        for (let i = 0; i < node.childCount; i++) {
-          walk(node.child(i), nestingLevel, false, skipH);
-        }
-        return;
-      }
-
-      // Detect else-if via Pattern A or C
-      let isElseIf = false;
-      if (type === cRules.ifNodeType) {
-        if (cRules.elseViaAlternative) {
-          isElseIf =
-            node.parent?.type === cRules.ifNodeType &&
-            node.parent.childForFieldName('alternative')?.id === node.id;
-        } else if (cRules.elseNodeType) {
-          isElseIf = node.parent?.type === cRules.elseNodeType;
-        }
-      }
-
-      if (isElseIf) {
-        cognitive++;
-        cyclomatic++;
-        for (let i = 0; i < node.childCount; i++) {
-          walk(node.child(i), nestingLevel, false, skipH);
-        }
-        return;
-      }
-
-      // Regular branch node
-      cognitive += 1 + nestingLevel;
-      cyclomatic++;
-
-      // Switch-like nodes don't add cyclomatic themselves (cases do)
-      if (cRules.switchLikeNodes?.has(type)) {
-        cyclomatic--;
-      }
-
-      if (cRules.nestingNodes.has(type)) {
-        for (let i = 0; i < node.childCount; i++) {
-          walk(node.child(i), nestingLevel + 1, false, skipH);
-        }
-        return;
-      }
-    }
-
-    // Pattern C plain else: block that is the alternative of an if_statement (Go/Java)
-    if (
-      cRules.elseViaAlternative &&
-      type !== cRules.ifNodeType &&
-      node.parent?.type === cRules.ifNodeType &&
-      node.parent.childForFieldName('alternative')?.id === node.id
-    ) {
-      cognitive++;
-      for (let i = 0; i < node.childCount; i++) {
-        walk(node.child(i), nestingLevel, false, skipH);
-      }
-      return;
-    }
-
-    // Handle case nodes (cyclomatic only, skip keyword leaves)
-    if (cRules.caseNodes.has(type) && node.childCount > 0) {
-      cyclomatic++;
-    }
-
-    // Handle nested function definitions (increase nesting)
-    if (!isTopFunction && cRules.functionNodes.has(type)) {
-      for (let i = 0; i < node.childCount; i++) {
-        walk(node.child(i), nestingLevel + 1, false, skipH);
-      }
-      return;
-    }
+  const visitor = createComplexityVisitor(cRules, hRules, { langId });
 
-    // Walk children
-    for (let i = 0; i < node.childCount; i++) {
-      walk(node.child(i), nestingLevel, false, skipH);
-    }
-  }
+  const nestingNodes = new Set(cRules.nestingNodes);
+  // NOTE: do NOT add functionNodes here — in function-level mode the walker
+  // walks a single function node, and adding it to nestingNodeTypes would
+  // inflate context.nestingLevel by +1 for the entire body.
 
-  walk(functionNode, 0, true, false);
-
-  // ── Compute Halstead derived metrics ──
-  let halstead = null;
-  if (hRules && operators && operands) {
-    const n1 = operators.size;
-    const n2 = operands.size;
-    let bigN1 = 0;
-    for (const c of operators.values()) bigN1 += c;
-    let bigN2 = 0;
-    for (const c of operands.values()) bigN2 += c;
-
-    const vocabulary = n1 + n2;
-    const length = bigN1 + bigN2;
-    const volume = vocabulary > 0 ? length * Math.log2(vocabulary) : 0;
-    const difficulty = n2 > 0 ? (n1 / 2) * (bigN2 / n2) : 0;
-    const effort = difficulty * volume;
-    const bugs = volume / 3000;
-
-    halstead = {
-      n1,
-      n2,
-      bigN1,
-      bigN2,
-      vocabulary,
-      length,
-      volume: +volume.toFixed(2),
-      difficulty: +difficulty.toFixed(2),
-      effort: +effort.toFixed(2),
-      bugs: +bugs.toFixed(4),
-    };
-  }
+  const results = walkWithVisitors(functionNode, [visitor], langId, {
+    nestingNodeTypes: nestingNodes,
+  });
 
-  // ── LOC metrics (text-based, cheap) ──
-  const loc = computeLOCMetrics(functionNode, langId);
+  const rawResult = results.complexity;
 
-  // ── Maintainability Index ──
-  const volume = halstead ? halstead.volume : 0;
+  // The visitor's finish() in function-level mode returns the raw metrics
+  // but without LOC (needs the functionNode text). Compute LOC + MI here.
+  const loc = _computeLOCMetrics(functionNode, langId);
+  const volume = rawResult.halstead ? rawResult.halstead.volume : 0;
   const commentRatio = loc.loc > 0 ? loc.commentLines / loc.loc : 0;
-  const mi = computeMaintainabilityIndex(volume, cyclomatic, loc.sloc, commentRatio);
+  const mi = _computeMaintainabilityIndex(volume, rawResult.cyclomatic, loc.sloc, commentRatio);
 
-  return { cognitive, cyclomatic, maxNesting, halstead, loc, mi };
+  return {
+    cognitive: rawResult.cognitive,
+    cyclomatic: rawResult.cyclomatic,
+    maxNesting: rawResult.maxNesting,
+    halstead: rawResult.halstead,
+    loc,
+    mi,
+  };
 }
 
 // ─── Build-Time: Compute Metrics for Changed Files ────────────────────────
@@ -612,10 +377,6 @@ export async function buildComplexityMetrics(db, fileSymbols, rootDir, _engineOp
       maintainability_index)
      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`,
   );
-  const getNodeId = db.prepare(
-    "SELECT id FROM nodes WHERE name = ? AND kind IN ('function','method') AND file = ? AND line = ?",
-  );
-
   let analyzed = 0;
 
   const tx = db.transaction(() => {
@@ -662,12 +423,12 @@ export async function buildComplexityMetrics(db, fileSymbols, rootDir, _engineOp
 
         // Use pre-computed complexity from native engine if available
         if (def.complexity) {
-          const row = getNodeId.get(def.name, relPath, def.line);
-          if (!row) continue;
+          const nodeId = getFunctionNodeId(db, def.name, relPath, def.line);
+          if (!nodeId) continue;
           const ch = def.complexity.halstead;
           const cl = def.complexity.loc;
           upsert.run(
-            row.id,
+            nodeId,
             def.complexity.cognitive,
             def.complexity.cyclomatic,
             def.complexity.maxNesting ?? 0,
@@ -700,12 +461,12 @@ export async function buildComplexityMetrics(db, fileSymbols, rootDir, _engineOp
         const metrics = computeAllMetrics(funcNode, langId);
         if (!metrics) continue;
 
-        const row = getNodeId.get(def.name, relPath, def.line);
-        if (!row) continue;
+        const nodeId = getFunctionNodeId(db, def.name, relPath, def.line);
+        if (!nodeId) continue;
 
         const h = metrics.halstead;
         upsert.run(
-          row.id,
+          nodeId,
           metrics.cognitive,
           metrics.cyclomatic,
           metrics.maxNesting,
@@ -1040,78 +801,3 @@ export function* iterComplexity(customDbPath, opts = {}) {
     db.close();
   }
 }
-
-/**
- * Format complexity output for CLI display.
- */
-export function complexity(customDbPath, opts = {}) {
-  const data = complexityData(customDbPath, opts);
-
-  if (outputResult(data, 'functions', opts)) return;
-
-  if (data.functions.length === 0) {
-    if (data.summary === null) {
-      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');
-    }
-    return;
-  }
-
-  const header = opts.aboveThreshold ? 'Functions Above Threshold' : 'Function Complexity';
-  console.log(`\n# ${header}\n`);
-
-  if (opts.health) {
-    // Health-focused view with Halstead + MI columns
-    console.log(
-      `  ${'Function'.padEnd(35)} ${'File'.padEnd(25)} ${'MI'.padStart(5)} ${'Vol'.padStart(7)} ${'Diff'.padStart(6)} ${'Effort'.padStart(9)} ${'Bugs'.padStart(6)} ${'LOC'.padStart(5)} ${'SLOC'.padStart(5)}`,
-    );
-    console.log(
-      `  ${'─'.repeat(35)} ${'─'.repeat(25)} ${'─'.repeat(5)} ${'─'.repeat(7)} ${'─'.repeat(6)} ${'─'.repeat(9)} ${'─'.repeat(6)} ${'─'.repeat(5)} ${'─'.repeat(5)}`,
-    );
-
-    for (const fn of data.functions) {
-      const name = fn.name.length > 33 ? `${fn.name.slice(0, 32)}…` : fn.name;
-      const file = fn.file.length > 23 ? `…${fn.file.slice(-22)}` : fn.file;
-      const miWarn = fn.exceeds?.includes('maintainabilityIndex') ? '!' : ' ';
-      console.log(
-        `  ${name.padEnd(35)} ${file.padEnd(25)} ${String(fn.maintainabilityIndex).padStart(5)}${miWarn}${String(fn.halstead.volume).padStart(7)} ${String(fn.halstead.difficulty).padStart(6)} ${String(fn.halstead.effort).padStart(9)} ${String(fn.halstead.bugs).padStart(6)} ${String(fn.loc).padStart(5)} ${String(fn.sloc).padStart(5)}`,
-      );
-    }
-  } else {
-    // Default view with MI column appended
-    console.log(
-      `  ${'Function'.padEnd(40)} ${'File'.padEnd(30)} ${'Cog'.padStart(4)} ${'Cyc'.padStart(4)} ${'Nest'.padStart(5)} ${'MI'.padStart(5)}`,
-    );
-    console.log(
-      `  ${'─'.repeat(40)} ${'─'.repeat(30)} ${'─'.repeat(4)} ${'─'.repeat(4)} ${'─'.repeat(5)} ${'─'.repeat(5)}`,
-    );
-
-    for (const fn of data.functions) {
-      const name = fn.name.length > 38 ? `${fn.name.slice(0, 37)}…` : fn.name;
-      const file = fn.file.length > 28 ? `…${fn.file.slice(-27)}` : fn.file;
-      const warn = fn.exceeds ? ' !' : '';
-      const mi = fn.maintainabilityIndex > 0 ? String(fn.maintainabilityIndex) : '-';
-      console.log(
-        `  ${name.padEnd(40)} ${file.padEnd(30)} ${String(fn.cognitive).padStart(4)} ${String(fn.cyclomatic).padStart(4)} ${String(fn.maxNesting).padStart(5)} ${mi.padStart(5)}${warn}`,
-      );
-    }
-  }
-
-  if (data.summary) {
-    const s = data.summary;
-    const miPart = s.avgMI != null ? ` | avg MI: ${s.avgMI}` : '';
-    console.log(
-      `\n  ${s.analyzed} functions analyzed | avg cognitive: ${s.avgCognitive} | avg cyclomatic: ${s.avgCyclomatic}${miPart} | ${s.aboveWarn} above threshold`,
-    );
-  }
-  console.log();
-}

package/src/cycles.js

@@ -1,5 +1,5 @@
+import { isTestFile } from './infrastructure/test-filter.js';
 import { loadNative } from './native.js';
-import { isTestFile } from './test-filter.js';
 
 /**
  * Detect circular dependencies in the codebase using Tarjan's SCC algorithm.