@liendev/core 0.19.5

package/dist/indexer/ast/chunker.js

@@ -0,0 +1,268 @@
+import { parseAST, detectLanguage, isASTSupported } from './parser.js';
+import { extractSymbolInfo, extractImports } from './symbols.js';
+import { calculateCognitiveComplexity, calculateHalstead } from './complexity/index.js';
+import { getTraverser } from './traversers/index.js';
+/**
+ * Chunk a file using AST-based semantic boundaries
+ *
+ * Uses Tree-sitter to parse code into an AST and extract semantic chunks
+ * (functions, classes, methods) that respect code structure.
+ *
+ * **Known Limitations:**
+ * - Tree-sitter may fail with "Invalid argument" error on very large files (1000+ lines)
+ * - When this occurs, Lien automatically falls back to line-based chunking
+ * - Configure fallback behavior via `chunking.astFallback` ('line-based' or 'error')
+ *
+ * @param filepath - Path to the file
+ * @param content - File content
+ * @param options - Chunking options
+ * @returns Array of AST-aware chunks
+ * @throws Error if AST parsing fails and astFallback is 'error'
+ */
+export function chunkByAST(filepath, content, options = {}) {
+    const { minChunkSize = 5 } = options;
+    // Check if AST is supported for this file
+    const language = detectLanguage(filepath);
+    if (!language) {
+        throw new Error(`Unsupported language for file: ${filepath}`);
+    }
+    // Parse the file
+    const parseResult = parseAST(content, language);
+    // If parsing failed, throw error (caller should fallback to line-based)
+    if (!parseResult.tree) {
+        throw new Error(`Failed to parse ${filepath}: ${parseResult.error}`);
+    }
+    const chunks = [];
+    const lines = content.split('\n');
+    const rootNode = parseResult.tree.rootNode;
+    // Get language-specific traverser
+    const traverser = getTraverser(language);
+    // Extract file-level imports once
+    const fileImports = extractImports(rootNode);
+    // Find all top-level function and class declarations
+    const topLevelNodes = findTopLevelNodes(rootNode, traverser);
+    for (const node of topLevelNodes) {
+        // For variable declarations, try to find the function inside
+        let actualNode = node;
+        if (traverser.isDeclarationWithFunction(node)) {
+            const declInfo = traverser.findFunctionInDeclaration(node);
+            if (declInfo.functionNode) {
+                actualNode = declInfo.functionNode;
+            }
+        }
+        // For methods, find the parent container name (e.g., class name)
+        const parentClassName = traverser.findParentContainerName(actualNode);
+        const symbolInfo = extractSymbolInfo(actualNode, content, parentClassName, language);
+        // Extract the code for this node (use original node for full declaration)
+        const nodeContent = getNodeContent(node, lines);
+        // Create a chunk for this semantic unit
+        // Note: Large functions are kept as single chunks (may exceed maxChunkSize)
+        // This preserves semantic boundaries - better than splitting mid-function
+        chunks.push(createChunk(filepath, node, nodeContent, symbolInfo, fileImports, language));
+    }
+    // Handle remaining code (imports, exports, top-level statements)
+    const coveredRanges = topLevelNodes.map(n => ({
+        start: n.startPosition.row,
+        end: n.endPosition.row,
+    }));
+    const uncoveredChunks = extractUncoveredCode(lines, coveredRanges, filepath, minChunkSize, fileImports, language);
+    chunks.push(...uncoveredChunks);
+    // Sort chunks by line number
+    chunks.sort((a, b) => a.metadata.startLine - b.metadata.startLine);
+    return chunks;
+}
+/** Check if node is a function-containing declaration at top level */
+function isFunctionDeclaration(node, depth, traverser) {
+    if (depth !== 0 || !traverser.isDeclarationWithFunction(node))
+        return false;
+    return traverser.findFunctionInDeclaration(node).hasFunction;
+}
+/** Check if node is a target type at valid depth */
+function isTargetNode(node, depth, traverser) {
+    return depth <= 1 && traverser.targetNodeTypes.includes(node.type);
+}
+/**
+ * Find all top-level nodes that should become chunks
+ *
+ * Uses a language-specific traverser to handle different AST structures.
+ * This function is now language-agnostic - all language-specific logic
+ * is delegated to the traverser.
+ *
+ * @param rootNode - Root AST node
+ * @param traverser - Language-specific traverser
+ * @returns Array of nodes to extract as chunks
+ */
+function findTopLevelNodes(rootNode, traverser) {
+    const nodes = [];
+    function traverse(node, depth) {
+        // Capture function declarations and target nodes
+        if (isFunctionDeclaration(node, depth, traverser) || isTargetNode(node, depth, traverser)) {
+            nodes.push(node);
+            return;
+        }
+        // Handle containers - traverse body at increased depth
+        if (traverser.shouldExtractChildren(node)) {
+            const body = traverser.getContainerBody(node);
+            if (body)
+                traverse(body, depth + 1);
+            return;
+        }
+        // Traverse children of traversable nodes
+        if (!traverser.shouldTraverseChildren(node))
+            return;
+        for (let i = 0; i < node.namedChildCount; i++) {
+            const child = node.namedChild(i);
+            if (child)
+                traverse(child, depth);
+        }
+    }
+    traverse(rootNode, 0);
+    return nodes;
+}
+/**
+ * Extract content for a specific AST node
+ */
+function getNodeContent(node, lines) {
+    const startLine = node.startPosition.row;
+    const endLine = node.endPosition.row;
+    return lines.slice(startLine, endLine + 1).join('\n');
+}
+/** Maps symbol types to legacy symbol array keys */
+const SYMBOL_TYPE_TO_ARRAY = {
+    function: 'functions',
+    method: 'functions',
+    class: 'classes',
+    interface: 'interfaces',
+};
+/** Symbol types that have meaningful complexity metrics */
+const COMPLEXITY_SYMBOL_TYPES = new Set(['function', 'method']);
+/**
+ * Build legacy symbols object for backward compatibility
+ */
+function buildLegacySymbols(symbolInfo) {
+    const symbols = { functions: [], classes: [], interfaces: [] };
+    if (symbolInfo?.name && symbolInfo.type) {
+        const arrayKey = SYMBOL_TYPE_TO_ARRAY[symbolInfo.type];
+        if (arrayKey)
+            symbols[arrayKey].push(symbolInfo.name);
+    }
+    return symbols;
+}
+/**
+ * Determine chunk type from symbol info
+ */
+function getChunkType(symbolInfo) {
+    if (!symbolInfo)
+        return 'block';
+    return symbolInfo.type === 'class' ? 'class' : 'function';
+}
+/**
+ * Create a chunk from an AST node
+ */
+function createChunk(filepath, node, content, symbolInfo, imports, language) {
+    const symbols = buildLegacySymbols(symbolInfo);
+    const shouldCalcComplexity = symbolInfo?.type && COMPLEXITY_SYMBOL_TYPES.has(symbolInfo.type);
+    // Calculate complexity metrics only for functions and methods
+    const cognitiveComplexity = shouldCalcComplexity
+        ? calculateCognitiveComplexity(node)
+        : undefined;
+    // Calculate Halstead metrics only for functions and methods
+    const halstead = shouldCalcComplexity
+        ? calculateHalstead(node, language)
+        : undefined;
+    return {
+        content,
+        metadata: {
+            file: filepath,
+            startLine: node.startPosition.row + 1,
+            endLine: node.endPosition.row + 1,
+            type: getChunkType(symbolInfo),
+            language,
+            symbols,
+            symbolName: symbolInfo?.name,
+            symbolType: symbolInfo?.type,
+            parentClass: symbolInfo?.parentClass,
+            complexity: symbolInfo?.complexity,
+            cognitiveComplexity,
+            parameters: symbolInfo?.parameters,
+            signature: symbolInfo?.signature,
+            imports,
+            // Halstead metrics
+            halsteadVolume: halstead?.volume,
+            halsteadDifficulty: halstead?.difficulty,
+            halsteadEffort: halstead?.effort,
+            halsteadBugs: halstead?.bugs,
+        },
+    };
+}
+/**
+ * Find gaps between covered ranges (uncovered code)
+ */
+function findUncoveredRanges(coveredRanges, totalLines) {
+    const uncoveredRanges = [];
+    let currentStart = 0;
+    // Sort covered ranges
+    const sortedRanges = [...coveredRanges].sort((a, b) => a.start - b.start);
+    for (const range of sortedRanges) {
+        if (currentStart < range.start) {
+            // There's a gap before this range
+            uncoveredRanges.push({
+                start: currentStart,
+                end: range.start - 1,
+            });
+        }
+        currentStart = range.end + 1;
+    }
+    // Handle remaining code after last covered range
+    if (currentStart < totalLines) {
+        uncoveredRanges.push({
+            start: currentStart,
+            end: totalLines - 1,
+        });
+    }
+    return uncoveredRanges;
+}
+/**
+ * Create a chunk from a line range
+ */
+function createChunkFromRange(range, lines, filepath, language, imports) {
+    const uncoveredLines = lines.slice(range.start, range.end + 1);
+    const content = uncoveredLines.join('\n').trim();
+    return {
+        content,
+        metadata: {
+            file: filepath,
+            startLine: range.start + 1,
+            endLine: range.end + 1,
+            type: 'block',
+            language,
+            // Empty symbols for uncovered code (imports, exports, etc.)
+            symbols: { functions: [], classes: [], interfaces: [] },
+            imports,
+        },
+    };
+}
+/**
+ * Validate that a chunk meets the minimum size requirements
+ */
+function isValidChunk(chunk, minChunkSize) {
+    const lineCount = chunk.metadata.endLine - chunk.metadata.startLine + 1;
+    return chunk.content.length > 0 && lineCount >= minChunkSize;
+}
+/**
+ * Extract code that wasn't covered by function/class chunks
+ * (imports, exports, top-level statements)
+ */
+function extractUncoveredCode(lines, coveredRanges, filepath, minChunkSize, imports, language) {
+    const uncoveredRanges = findUncoveredRanges(coveredRanges, lines.length);
+    return uncoveredRanges
+        .map(range => createChunkFromRange(range, lines, filepath, language, imports))
+        .filter(chunk => isValidChunk(chunk, minChunkSize));
+}
+/**
+ * Check if AST chunking should be used for a file
+ */
+export function shouldUseAST(filepath) {
+    return isASTSupported(filepath);
+}
+//# sourceMappingURL=chunker.js.map

package/dist/indexer/ast/chunker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunker.js","sourceRoot":"","sources":["../../../src/indexer/ast/chunker.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AACvE,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACjE,OAAO,EAAE,4BAA4B,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AACxF,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAOrD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,UAAU,CACxB,QAAgB,EAChB,OAAe,EACf,UAA2B,EAAE;IAE7B,MAAM,EAAE,YAAY,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;IAErC,0CAA0C;IAC1C,MAAM,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC1C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,kCAAkC,QAAQ,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,iBAAiB;IACjB,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEhD,wEAAwE;IACxE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,mBAAmB,QAAQ,KAAK,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC;IAE3C,kCAAkC;IAClC,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IAEzC,kCAAkC;IAClC,MAAM,WAAW,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAE7C,qDAAqD;IACrD,MAAM,aAAa,GAAG,iBAAiB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IAE7D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,6DAA6D;QAC7D,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,IAAI,SAAS,CAAC,yBAAyB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,MAAM,QAAQ,GAAG,SAAS,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;YAC3D,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC1B,UAAU,GAAG,QAAQ,CAAC,YAAY,CAAC;YACrC,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,MAAM,eAAe,GAAG,SAAS,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QAEtE,MAAM,UAAU,GAAG,iBAAiB,CAAC,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,QAAQ,CAAC,CAAC;QAErF,0EAA0E;QAC1E,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAEhD,wCAAwC;QACxC,4EAA4E;QAC5E,0EAA0E;QAC1E,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC3F,CAAC;IAED,iEAAiE;IACjE,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5C,KAAK,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG;QAC1B,GAAG,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG;KACvB,CAAC,CAAC,CAAC;IAEJ,MAAM,eAAe,GAAG,oBAAoB,CAC1C,KAAK,EACL,aAAa,EACb,QAAQ,EACR,YAAY,EACZ,WAAW,EACX,QAAQ,CACT,CAAC;IAEF,MAAM,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC;IAEhC,6BAA6B;IAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAEnE,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sEAAsE;AACtE,SAAS,qBAAqB,CAC5B,IAAuB,EACvB,KAAa,EACb,SAA0C;IAE1C,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,yBAAyB,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC5E,OAAO,SAAS,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC;AAC/D,CAAC;AAED,oDAAoD;AACpD,SAAS,YAAY,CACnB,IAAuB,EACvB,KAAa,EACb,SAA0C;IAE1C,OAAO,KAAK,IAAI,CAAC,IAAI,SAAS,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,iBAAiB,CACxB,QAA2B,EAC3B,SAA0C;IAE1C,MAAM,KAAK,GAAwB,EAAE,CAAC;IAEtC,SAAS,QAAQ,CAAC,IAAuB,EAAE,KAAa;QACtD,iDAAiD;QACjD,IAAI,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,IAAI,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;YAC1F,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO;QACT,CAAC;QAED,uDAAuD;QACvD,IAAI,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,IAAI;gBAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACpC,OAAO;QACT,CAAC;QAED,yCAAyC;QACzC,IAAI,CAAC,SAAS,CAAC,sBAAsB,CAAC,IAAI,CAAC;YAAE,OAAO;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,KAAK;gBAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACtB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,IAAuB,EAAE,KAAe;IAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;IAErC,OAAO,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxD,CAAC;AAED,oDAAoD;AACpD,MAAM,oBAAoB,GAA2D;IACnF,QAAQ,EAAE,WAAW;IACrB,MAAM,EAAE,WAAW;IACnB,KAAK,EAAE,SAAS;IAChB,SAAS,EAAE,YAAY;CACxB,CAAC;AAEF,2DAA2D;AAC3D,MAAM,uBAAuB,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;AAEhE;;GAEG;AACH,SAAS,kBAAkB,CAAC,UAAgD;IAK1E,MAAM,OAAO,GAAG,EAAE,SAAS,EAAE,EAAc,EAAE,OAAO,EAAE,EAAc,EAAE,UAAU,EAAE,EAAc,EAAE,CAAC;IAEnG,IAAI,UAAU,EAAE,IAAI,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,oBAAoB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,QAAQ;YAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,UAAgD;IACpE,IAAI,CAAC,UAAU;QAAE,OAAO,OAAO,CAAC;IAChC,OAAO,UAAU,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC;AAC5D,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAClB,QAAgB,EAChB,IAAuB,EACvB,OAAe,EACf,UAAgD,EAChD,OAAiB,EACjB,QAAgB;IAEhB,MAAM,OAAO,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;IAC/C,MAAM,oBAAoB,GAAG,UAAU,EAAE,IAAI,IAAI,uBAAuB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAE9F,8DAA8D;IAC9D,MAAM,mBAAmB,GAAG,oBAAoB;QAC9C,CAAC,CAAC,4BAA4B,CAAC,IAAI,CAAC;QACpC,CAAC,CAAC,SAAS,CAAC;IAEd,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,oBAAoB;QACnC,CAAC,CAAC,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC;QACnC,CAAC,CAAC,SAAS,CAAC;IAEd,OAAO;QACL,OAAO;QACP,QAAQ,EAAE;YACR,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;YACrC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC;YACjC,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC;YAC9B,QAAQ;YACR,OAAO;YACP,UAAU,EAAE,UAAU,EAAE,IAAI;YAC5B,UAAU,EAAE,UAAU,EAAE,IAAI;YAC5B,WAAW,EAAE,UAAU,EAAE,WAAW;YACpC,UAAU,EAAE,UAAU,EAAE,UAAU;YAClC,mBAAmB;YACnB,UAAU,EAAE,UAAU,EAAE,UAAU;YAClC,SAAS,EAAE,UAAU,EAAE,SAAS;YAChC,OAAO;YACP,mBAAmB;YACnB,cAAc,EAAE,QAAQ,EAAE,MAAM;YAChC,kBAAkB,EAAE,QAAQ,EAAE,UAAU;YACxC,cAAc,EAAE,QAAQ,EAAE,MAAM;YAChC,YAAY,EAAE,QAAQ,EAAE,IAAI;SAC7B;KACF,CAAC;AACJ,CAAC;AAUD;;GAEG;AACH,SAAS,mBAAmB,CAC1B,aAA0B,EAC1B,UAAkB;IAElB,MAAM,eAAe,GAAgB,EAAE,CAAC;IACxC,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,sBAAsB;IACtB,MAAM,YAAY,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE1E,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,IAAI,YAAY,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,kCAAkC;YAClC,eAAe,CAAC,IAAI,CAAC;gBACnB,KAAK,EAAE,YAAY;gBACnB,GAAG,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC;aACrB,CAAC,CAAC;QACL,CAAC;QACD,YAAY,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,iDAAiD;IACjD,IAAI,YAAY,GAAG,UAAU,EAAE,CAAC;QAC9B,eAAe,CAAC,IAAI,CAAC;YACnB,KAAK,EAAE,YAAY;YACnB,GAAG,EAAE,UAAU,GAAG,CAAC;SACpB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,KAAgB,EAChB,KAAe,EACf,QAAgB,EAChB,QAAgB,EAChB,OAAiB;IAEjB,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAC/D,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IAEjD,OAAO;QACL,OAAO;QACP,QAAQ,EAAE;YACR,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC;YAC1B,OAAO,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC;YACtB,IAAI,EAAE,OAAO;YACb,QAAQ;YACR,4DAA4D;YAC5D,OAAO,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;YACvD,OAAO;SACR;KACF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,KAAe,EAAE,YAAoB;IACzD,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC;IACxE,OAAO,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,IAAI,YAAY,CAAC;AAC/D,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAC3B,KAAe,EACf,aAAoD,EACpD,QAAgB,EAChB,YAAoB,EACpB,OAAiB,EACjB,QAAgB;IAEhB,MAAM,eAAe,GAAG,mBAAmB,CAAC,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAEzE,OAAO,eAAe;SACnB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SAC7E,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,OAAO,cAAc,CAAC,QAAQ,CAAC,CAAC;AAClC,CAAC"}

package/dist/indexer/ast/complexity/cognitive.d.ts

@@ -0,0 +1,16 @@
+import type Parser from 'tree-sitter';
+/**
+ * Calculate cognitive complexity of a function
+ *
+ * Based on SonarSource's Cognitive Complexity specification:
+ * - +1 for each break from linear flow (if, for, while, catch, etc.)
+ * - +1 for each nesting level when inside a control structure
+ * - +1 for each logical operator sequence break (a && b || c)
+ *
+ * @see https://www.sonarsource.com/docs/CognitiveComplexity.pdf
+ *
+ * @param node - AST node to analyze (typically a function/method)
+ * @returns Cognitive complexity score (minimum 0)
+ */
+export declare function calculateCognitiveComplexity(node: Parser.SyntaxNode): number;
+//# sourceMappingURL=cognitive.d.ts.map

package/dist/indexer/ast/complexity/cognitive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognitive.d.ts","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/cognitive.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AA+FtC;;;;;;;;;;;;GAYG;AACH,wBAAgB,4BAA4B,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,GAAG,MAAM,CA+B5E"}

package/dist/indexer/ast/complexity/cognitive.js

@@ -0,0 +1,106 @@
+// Node types that increase complexity AND increment nesting for children
+const NESTING_TYPES = new Set([
+    'if_statement', 'for_statement', 'while_statement', 'switch_statement',
+    'catch_clause', 'except_clause', 'do_statement', 'for_in_statement',
+    'for_of_statement', 'foreach_statement', 'match_statement',
+]);
+// Types that add complexity but DON'T nest (hybrid increments)
+const NON_NESTING_TYPES = new Set([
+    'else_clause', 'elif_clause', 'ternary_expression', 'conditional_expression',
+]);
+// Lambda types that add complexity when nested
+const LAMBDA_TYPES = new Set(['arrow_function', 'function_expression', 'lambda']);
+/**
+ * Check if node is a logical operator and return normalized form
+ */
+function getLogicalOperator(node) {
+    if (node.type !== 'binary_expression' && node.type !== 'boolean_operator') {
+        return null;
+    }
+    const operator = node.childForFieldName('operator');
+    const opText = operator?.text;
+    if (opText === '&&' || opText === 'and')
+        return '&&';
+    if (opText === '||' || opText === 'or')
+        return '||';
+    return null;
+}
+/**
+ * Determine nesting level for a child node based on SonarSource spec.
+ */
+function getChildNestingLevel(parent, child, currentLevel) {
+    const isCondition = parent.childForFieldName('condition') === child;
+    const isElseClause = NON_NESTING_TYPES.has(child.type);
+    return (!isCondition && !isElseClause) ? currentLevel + 1 : currentLevel;
+}
+/**
+ * Get complexity increment for nested lambda (only adds if already nested)
+ */
+function getNestedLambdaIncrement(nodeType, nestingLevel) {
+    return (LAMBDA_TYPES.has(nodeType) && nestingLevel > 0) ? 1 : 0;
+}
+/** Traverse logical operator children, passing the operator type */
+function traverseLogicalChildren(n, level, op, ctx) {
+    const operator = n.childForFieldName('operator');
+    for (let i = 0; i < n.namedChildCount; i++) {
+        const child = n.namedChild(i);
+        if (child && child !== operator)
+            ctx.traverse(child, level, op);
+    }
+}
+/** Traverse nesting type children with proper nesting level adjustment */
+function traverseNestingChildren(n, level, ctx) {
+    for (let i = 0; i < n.namedChildCount; i++) {
+        const child = n.namedChild(i);
+        if (child)
+            ctx.traverse(child, getChildNestingLevel(n, child, level), null);
+    }
+}
+/** Traverse all children at specified level */
+function traverseAllChildren(n, level, ctx) {
+    for (let i = 0; i < n.namedChildCount; i++) {
+        const child = n.namedChild(i);
+        if (child)
+            ctx.traverse(child, level, null);
+    }
+}
+/**
+ * Calculate cognitive complexity of a function
+ *
+ * Based on SonarSource's Cognitive Complexity specification:
+ * - +1 for each break from linear flow (if, for, while, catch, etc.)
+ * - +1 for each nesting level when inside a control structure
+ * - +1 for each logical operator sequence break (a && b || c)
+ *
+ * @see https://www.sonarsource.com/docs/CognitiveComplexity.pdf
+ *
+ * @param node - AST node to analyze (typically a function/method)
+ * @returns Cognitive complexity score (minimum 0)
+ */
+export function calculateCognitiveComplexity(node) {
+    let complexity = 0;
+    const ctx = { traverse };
+    function traverse(n, nestingLevel, lastLogicalOp) {
+        const logicalOp = getLogicalOperator(n);
+        if (logicalOp) {
+            complexity += (lastLogicalOp !== logicalOp) ? 1 : 0;
+            traverseLogicalChildren(n, nestingLevel, logicalOp, ctx);
+            return;
+        }
+        if (NESTING_TYPES.has(n.type)) {
+            complexity += 1 + nestingLevel;
+            traverseNestingChildren(n, nestingLevel, ctx);
+            return;
+        }
+        if (NON_NESTING_TYPES.has(n.type)) {
+            complexity += 1;
+            traverseAllChildren(n, nestingLevel + 1, ctx);
+            return;
+        }
+        complexity += getNestedLambdaIncrement(n.type, nestingLevel);
+        traverseAllChildren(n, nestingLevel, ctx);
+    }
+    traverse(node, 0, null);
+    return complexity;
+}
+//# sourceMappingURL=cognitive.js.map

package/dist/indexer/ast/complexity/cognitive.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognitive.js","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/cognitive.ts"],"names":[],"mappings":"AAEA,yEAAyE;AACzE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IAC5B,cAAc,EAAE,eAAe,EAAE,iBAAiB,EAAE,kBAAkB;IACtE,cAAc,EAAE,eAAe,EAAE,cAAc,EAAE,kBAAkB;IACnE,kBAAkB,EAAE,mBAAmB,EAAE,iBAAiB;CAC3D,CAAC,CAAC;AAEH,+DAA+D;AAC/D,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC;IAChC,aAAa,EAAE,aAAa,EAAE,oBAAoB,EAAE,wBAAwB;CAC7E,CAAC,CAAC;AAEH,+CAA+C;AAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,gBAAgB,EAAE,qBAAqB,EAAE,QAAQ,CAAC,CAAC,CAAC;AAOlF;;GAEG;AACH,SAAS,kBAAkB,CAAC,IAAuB;IACjD,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB,IAAI,IAAI,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,QAAQ,EAAE,IAAI,CAAC;IAE9B,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IACrD,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACpD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,MAAyB,EACzB,KAAwB,EACxB,YAAoB;IAEpB,MAAM,WAAW,GAAG,MAAM,CAAC,iBAAiB,CAAC,WAAW,CAAC,KAAK,KAAK,CAAC;IACpE,MAAM,YAAY,GAAG,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACvD,OAAO,CAAC,CAAC,WAAW,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;AAC3E,CAAC;AAED;;GAEG;AACH,SAAS,wBAAwB,CAAC,QAAgB,EAAE,YAAoB;IACtE,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED,oEAAoE;AACpE,SAAS,uBAAuB,CAC9B,CAAoB,EACpB,KAAa,EACb,EAAU,EACV,GAAqB;IAErB,MAAM,QAAQ,GAAG,CAAC,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,KAAK,IAAI,KAAK,KAAK,QAAQ;YAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;IAClE,CAAC;AACH,CAAC;AAED,0EAA0E;AAC1E,SAAS,uBAAuB,CAC9B,CAAoB,EACpB,KAAa,EACb,GAAqB;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,KAAK;YAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9E,CAAC;AACH,CAAC;AAED,+CAA+C;AAC/C,SAAS,mBAAmB,CAC1B,CAAoB,EACpB,KAAa,EACb,GAAqB;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,KAAK;YAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAC9C,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,4BAA4B,CAAC,IAAuB;IAClE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,GAAG,GAAqB,EAAE,QAAQ,EAAE,CAAC;IAE3C,SAAS,QAAQ,CAAC,CAAoB,EAAE,YAAoB,EAAE,aAA4B;QACxF,MAAM,SAAS,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;QAExC,IAAI,SAAS,EAAE,CAAC;YACd,UAAU,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,uBAAuB,CAAC,CAAC,EAAE,YAAY,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YACzD,OAAO;QACT,CAAC;QAED,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,UAAU,IAAI,CAAC,GAAG,YAAY,CAAC;YAC/B,uBAAuB,CAAC,CAAC,EAAE,YAAY,EAAE,GAAG,CAAC,CAAC;YAC9C,OAAO;QACT,CAAC;QAED,IAAI,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,UAAU,IAAI,CAAC,CAAC;YAChB,mBAAmB,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAC9C,OAAO;QACT,CAAC;QAED,UAAU,IAAI,wBAAwB,CAAC,CAAC,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QAC7D,mBAAmB,CAAC,CAAC,EAAE,YAAY,EAAE,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACxB,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/indexer/ast/complexity/cyclomatic.d.ts

@@ -0,0 +1,12 @@
+import type Parser from 'tree-sitter';
+/**
+ * Calculate cyclomatic complexity of a function
+ *
+ * Complexity = 1 (base) + number of decision points
+ * Decision points: if, while, do...while, for, for...in, for...of, foreach, case, catch, &&, ||, ?:
+ *
+ * @param node - AST node to analyze (typically a function/method)
+ * @returns Cyclomatic complexity score (minimum 1)
+ */
+export declare function calculateComplexity(node: Parser.SyntaxNode): number;
+//# sourceMappingURL=cyclomatic.d.ts.map

package/dist/indexer/ast/complexity/cyclomatic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cyclomatic.d.ts","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/cyclomatic.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AAgCtC;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,GAAG,MAAM,CAyBnE"}

package/dist/indexer/ast/complexity/cyclomatic.js

@@ -0,0 +1,61 @@
+/**
+ * Decision point node types for cyclomatic complexity calculation.
+ *
+ * These AST node types represent branch points in code flow.
+ */
+const DECISION_POINTS = [
+    // Common across languages (TypeScript/JavaScript/Python/PHP)
+    'if_statement', // if conditions
+    'while_statement', // while loops
+    'for_statement', // for loops
+    'switch_case', // switch/case statements
+    'catch_clause', // try/catch error handling
+    'ternary_expression', // Ternary operator (a ? b : c)
+    'binary_expression', // For && and || logical operators
+    // TypeScript/JavaScript specific
+    'do_statement', // do...while loops
+    'for_in_statement', // for...in loops
+    'for_of_statement', // for...of loops
+    // PHP specific
+    'foreach_statement', // PHP foreach loops
+    // Python specific
+    'elif_clause', // Python elif (adds decision point)
+    // Note: 'else_clause' is NOT a decision point (it's the default path)
+    'except_clause', // Python except (try/except)
+    'conditional_expression', // Python ternary (x if cond else y)
+];
+/**
+ * Calculate cyclomatic complexity of a function
+ *
+ * Complexity = 1 (base) + number of decision points
+ * Decision points: if, while, do...while, for, for...in, for...of, foreach, case, catch, &&, ||, ?:
+ *
+ * @param node - AST node to analyze (typically a function/method)
+ * @returns Cyclomatic complexity score (minimum 1)
+ */
+export function calculateComplexity(node) {
+    let complexity = 1; // Base complexity
+    function traverse(n) {
+        if (DECISION_POINTS.includes(n.type)) {
+            // For binary expressions, only count && and ||
+            if (n.type === 'binary_expression') {
+                const operator = n.childForFieldName('operator');
+                if (operator && (operator.text === '&&' || operator.text === '||')) {
+                    complexity++;
+                }
+            }
+            else {
+                complexity++;
+            }
+        }
+        // Traverse children
+        for (let i = 0; i < n.namedChildCount; i++) {
+            const child = n.namedChild(i);
+            if (child)
+                traverse(child);
+        }
+    }
+    traverse(node);
+    return complexity;
+}
+//# sourceMappingURL=cyclomatic.js.map

package/dist/indexer/ast/complexity/cyclomatic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cyclomatic.js","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/cyclomatic.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,eAAe,GAAG;IACtB,6DAA6D;IAC7D,cAAc,EAAW,gBAAgB;IACzC,iBAAiB,EAAQ,cAAc;IACvC,eAAe,EAAU,YAAY;IACrC,aAAa,EAAY,yBAAyB;IAClD,cAAc,EAAW,2BAA2B;IACpD,oBAAoB,EAAK,+BAA+B;IACxD,mBAAmB,EAAM,kCAAkC;IAE3D,iCAAiC;IACjC,cAAc,EAAW,mBAAmB;IAC5C,kBAAkB,EAAO,iBAAiB;IAC1C,kBAAkB,EAAO,iBAAiB;IAE1C,eAAe;IACf,mBAAmB,EAAM,oBAAoB;IAE7C,kBAAkB;IAClB,aAAa,EAAY,oCAAoC;IAC7D,sEAAsE;IACtE,eAAe,EAAU,6BAA6B;IACtD,wBAAwB,EAAE,oCAAoC;CAC/D,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAuB;IACzD,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,kBAAkB;IAEtC,SAAS,QAAQ,CAAC,CAAoB;QACpC,IAAI,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,+CAA+C;YAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;gBACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;gBACjD,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;oBACnE,UAAU,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,UAAU,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,KAAK;gBAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IACf,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/indexer/ast/complexity/halstead.d.ts

@@ -0,0 +1,55 @@
+import type Parser from 'tree-sitter';
+/** Raw Halstead counts from AST */
+export interface HalsteadCounts {
+    n1: number;
+    n2: number;
+    N1: number;
+    N2: number;
+    operators: Map<string, number>;
+    operands: Map<string, number>;
+}
+/** Calculated Halstead metrics */
+export interface HalsteadMetrics {
+    vocabulary: number;
+    length: number;
+    volume: number;
+    difficulty: number;
+    effort: number;
+    time: number;
+    bugs: number;
+}
+/**
+ * Count operators and operands in an AST node
+ *
+ * @param node - AST node to analyze (typically a function/method)
+ * @param language - Programming language for language-specific handling
+ * @returns HalsteadCounts with raw operator/operand counts
+ */
+export declare function countHalstead(node: Parser.SyntaxNode, language: string): HalsteadCounts;
+/**
+ * Calculate derived Halstead metrics from raw counts
+ *
+ * Formulas based on Maurice Halstead's "Elements of Software Science" (1977):
+ * - Vocabulary (n) = n1 + n2
+ * - Length (N) = N1 + N2
+ * - Volume (V) = N × log₂(n) - size of implementation
+ * - Difficulty (D) = (n1/2) × (N2/n2) - error-proneness
+ * - Effort (E) = D × V - mental effort required
+ * - Time (T) = E / 18 - seconds to understand (Stroud number)
+ * - Bugs (B) = V / 3000 - estimated delivered bugs
+ *
+ * @param counts - Raw Halstead counts from countHalstead()
+ * @returns Calculated HalsteadMetrics
+ */
+export declare function calculateHalsteadMetrics(counts: HalsteadCounts): HalsteadMetrics;
+/**
+ * Calculate Halstead metrics for an AST node in one call
+ *
+ * Convenience function that combines countHalstead and calculateHalsteadMetrics.
+ *
+ * @param node - AST node to analyze
+ * @param language - Programming language
+ * @returns Calculated HalsteadMetrics
+ */
+export declare function calculateHalstead(node: Parser.SyntaxNode, language: string): HalsteadMetrics;
+//# sourceMappingURL=halstead.d.ts.map

package/dist/indexer/ast/complexity/halstead.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"halstead.d.ts","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/halstead.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AAEtC,mCAAmC;AACnC,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/B;AAED,kCAAkC;AAClC,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd;AAiOD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,cAAc,CAiCvF;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,cAAc,GAAG,eAAe,CAsBhF;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,eAAe,CAG5F"}