@optave/codegraph 3.2.0 → 3.3.0

package/dist/features/complexity.d.ts

@@ -0,0 +1,127 @@
+/**
+ * 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): {
+    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): {
+    cognitive: number;
+    cyclomatic: number;
+    maxNesting: number;
+    halstead: object | null;
+    loc: object;
+    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 };
+//# sourceMappingURL=complexity.d.ts.map

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

@@ -0,0 +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"}