@optave/codegraph 3.3.1 → 3.4.1

package/dist/features/complexity-query.js

@@ -0,0 +1,263 @@
+/**
+ * Complexity query functions — read-only DB queries for complexity metrics.
+ *
+ * Split from complexity.ts to separate query-time concerns (DB reads, filtering,
+ * pagination) from compute-time concerns (AST traversal, metric algorithms).
+ */
+import { openReadonlyOrFail } from '../db/index.js';
+import { buildFileConditionSQL } from '../db/query-builder.js';
+import { loadConfig } from '../infrastructure/config.js';
+import { debug } from '../infrastructure/logger.js';
+import { isTestFile } from '../infrastructure/test-filter.js';
+import { paginateResult } from '../shared/paginate.js';
+export function complexityData(customDbPath, opts = {}) {
+    const db = openReadonlyOrFail(customDbPath);
+    try {
+        const sort = opts.sort || 'cognitive';
+        const noTests = opts.noTests || false;
+        const aboveThreshold = opts.aboveThreshold || false;
+        const target = opts.target || null;
+        const fileFilter = opts.file || null;
+        const kindFilter = opts.kind || null;
+        // Load thresholds from config
+        const config = opts.config || loadConfig(process.cwd());
+        const thresholds = config.manifesto?.rules || {
+            cognitive: { warn: 15, fail: null },
+            cyclomatic: { warn: 10, fail: null },
+            maxNesting: { warn: 4, fail: null },
+            maintainabilityIndex: { warn: 20, fail: null },
+        };
+        // Build query
+        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 (target) {
+            where += ' AND n.name LIKE ?';
+            params.push(`%${target}%`);
+        }
+        {
+            const fc = buildFileConditionSQL(fileFilter, 'n.file');
+            where += fc.sql;
+            params.push(...fc.params);
+        }
+        if (kindFilter) {
+            where += ' AND n.kind = ?';
+            params.push(kindFilter);
+        }
+        const isValidThreshold = (v) => typeof v === 'number' && Number.isFinite(v);
+        let having = '';
+        if (aboveThreshold) {
+            const conditions = [];
+            if (isValidThreshold(thresholds.cognitive?.warn)) {
+                conditions.push(`fc.cognitive >= ${thresholds.cognitive.warn}`);
+            }
+            if (isValidThreshold(thresholds.cyclomatic?.warn)) {
+                conditions.push(`fc.cyclomatic >= ${thresholds.cyclomatic.warn}`);
+            }
+            if (isValidThreshold(thresholds.maxNesting?.warn)) {
+                conditions.push(`fc.max_nesting >= ${thresholds.maxNesting.warn}`);
+            }
+            if (isValidThreshold(thresholds.maintainabilityIndex?.warn)) {
+                conditions.push(`fc.maintainability_index > 0 AND fc.maintainability_index <= ${thresholds.maintainabilityIndex.warn}`);
+            }
+            if (conditions.length > 0) {
+                having = `AND (${conditions.join(' OR ')})`;
+            }
+        }
+        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';
+        let rows;
+        try {
+            rows = 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, fc.maintainability_index,
+                fc.halstead_volume, fc.halstead_difficulty, fc.halstead_effort, fc.halstead_bugs
+         FROM function_complexity fc
+         JOIN nodes n ON fc.node_id = n.id
+         ${where} ${having}
+         ORDER BY ${orderBy}`)
+                .all(...params);
+        }
+        catch (e) {
+            debug(`complexity query failed (table may not exist): ${e.message}`);
+            // 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) > 0;
+            }
+            catch (e2) {
+                debug(`nodes table check failed: ${e2.message}`);
+            }
+            return { functions: [], summary: null, thresholds, hasGraph };
+        }
+        // Post-filter test files if needed (belt-and-suspenders for isTestFile)
+        const filtered = noTests ? rows.filter((r) => !isTestFile(r.file)) : rows;
+        const functions = filtered.map((r) => {
+            const exceeds = [];
+            if (isValidThreshold(thresholds.cognitive?.warn) &&
+                r.cognitive >= (thresholds.cognitive?.warn ?? 0))
+                exceeds.push('cognitive');
+            if (isValidThreshold(thresholds.cyclomatic?.warn) &&
+                r.cyclomatic >= (thresholds.cyclomatic?.warn ?? 0))
+                exceeds.push('cyclomatic');
+            if (isValidThreshold(thresholds.maxNesting?.warn) &&
+                r.max_nesting >= (thresholds.maxNesting?.warn ?? 0))
+                exceeds.push('maxNesting');
+            if (isValidThreshold(thresholds.maintainabilityIndex?.warn) &&
+                r.maintainability_index > 0 &&
+                r.maintainability_index <= (thresholds.maintainabilityIndex?.warn ?? 0))
+                exceeds.push('maintainabilityIndex');
+            return {
+                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,
+                maintainabilityIndex: r.maintainability_index || 0,
+                halstead: {
+                    volume: r.halstead_volume || 0,
+                    difficulty: r.halstead_difficulty || 0,
+                    effort: r.halstead_effort || 0,
+                    bugs: r.halstead_bugs || 0,
+                },
+                exceeds: exceeds.length > 0 ? exceeds : undefined,
+            };
+        });
+        // Summary stats
+        let summary = null;
+        try {
+            const allRows = db
+                .prepare(`SELECT fc.cognitive, fc.cyclomatic, fc.max_nesting, fc.maintainability_index
+         FROM function_complexity fc JOIN nodes n ON fc.node_id = n.id
+         WHERE n.kind IN ('function','method')
+         ${noTests ? `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.%'` : ''}`)
+                .all();
+            if (allRows.length > 0) {
+                const miValues = allRows.map((r) => r.maintainability_index || 0);
+                summary = {
+                    analyzed: allRows.length,
+                    avgCognitive: +(allRows.reduce((s, r) => s + r.cognitive, 0) / allRows.length).toFixed(1),
+                    avgCyclomatic: +(allRows.reduce((s, r) => s + r.cyclomatic, 0) / allRows.length).toFixed(1),
+                    maxCognitive: Math.max(...allRows.map((r) => r.cognitive)),
+                    maxCyclomatic: Math.max(...allRows.map((r) => r.cyclomatic)),
+                    avgMI: +(miValues.reduce((s, v) => s + v, 0) / miValues.length).toFixed(1),
+                    minMI: +Math.min(...miValues).toFixed(1),
+                    aboveWarn: allRows.filter((r) => (isValidThreshold(thresholds.cognitive?.warn) &&
+                        r.cognitive >= (thresholds.cognitive?.warn ?? 0)) ||
+                        (isValidThreshold(thresholds.cyclomatic?.warn) &&
+                            r.cyclomatic >= (thresholds.cyclomatic?.warn ?? 0)) ||
+                        (isValidThreshold(thresholds.maxNesting?.warn) &&
+                            r.max_nesting >= (thresholds.maxNesting?.warn ?? 0)) ||
+                        (isValidThreshold(thresholds.maintainabilityIndex?.warn) &&
+                            r.maintainability_index > 0 &&
+                            r.maintainability_index <= (thresholds.maintainabilityIndex?.warn ?? 0))).length,
+                };
+            }
+        }
+        catch (e) {
+            debug(`complexity summary query failed: ${e.message}`);
+        }
+        // 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) > 0;
+            }
+            catch (e) {
+                debug(`nodes table check failed: ${e.message}`);
+            }
+        }
+        const base = { functions, summary, thresholds, hasGraph };
+        return paginateResult(base, 'functions', { limit: opts.limit, offset: opts.offset });
+    }
+    finally {
+        db.close();
+    }
+}
+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}%`);
+        }
+        {
+            const fc = buildFileConditionSQL(opts.file, 'n.file');
+            where += fc.sql;
+            params.push(...fc.params);
+        }
+        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();
+    }
+}
+//# sourceMappingURL=complexity-query.js.map

package/dist/features/complexity-query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity-query.js","sourceRoot":"","sources":["../../src/features/complexity-query.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,KAAK,EAAE,MAAM,6BAA6B,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,kCAAkC,CAAC;AAC9D,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAuBvD,MAAM,UAAU,cAAc,CAC5B,YAAqB,EACrB,OAUI,EAAE;IAEN,MAAM,EAAE,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC;IAC5C,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;QACtC,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAErC,8BAA8B;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;QACxD,MAAM,UAAU,GAAQ,MAAM,CAAC,SAAS,EAAE,KAAK,IAAI;YACjD,SAAS,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE;YACnC,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE;YACpC,UAAU,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE;YACnC,oBAAoB,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE;SAC/C,CAAC;QAEF,cAAc;QACd,IAAI,KAAK,GAAG,uCAAuC,CAAC;QACpD,MAAM,MAAM,GAAc,EAAE,CAAC;QAE7B,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,IAAI;;;;yCAI0B,CAAC;QACtC,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,IAAI,oBAAoB,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC;QAC7B,CAAC;QACD,CAAC;YACC,MAAM,EAAE,GAAG,qBAAqB,CAAC,UAAoB,EAAE,QAAQ,CAAC,CAAC;YACjE,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,UAAU,EAAE,CAAC;YACf,KAAK,IAAI,iBAAiB,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,gBAAgB,GAAG,CAAC,CAAU,EAAe,EAAE,CACnD,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE9C,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,cAAc,EAAE,CAAC;YACnB,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,IAAI,gBAAgB,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjD,UAAU,CAAC,IAAI,CAAC,mBAAmB,UAAU,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;YAClE,CAAC;YACD,IAAI,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC;gBAClD,UAAU,CAAC,IAAI,CAAC,oBAAoB,UAAU,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;YACpE,CAAC;YACD,IAAI,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC;gBAClD,UAAU,CAAC,IAAI,CAAC,qBAAqB,UAAU,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,gBAAgB,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC5D,UAAU,CAAC,IAAI,CACb,gEAAgE,UAAU,CAAC,oBAAoB,CAAC,IAAI,EAAE,CACvG,CAAC;YACJ,CAAC;YACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,GAAG,QAAQ,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAA2B;YACvC,SAAS,EAAE,mBAAmB;YAC9B,UAAU,EAAE,oBAAoB;YAChC,OAAO,EAAE,qBAAqB;YAC9B,EAAE,EAAE,8BAA8B;YAClC,MAAM,EAAE,yBAAyB;YACjC,MAAM,EAAE,yBAAyB;YACjC,IAAI,EAAE,uBAAuB;YAC7B,GAAG,EAAE,aAAa;SACnB,CAAC;QACF,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC;QAEtD,IAAI,IAAqB,CAAC;QAC1B,IAAI,CAAC;YACH,IAAI,GAAG,EAAE;iBACN,OAAO,CACN;;;;;;WAMC,KAAK,IAAI,MAAM;oBACN,OAAO,EAAE,CACpB;iBACA,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QACpB,CAAC;QAAC,OAAO,CAAU,EAAE,CAAC;YACpB,KAAK,CAAC,kDAAmD,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;YAChF,yEAAyE;YACzE,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,IAAI,CAAC;gBACH,QAAQ,GAAG,CAAC,EAAE,CAAC,OAAO,CAAgB,iCAAiC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9F,CAAC;YAAC,OAAO,EAAW,EAAE,CAAC;gBACrB,KAAK,CAAC,6BAA8B,EAAY,CAAC,OAAO,EAAE,CAAC,CAAC;YAC9D,CAAC;YACD,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;QAChE,CAAC;QAED,wEAAwE;QACxE,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE1E,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACnC,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,IACE,gBAAgB,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC;gBAC5C,CAAC,CAAC,SAAS,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,CAAC;gBAEhD,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5B,IACE,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC;gBAC7C,CAAC,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,CAAC;gBAElD,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7B,IACE,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC;gBAC7C,CAAC,CAAC,WAAW,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,CAAC;gBAEnD,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7B,IACE,gBAAgB,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,CAAC;gBACvD,CAAC,CAAC,qBAAqB,GAAG,CAAC;gBAC3B,CAAC,CAAC,qBAAqB,IAAI,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,IAAI,CAAC,CAAC;gBAEvE,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YAEvC,OAAO;gBACL,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,OAAO,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI;gBAC3B,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,UAAU,EAAE,CAAC,CAAC,WAAW;gBACzB,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;gBACf,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC;gBACjB,oBAAoB,EAAE,CAAC,CAAC,qBAAqB,IAAI,CAAC;gBAClD,QAAQ,EAAE;oBACR,MAAM,EAAE,CAAC,CAAC,eAAe,IAAI,CAAC;oBAC9B,UAAU,EAAE,CAAC,CAAC,mBAAmB,IAAI,CAAC;oBACtC,MAAM,EAAE,CAAC,CAAC,eAAe,IAAI,CAAC;oBAC9B,IAAI,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC;iBAC3B;gBACD,OAAO,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;aAClD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,gBAAgB;QAChB,IAAI,OAAO,GAAmC,IAAI,CAAC;QACnD,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,EAAE;iBACf,OAAO,CAMN;;;WAGC,OAAO,CAAC,CAAC,CAAC,oKAAoK,CAAC,CAAC,CAAC,EAAE,EAAE,CACvL;iBACA,GAAG,EAAE,CAAC;YAET,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,qBAAqB,IAAI,CAAC,CAAC,CAAC;gBAClE,OAAO,GAAG;oBACR,QAAQ,EAAE,OAAO,CAAC,MAAM;oBACxB,YAAY,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBACzF,aAAa,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CACtF,CAAC,CACF;oBACD,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAC1D,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBAC5D,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBAC1E,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBACxC,SAAS,EAAE,OAAO,CAAC,MAAM,CACvB,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,gBAAgB,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC;wBAC3C,CAAC,CAAC,SAAS,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;wBACnD,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC;4BAC5C,CAAC,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;wBACrD,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC;4BAC5C,CAAC,CAAC,WAAW,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;wBACtD,CAAC,gBAAgB,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,CAAC;4BACtD,CAAC,CAAC,qBAAqB,GAAG,CAAC;4BAC3B,CAAC,CAAC,qBAAqB,IAAI,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAC7E,CAAC,MAAM;iBACT,CAAC;YACJ,CAAC;QACH,CAAC;QAAC,OAAO,CAAU,EAAE,CAAC;YACpB,KAAK,CAAC,oCAAqC,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;QACpE,CAAC;QAED,sEAAsE;QACtE,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC;gBACH,QAAQ,GAAG,CAAC,EAAE,CAAC,OAAO,CAAgB,iCAAiC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9F,CAAC;YAAC,OAAO,CAAU,EAAE,CAAC;gBACpB,KAAK,CAAC,6BAA8B,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;QAC1D,OAAO,cAAc,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACvF,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC;AAeD,MAAM,SAAS,CAAC,CAAC,cAAc,CAC7B,YAAqB,EACrB,OAMI,EAAE;IAaN,MAAM,EAAE,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC;IAC5C,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,WAAW,CAAC;QAEtC,IAAI,KAAK,GAAG,uCAAuC,CAAC;QACpD,MAAM,MAAM,GAAc,EAAE,CAAC;QAE7B,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,IAAI;;;;2CAI4B,CAAC;QACxC,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,KAAK,IAAI,oBAAoB,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,CAAC;YACC,MAAM,EAAE,GAAG,qBAAqB,CAAC,IAAI,CAAC,IAAc,EAAE,QAAQ,CAAC,CAAC;YAChE,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,KAAK,IAAI,iBAAiB,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QAED,MAAM,QAAQ,GAA2B;YACvC,SAAS,EAAE,mBAAmB;YAC9B,UAAU,EAAE,oBAAoB;YAChC,OAAO,EAAE,qBAAqB;YAC9B,EAAE,EAAE,8BAA8B;YAClC,MAAM,EAAE,yBAAyB;YACjC,MAAM,EAAE,yBAAyB;YACjC,IAAI,EAAE,uBAAuB;YAC7B,GAAG,EAAE,aAAa;SACnB,CAAC;QACF,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC;QAEtD,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;;;;SAIG,KAAK;kBACI,OAAO,EAAE,CACtB,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC;YACxC,IAAI,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC5C,MAAM;gBACJ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,OAAO,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI;gBAC3B,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,UAAU,EAAE,CAAC,CAAC,WAAW;gBACzB,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;gBACf,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC;aAClB,CAAC;QACJ,CAAC;IACH,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/features/complexity.d.ts

@@ -1,127 +1,46 @@
-/**
- * Compute Halstead metrics for a function's AST subtree.
- *
- * @param {object} functionNode - tree-sitter node for the function
- * @param {string} language - Language ID
- * @returns {{ n1: number, n2: number, bigN1: number, bigN2: number, vocabulary: number, length: number, volume: number, difficulty: number, effort: number, bugs: number } | null}
- */
-export function computeHalsteadMetrics(functionNode: object, language: string): {
-    n1: number;
-    n2: number;
-    bigN1: number;
-    bigN2: number;
-    vocabulary: number;
-    length: number;
-    volume: number;
-    difficulty: number;
-    effort: number;
-    bugs: number;
-} | null;
-/**
- * Compute cognitive complexity, cyclomatic complexity, and max nesting depth
- * for a function's AST subtree in a single DFS walk.
- *
- * @param {object} functionNode - tree-sitter node for the function body
- * @param {string} language - Language ID (e.g. 'javascript', 'typescript')
- * @returns {{ cognitive: number, cyclomatic: number, maxNesting: number } | null}
- */
-export function computeFunctionComplexity(functionNode: object, language: string): {
+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 } from '../ast-analysis/shared.js';
+import type { BetterSqlite3Database, HalsteadDerivedMetrics, LOCMetrics, TreeSitterNode } from '../types.js';
+export { COMPLEXITY_RULES, HALSTEAD_RULES };
+export declare function computeHalsteadMetrics(functionNode: TreeSitterNode, language: string): HalsteadDerivedMetrics | null;
+export declare const computeLOCMetrics: typeof _computeLOCMetrics;
+export declare const computeMaintainabilityIndex: typeof _computeMaintainabilityIndex;
+export declare function computeFunctionComplexity(functionNode: TreeSitterNode, language: string): {
     cognitive: number;
     cyclomatic: number;
     maxNesting: number;
 } | null;
-/**
- * Compute all metrics (complexity + Halstead + LOC + MI) in a single DFS walk.
- * Merges computeFunctionComplexity and computeHalsteadMetrics into one tree
- * 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}
- */
-export function computeAllMetrics(functionNode: object, langId: string): {
+interface AllMetricsResult {
     cognitive: number;
     cyclomatic: number;
     maxNesting: number;
-    halstead: object | null;
-    loc: object;
+    halstead: HalsteadDerivedMetrics | null;
+    loc: LOCMetrics;
     mi: number;
-} | null;
-/**
- * Re-parse changed files with WASM tree-sitter, find function AST subtrees,
- * compute complexity, and upsert into function_complexity table.
- *
- * @param {object} db - open better-sqlite3 database (read-write)
- * @param {Map<string, object>} fileSymbols - Map<relPath, { definitions, ... }>
- * @param {string} rootDir - absolute project root path
- * @param {object} [engineOpts] - engine options (unused; always uses WASM for AST)
- */
-export function buildComplexityMetrics(db: object, fileSymbols: Map<string, object>, rootDir: string, _engineOpts: any): Promise<void>;
-/**
- * Return structured complexity data for querying.
- *
- * @param {string} [customDbPath] - Path to graph.db
- * @param {object} [opts] - Options
- * @param {string} [opts.target] - Function name filter (partial match)
- * @param {number} [opts.limit] - Max results (default: 20)
- * @param {string} [opts.sort] - Sort by: cognitive | cyclomatic | nesting (default: cognitive)
- * @param {boolean} [opts.aboveThreshold] - Only functions above warn thresholds
- * @param {string} [opts.file] - Filter by file (partial match)
- * @param {string} [opts.kind] - Filter by symbol kind
- * @param {boolean} [opts.noTests] - Exclude test files
- * @returns {{ functions: object[], summary: object, thresholds: object }}
- */
-export function complexityData(customDbPath?: string, opts?: {
-    target?: string | undefined;
-    limit?: number | undefined;
-    sort?: string | undefined;
-    aboveThreshold?: boolean | undefined;
-    file?: string | undefined;
-    kind?: string | undefined;
-    noTests?: boolean | undefined;
-}): {
-    functions: object[];
-    summary: object;
-    thresholds: object;
-};
-/**
- * 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?: string, opts?: {
-    noTests?: boolean | undefined;
-    file?: string | undefined;
-    target?: string | undefined;
-    kind?: string | undefined;
-    sort?: string | undefined;
-}): Generator<{
-    name: any;
-    kind: any;
-    file: any;
-    line: any;
-    endLine: any;
-    cognitive: any;
-    cyclomatic: any;
-    maxNesting: any;
-    loc: any;
-    sloc: any;
-}, void, unknown>;
-export const computeLOCMetrics: typeof _computeLOCMetrics;
-export const computeMaintainabilityIndex: typeof _computeMaintainabilityIndex;
-import { COMPLEXITY_RULES } from '../ast-analysis/rules/index.js';
-import { HALSTEAD_RULES } from '../ast-analysis/rules/index.js';
-import { computeLOCMetrics as _computeLOCMetrics } from '../ast-analysis/metrics.js';
-import { computeMaintainabilityIndex as _computeMaintainabilityIndex } from '../ast-analysis/metrics.js';
-import { findFunctionNode as _findFunctionNode } from '../ast-analysis/shared.js';
-export { COMPLEXITY_RULES, HALSTEAD_RULES, _findFunctionNode as findFunctionNode };
+}
+export declare function computeAllMetrics(functionNode: TreeSitterNode, langId: string): AllMetricsResult | null;
+export { _findFunctionNode as findFunctionNode };
+interface FileSymbols {
+    _tree?: {
+        rootNode: TreeSitterNode;
+    } | null;
+    _langId?: string | null;
+    definitions: Array<{
+        name: string;
+        kind: string;
+        line: number;
+        endLine?: number;
+        complexity?: {
+            cognitive: number;
+            cyclomatic: number;
+            maxNesting?: number;
+            maintainabilityIndex?: number;
+            halstead?: HalsteadDerivedMetrics | null;
+            loc?: LOCMetrics | null;
+        };
+    }>;
+}
+export declare function buildComplexityMetrics(db: BetterSqlite3Database, fileSymbols: Map<string, FileSymbols>, rootDir: string, _engineOpts?: unknown): Promise<void>;
+export { complexityData, iterComplexity } from './complexity-query.js';
 //# sourceMappingURL=complexity.d.ts.map

package/dist/features/complexity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"complexity.d.ts","sourceRoot":"","sources":["../../src/features/complexity.js"],"names":[],"mappings":"AA6BA;;;;;;GAMG;AACH,qDAJW,MAAM,YACN,MAAM,GACJ;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAiEjL;AAYD;;;;;;;GAOG;AACH,wDAJW,MAAM,YACN,MAAM,GACJ;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CA8JhF;AAID;;;;;;;;;;;GAWG;AACH,gDAJW,MAAM,UACN,MAAM,GACJ;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,GAAC,IAAI,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAmChI;AAkID;;;;;;;;GAQG;AACH,2CALW,MAAM,eACN,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,WACnB,MAAM,mCA6ChB;AAID;;;;;;;;;;;;;GAaG;AACH,8CAXW,MAAM,SAEd;IAAsB,MAAM;IACN,KAAK;IACL,IAAI;IACH,cAAc;IACf,IAAI;IACJ,IAAI;IACH,OAAO;CAC9B,GAAU;IAAE,SAAS,EAAE,MAAM,EAAE,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAmNxE;AAED;;;;;;;;;;GAUG;AACH,8CATW,MAAM,SAEd;IAAuB,OAAO;IACR,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,IAAI;CAC1B;;;;;;;;;;;kBAsEF;AAtsBD,0DAAoD;AAIpD,8EAAwE;iCArGvB,gCAAgC;+BAAhC,gCAAgC;wDAD1E,4BAA4B;4EAA5B,4BAA4B;sDAM5B,2BAA2B"}
+{"version":3,"file":"complexity.d.ts","sourceRoot":"","sources":["../../src/features/complexity.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,iBAAiB,IAAI,kBAAkB,EACvC,2BAA2B,IAAI,4BAA4B,EAC5D,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAClF,OAAO,EACL,gBAAgB,IAAI,iBAAiB,EAGtC,MAAM,2BAA2B,CAAC;AAKnC,OAAO,KAAK,EACV,qBAAqB,EAErB,sBAAsB,EAEtB,UAAU,EACV,cAAc,EACf,MAAM,aAAa,CAAC;AAGrB,OAAO,EAAE,gBAAgB,EAAE,cAAc,EAAE,CAAC;AAO5C,wBAAgB,sBAAsB,CACpC,YAAY,EAAE,cAAc,EAC5B,QAAQ,EAAE,MAAM,GACf,sBAAsB,GAAG,IAAI,CA+D/B;AAID,eAAO,MAAM,iBAAiB,2BAAqB,CAAC;AAIpD,eAAO,MAAM,2BAA2B,qCAA+B,CAAC;AAIxE,wBAAgB,yBAAyB,CACvC,YAAY,EAAE,cAAc,EAC5B,QAAQ,EAAE,MAAM,GACf;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CA4JtE;AAID,UAAU,gBAAgB;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,sBAAsB,GAAG,IAAI,CAAC;IACxC,GAAG,EAAE,UAAU,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,wBAAgB,iBAAiB,CAC/B,YAAY,EAAE,cAAc,EAC5B,MAAM,EAAE,MAAM,GACb,gBAAgB,GAAG,IAAI,CAsCzB;AAID,OAAO,EAAE,iBAAiB,IAAI,gBAAgB,EAAE,CAAC;AAEjD,UAAU,WAAW;IACnB,KAAK,CAAC,EAAE;QAAE,QAAQ,EAAE,cAAc,CAAA;KAAE,GAAG,IAAI,CAAC;IAC5C,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,WAAW,EAAE,KAAK,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,UAAU,CAAC,EAAE;YACX,SAAS,EAAE,MAAM,CAAC;YAClB,UAAU,EAAE,MAAM,CAAC;YACnB,UAAU,CAAC,EAAE,MAAM,CAAC;YACpB,oBAAoB,CAAC,EAAE,MAAM,CAAC;YAC9B,QAAQ,CAAC,EAAE,sBAAsB,GAAG,IAAI,CAAC;YACzC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC;SACzB,CAAC;KACH,CAAC,CAAC;CACJ;AAyJD,wBAAsB,sBAAsB,CAC1C,EAAE,EAAE,qBAAqB,EACzB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,EACrC,OAAO,EAAE,MAAM,EACf,WAAW,CAAC,EAAE,OAAO,GACpB,OAAO,CAAC,IAAI,CAAC,CA4Cf;AAKD,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC"}