@liendev/core 0.19.5

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

@@ -0,0 +1,290 @@
+/**
+ * Language-specific operator symbols.
+ * These are the actual text values we match against.
+ */
+const OPERATOR_SYMBOLS = {
+    typescript: new Set([
+        // Arithmetic
+        '+', '-', '*', '/', '%', '**',
+        // Comparison
+        '==', '===', '!=', '!==', '<', '>', '<=', '>=',
+        // Logical
+        '&&', '||', '!', '??',
+        // Assignment
+        '=', '+=', '-=', '*=', '/=', '%=', '**=', '&&=', '||=', '??=',
+        // Bitwise
+        '&', '|', '^', '~', '<<', '>>', '>>>',
+        '&=', '|=', '^=', '<<=', '>>=', '>>>=',
+        // Other
+        '?', ':', '.', '?.', '++', '--', '...', '=>',
+        // Brackets/parens (counted as operators)
+        '(', ')', '[', ']', '{', '}',
+    ]),
+    python: new Set([
+        // Arithmetic
+        '+', '-', '*', '/', '%', '**', '//',
+        // Comparison
+        '==', '!=', '<', '>', '<=', '>=',
+        // Logical (handled via keywords below)
+        // Assignment
+        '=', '+=', '-=', '*=', '/=', '%=', '**=', '//=',
+        '&=', '|=', '^=', '<<=', '>>=',
+        // Bitwise
+        '&', '|', '^', '~', '<<', '>>',
+        // Other
+        '.', ':', '->', '@',
+        '(', ')', '[', ']', '{', '}',
+    ]),
+    php: new Set([
+        // Arithmetic
+        '+', '-', '*', '/', '%', '**',
+        // Comparison
+        '==', '===', '!=', '!==', '<>', '<', '>', '<=', '>=', '<=>',
+        // Logical
+        '&&', '||', '!', 'and', 'or', 'xor',
+        // Assignment
+        '=', '+=', '-=', '*=', '/=', '%=', '**=', '.=',
+        '&=', '|=', '^=', '<<=', '>>=', '??=',
+        // Bitwise
+        '&', '|', '^', '~', '<<', '>>',
+        // String
+        '.',
+        // Other
+        '?', ':', '::', '->', '=>', '??', '@',
+        '(', ')', '[', ']', '{', '}',
+    ]),
+};
+/**
+ * Language-specific operator keywords.
+ * These are keywords that act as operators.
+ */
+const OPERATOR_KEYWORDS = {
+    typescript: new Set([
+        'if', 'else', 'for', 'while', 'do', 'switch', 'case', 'default',
+        'return', 'throw', 'try', 'catch', 'finally',
+        'new', 'delete', 'typeof', 'instanceof', 'in', 'of',
+        'await', 'yield', 'break', 'continue',
+        'const', 'let', 'var', 'function', 'class', 'extends', 'implements',
+        'import', 'export', 'from', 'as',
+    ]),
+    python: new Set([
+        'if', 'elif', 'else', 'for', 'while', 'match', 'case',
+        'return', 'raise', 'try', 'except', 'finally',
+        'and', 'or', 'not', 'is', 'in',
+        'await', 'yield', 'break', 'continue', 'pass',
+        'def', 'class', 'lambda', 'async',
+        'import', 'from', 'as', 'with',
+        'global', 'nonlocal', 'del', 'assert',
+    ]),
+    php: new Set([
+        'if', 'elseif', 'else', 'for', 'foreach', 'while', 'do', 'switch', 'case', 'default', 'match',
+        'return', 'throw', 'try', 'catch', 'finally',
+        'new', 'clone', 'instanceof',
+        'yield', 'break', 'continue',
+        'function', 'class', 'extends', 'implements', 'trait', 'interface',
+        'use', 'namespace', 'as',
+        'echo', 'print', 'include', 'require', 'include_once', 'require_once',
+        'global', 'static', 'const', 'public', 'private', 'protected', 'readonly',
+    ]),
+};
+/**
+ * AST node types that represent operators (language-agnostic).
+ * These are the tree-sitter node types, not the text content.
+ */
+const OPERATOR_NODE_TYPES = new Set([
+    // Expression operators
+    'binary_expression',
+    'unary_expression',
+    'update_expression',
+    'assignment_expression',
+    'augmented_assignment_expression',
+    'ternary_expression',
+    'conditional_expression',
+    // Call/access operators
+    'call_expression',
+    'method_call',
+    'member_expression',
+    'subscript_expression',
+    'attribute',
+    // Object/array literals ([] and {} are operators)
+    'array',
+    'object',
+    'dictionary',
+    'list',
+]);
+/**
+ * AST node types that represent operands.
+ */
+const OPERAND_NODE_TYPES = new Set([
+    // Identifiers
+    'identifier',
+    'property_identifier',
+    'shorthand_property_identifier',
+    'variable_name',
+    'name',
+    // Literals
+    'number',
+    'integer',
+    'float',
+    'string',
+    'string_fragment',
+    'template_string',
+    'true',
+    'false',
+    'null',
+    'undefined',
+    'none',
+    // Special
+    'this',
+    'self',
+    'super',
+]);
+/**
+ * Get the operator set for a language (with fallback to typescript)
+ */
+function getOperatorSymbols(language) {
+    return OPERATOR_SYMBOLS[language] || OPERATOR_SYMBOLS.typescript;
+}
+/**
+ * Get the keyword set for a language (with fallback to typescript)
+ */
+function getOperatorKeywords(language) {
+    return OPERATOR_KEYWORDS[language] || OPERATOR_KEYWORDS.typescript;
+}
+/**
+ * Check if a node represents an operator
+ */
+function isOperator(node, language) {
+    const nodeType = node.type;
+    const nodeText = node.text;
+    // Check if it's an operator node type
+    if (OPERATOR_NODE_TYPES.has(nodeType)) {
+        return true;
+    }
+    // Check if it's an operator symbol or keyword
+    const symbols = getOperatorSymbols(language);
+    const keywords = getOperatorKeywords(language);
+    return symbols.has(nodeText) || keywords.has(nodeText);
+}
+/**
+ * Check if a node represents an operand
+ */
+function isOperand(node) {
+    return OPERAND_NODE_TYPES.has(node.type);
+}
+/**
+ * Get the canonical key for an operator (for counting distinct operators)
+ */
+function getOperatorKey(node) {
+    // For complex expressions, use the operator type
+    if (OPERATOR_NODE_TYPES.has(node.type)) {
+        // For binary/unary expressions, extract the actual operator
+        const operator = node.childForFieldName('operator');
+        if (operator) {
+            return operator.text;
+        }
+        return node.type;
+    }
+    return node.text;
+}
+/**
+ * Get the canonical key for an operand (for counting distinct operands)
+ */
+function getOperandKey(node) {
+    return node.text;
+}
+/**
+ * Sum all values in a map
+ */
+function sumValues(map) {
+    let sum = 0;
+    for (const count of map.values()) {
+        sum += count;
+    }
+    return sum;
+}
+/**
+ * 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 function countHalstead(node, language) {
+    const operators = new Map();
+    const operands = new Map();
+    function traverse(n) {
+        // Check if this is an operator
+        if (isOperator(n, language)) {
+            const key = getOperatorKey(n);
+            operators.set(key, (operators.get(key) || 0) + 1);
+        }
+        // Check if this is an operand
+        if (isOperand(n)) {
+            const key = getOperandKey(n);
+            operands.set(key, (operands.get(key) || 0) + 1);
+        }
+        // Recurse into children
+        for (const child of n.children) {
+            traverse(child);
+        }
+    }
+    traverse(node);
+    return {
+        n1: operators.size,
+        n2: operands.size,
+        N1: sumValues(operators),
+        N2: sumValues(operands),
+        operators,
+        operands,
+    };
+}
+/**
+ * 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 function calculateHalsteadMetrics(counts) {
+    const { n1, n2, N1, N2 } = counts;
+    const vocabulary = n1 + n2;
+    const length = N1 + N2;
+    // Avoid log(0) and division by zero
+    const volume = vocabulary > 0 ? length * Math.log2(vocabulary) : 0;
+    const difficulty = n2 > 0 ? (n1 / 2) * (N2 / n2) : 0;
+    const effort = difficulty * volume;
+    const time = effort / 18; // Stroud number (18 mental discriminations per second)
+    const bugs = volume / 3000;
+    return {
+        vocabulary: Math.round(vocabulary),
+        length: Math.round(length),
+        volume: Math.round(volume * 100) / 100,
+        difficulty: Math.round(difficulty * 100) / 100,
+        effort: Math.round(effort),
+        time: Math.round(time),
+        bugs: Math.round(bugs * 1000) / 1000,
+    };
+}
+/**
+ * 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 function calculateHalstead(node, language) {
+    const counts = countHalstead(node, language);
+    return calculateHalsteadMetrics(counts);
+}
+//# sourceMappingURL=halstead.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"halstead.js","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/halstead.ts"],"names":[],"mappings":"AAuBA;;;GAGG;AACH,MAAM,gBAAgB,GAAgC;IACpD,UAAU,EAAE,IAAI,GAAG,CAAC;QAClB,aAAa;QACb,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;QAC7B,aAAa;QACb,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;QAC9C,UAAU;QACV,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI;QACrB,aAAa;QACb,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;QAC7D,UAAU;QACV,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;QACrC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;QACtC,QAAQ;QACR,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;QAC5C,yCAAyC;QACzC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;KAC7B,CAAC;IACF,MAAM,EAAE,IAAI,GAAG,CAAC;QACd,aAAa;QACb,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;QACnC,aAAa;QACb,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;QAChC,uCAAuC;QACvC,aAAa;QACb,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;QAC/C,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;QAC9B,UAAU;QACV,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;QAC9B,QAAQ;QACR,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG;QACnB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;KAC7B,CAAC;IACF,GAAG,EAAE,IAAI,GAAG,CAAC;QACX,aAAa;QACb,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI;QAC7B,aAAa;QACb,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;QAC3D,UAAU;QACV,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK;QACnC,aAAa;QACb,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;QAC9C,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;QACrC,UAAU;QACV,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI;QAC9B,SAAS;QACT,GAAG;QACH,QAAQ;QACR,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG;QACrC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;KAC7B,CAAC;CACH,CAAC;AAEF;;;GAGG;AACH,MAAM,iBAAiB,GAAgC;IACrD,UAAU,EAAE,IAAI,GAAG,CAAC;QAClB,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS;QAC/D,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS;QAC5C,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI;QACnD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU;QACrC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY;QACnE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI;KACjC,CAAC;IACF,MAAM,EAAE,IAAI,GAAG,CAAC;QACd,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM;QACrD,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS;QAC7C,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI;QAC9B,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM;QAC7C,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO;QACjC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;QAC9B,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ;KACtC,CAAC;IACF,GAAG,EAAE,IAAI,GAAG,CAAC;QACX,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO;QAC7F,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS;QAC5C,KAAK,EAAE,OAAO,EAAE,YAAY;QAC5B,OAAO,EAAE,OAAO,EAAE,UAAU;QAC5B,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,WAAW;QAClE,KAAK,EAAE,WAAW,EAAE,IAAI;QACxB,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,EAAE,cAAc;QACrE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU;KAC1E,CAAC;CACH,CAAC;AAEF;;;GAGG;AACH,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,uBAAuB;IACvB,mBAAmB;IACnB,kBAAkB;IAClB,mBAAmB;IACnB,uBAAuB;IACvB,iCAAiC;IACjC,oBAAoB;IACpB,wBAAwB;IAExB,wBAAwB;IACxB,iBAAiB;IACjB,aAAa;IACb,mBAAmB;IACnB,sBAAsB;IACtB,WAAW;IAEX,kDAAkD;IAClD,OAAO;IACP,QAAQ;IACR,YAAY;IACZ,MAAM;CACP,CAAC,CAAC;AAEH;;GAEG;AACH,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC;IACjC,cAAc;IACd,YAAY;IACZ,qBAAqB;IACrB,+BAA+B;IAC/B,eAAe;IACf,MAAM;IAEN,WAAW;IACX,QAAQ;IACR,SAAS;IACT,OAAO;IACP,QAAQ;IACR,iBAAiB;IACjB,iBAAiB;IACjB,MAAM;IACN,OAAO;IACP,MAAM;IACN,WAAW;IACX,MAAM;IAEN,UAAU;IACV,MAAM;IACN,MAAM;IACN,OAAO;CACR,CAAC,CAAC;AAEH;;GAEG;AACH,SAAS,kBAAkB,CAAC,QAAgB;IAC1C,OAAO,gBAAgB,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,UAAU,CAAC;AACnE,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,QAAgB;IAC3C,OAAO,iBAAiB,CAAC,QAAQ,CAAC,IAAI,iBAAiB,CAAC,UAAU,CAAC;AACrE,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,IAAuB,EAAE,QAAgB;IAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;IAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;IAE3B,sCAAsC;IACtC,IAAI,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8CAA8C;IAC9C,MAAM,OAAO,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;IAE/C,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,SAAS,SAAS,CAAC,IAAuB;IACxC,OAAO,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,IAAuB;IAC7C,iDAAiD;IACjD,IAAI,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,QAAQ,CAAC,IAAI,CAAC;QACvB,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAuB;IAC5C,OAAO,IAAI,CAAC,IAAI,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,SAAS,CAAC,GAAwB;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;QACjC,GAAG,IAAI,KAAK,CAAC;IACf,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,IAAuB,EAAE,QAAgB;IACrE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,SAAS,QAAQ,CAAC,CAAoB;QACpC,+BAA+B;QAC/B,IAAI,UAAU,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC9B,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QAED,8BAA8B;QAC9B,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,wBAAwB;QACxB,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC/B,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,CAAC;IAEf,OAAO;QACL,EAAE,EAAE,SAAS,CAAC,IAAI;QAClB,EAAE,EAAE,QAAQ,CAAC,IAAI;QACjB,EAAE,EAAE,SAAS,CAAC,SAAS,CAAC;QACxB,EAAE,EAAE,SAAS,CAAC,QAAQ,CAAC;QACvB,SAAS;QACT,QAAQ;KACT,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,wBAAwB,CAAC,MAAsB;IAC7D,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,MAAM,CAAC;IAElC,MAAM,UAAU,GAAG,EAAE,GAAG,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC;IAEvB,oCAAoC;IACpC,MAAM,MAAM,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,UAAU,GAAG,MAAM,CAAC;IACnC,MAAM,IAAI,GAAG,MAAM,GAAG,EAAE,CAAC,CAAE,uDAAuD;IAClF,MAAM,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;IAE3B,OAAO;QACL,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;QAClC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1B,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG;QACtC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,GAAG;QAC9C,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1B,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QACtB,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI;KACrC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAuB,EAAE,QAAgB;IACzE,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC7C,OAAO,wBAAwB,CAAC,MAAM,CAAC,CAAC;AAC1C,CAAC"}

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

@@ -0,0 +1,13 @@
+/**
+ * Complexity metrics module
+ *
+ * This module provides various code complexity metrics:
+ * - Cyclomatic complexity: Counts decision points (branches) in code
+ * - Cognitive complexity: Measures mental effort to understand code (SonarSource spec)
+ * - Halstead metrics: Measures complexity based on operators/operands
+ */
+export { calculateComplexity } from './cyclomatic.js';
+export { calculateCognitiveComplexity } from './cognitive.js';
+export { countHalstead, calculateHalsteadMetrics, calculateHalstead, } from './halstead.js';
+export type { HalsteadCounts, HalsteadMetrics } from './halstead.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AACtD,OAAO,EAAE,4BAA4B,EAAE,MAAM,gBAAgB,CAAC;AAC9D,OAAO,EACL,aAAa,EACb,wBAAwB,EACxB,iBAAiB,GAClB,MAAM,eAAe,CAAC;AACvB,YAAY,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC"}

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

@@ -0,0 +1,12 @@
+/**
+ * Complexity metrics module
+ *
+ * This module provides various code complexity metrics:
+ * - Cyclomatic complexity: Counts decision points (branches) in code
+ * - Cognitive complexity: Measures mental effort to understand code (SonarSource spec)
+ * - Halstead metrics: Measures complexity based on operators/operands
+ */
+export { calculateComplexity } from './cyclomatic.js';
+export { calculateCognitiveComplexity } from './cognitive.js';
+export { countHalstead, calculateHalsteadMetrics, calculateHalstead, } from './halstead.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/indexer/ast/complexity/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AACtD,OAAO,EAAE,4BAA4B,EAAE,MAAM,gBAAgB,CAAC;AAC9D,OAAO,EACL,aAAa,EACb,wBAAwB,EACxB,iBAAiB,GAClB,MAAM,eAAe,CAAC"}

package/dist/indexer/ast/parser.d.ts

@@ -0,0 +1,27 @@
+import type { ASTParseResult, SupportedLanguage } from './types.js';
+/**
+ * Detect language from file extension
+ * Uses path.extname() to handle edge cases like multiple dots in filenames
+ */
+export declare function detectLanguage(filePath: string): SupportedLanguage | null;
+/**
+ * Check if a file is supported for AST parsing
+ */
+export declare function isASTSupported(filePath: string): boolean;
+/**
+ * Parse source code into an AST using Tree-sitter
+ *
+ * **Known Limitation:** Tree-sitter may throw "Invalid argument" errors on very large files
+ * (1000+ lines). This is a limitation of Tree-sitter's internal buffer handling. When this
+ * occurs, callers should fall back to line-based chunking (handled automatically by chunker.ts).
+ *
+ * @param content - Source code to parse
+ * @param language - Programming language
+ * @returns Parse result with tree or error
+ */
+export declare function parseAST(content: string, language: SupportedLanguage): ASTParseResult;
+/**
+ * Clear parser cache (useful for testing)
+ */
+export declare function clearParserCache(): void;
+//# sourceMappingURL=parser.d.ts.map

package/dist/indexer/ast/parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.d.ts","sourceRoot":"","sources":["../../../src/indexer/ast/parser.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AA0CpE;;;GAGG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI,CAqBzE;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAExD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,iBAAiB,GAAG,cAAc,CAoBrF;AAED;;GAEG;AACH,wBAAgB,gBAAgB,IAAI,IAAI,CAEvC"}

package/dist/indexer/ast/parser.js

@@ -0,0 +1,103 @@
+import Parser from 'tree-sitter';
+import TypeScript from 'tree-sitter-typescript';
+import JavaScript from 'tree-sitter-javascript';
+import PHPParser from 'tree-sitter-php';
+import Python from 'tree-sitter-python';
+import { extname } from 'path';
+/**
+ * Cache for parser instances to avoid recreating them
+ */
+const parserCache = new Map();
+/**
+ * Language configuration mapping
+ */
+const languageConfig = {
+    typescript: TypeScript.typescript,
+    javascript: JavaScript,
+    php: PHPParser.php, // Note: tree-sitter-php exports both 'php' (mixed HTML/PHP) and 'php_only'
+    python: Python,
+};
+/**
+ * Get or create a cached parser instance for a language
+ */
+function getParser(language) {
+    if (!parserCache.has(language)) {
+        const parser = new Parser();
+        const grammar = languageConfig[language];
+        if (!grammar) {
+            throw new Error(`No grammar available for language: ${language}`);
+        }
+        parser.setLanguage(grammar);
+        parserCache.set(language, parser);
+    }
+    return parserCache.get(language);
+}
+/**
+ * Detect language from file extension
+ * Uses path.extname() to handle edge cases like multiple dots in filenames
+ */
+export function detectLanguage(filePath) {
+    // extname returns extension with leading dot (e.g., '.ts')
+    // Remove the dot and convert to lowercase
+    const ext = extname(filePath).slice(1).toLowerCase();
+    switch (ext) {
+        case 'ts':
+        case 'tsx':
+            return 'typescript';
+        case 'js':
+        case 'jsx':
+        case 'mjs':
+        case 'cjs':
+            return 'javascript';
+        case 'php':
+            return 'php';
+        case 'py':
+            return 'python';
+        default:
+            return null;
+    }
+}
+/**
+ * Check if a file is supported for AST parsing
+ */
+export function isASTSupported(filePath) {
+    return detectLanguage(filePath) !== null;
+}
+/**
+ * Parse source code into an AST using Tree-sitter
+ *
+ * **Known Limitation:** Tree-sitter may throw "Invalid argument" errors on very large files
+ * (1000+ lines). This is a limitation of Tree-sitter's internal buffer handling. When this
+ * occurs, callers should fall back to line-based chunking (handled automatically by chunker.ts).
+ *
+ * @param content - Source code to parse
+ * @param language - Programming language
+ * @returns Parse result with tree or error
+ */
+export function parseAST(content, language) {
+    try {
+        const parser = getParser(language);
+        const tree = parser.parse(content);
+        // Check for parse errors (hasError is a property, not a method)
+        if (tree.rootNode.hasError) {
+            return {
+                tree,
+                error: 'Parse completed with errors',
+            };
+        }
+        return { tree };
+    }
+    catch (error) {
+        return {
+            tree: null,
+            error: error instanceof Error ? error.message : 'Unknown parse error',
+        };
+    }
+}
+/**
+ * Clear parser cache (useful for testing)
+ */
+export function clearParserCache() {
+    parserCache.clear();
+}
+//# sourceMappingURL=parser.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../../src/indexer/ast/parser.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,UAAU,MAAM,wBAAwB,CAAC;AAChD,OAAO,UAAU,MAAM,wBAAwB,CAAC;AAChD,OAAO,SAAS,MAAM,iBAAiB,CAAC;AACxC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAG/B;;GAEG;AACH,MAAM,WAAW,GAAG,IAAI,GAAG,EAA6B,CAAC;AAQzD;;GAEG;AACH,MAAM,cAAc,GAAkD;IACpE,UAAU,EAAE,UAAU,CAAC,UAAU;IACjC,UAAU,EAAE,UAAU;IACtB,GAAG,EAAE,SAAS,CAAC,GAAG,EAAE,2EAA2E;IAC/F,MAAM,EAAE,MAAM;CACf,CAAC;AAEF;;GAEG;AACH,SAAS,SAAS,CAAC,QAA2B;IAC5C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;QAEzC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,sCAAsC,QAAQ,EAAE,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC5B,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;AACpC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB;IAC7C,2DAA2D;IAC3D,0CAA0C;IAC1C,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IAErD,QAAQ,GAAG,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC;QACV,KAAK,KAAK;YACR,OAAO,YAAY,CAAC;QACtB,KAAK,IAAI,CAAC;QACV,KAAK,KAAK,CAAC;QACX,KAAK,KAAK,CAAC;QACX,KAAK,KAAK;YACR,OAAO,YAAY,CAAC;QACtB,KAAK,KAAK;YACR,OAAO,KAAK,CAAC;QACf,KAAK,IAAI;YACP,OAAO,QAAQ,CAAC;QAClB;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB;IAC7C,OAAO,cAAc,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,QAAQ,CAAC,OAAe,EAAE,QAA2B;IACnE,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAEnC,gEAAgE;QAChE,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAC3B,OAAO;gBACL,IAAI;gBACJ,KAAK,EAAE,6BAA6B;aACrC,CAAC;QACJ,CAAC;QAED,OAAO,EAAE,IAAI,EAAE,CAAC;IAClB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,IAAI,EAAE,IAAI;YACV,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB;SACtE,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB;IAC9B,WAAW,CAAC,KAAK,EAAE,CAAC;AACtB,CAAC"}

package/dist/indexer/ast/symbols.d.ts

@@ -0,0 +1,17 @@
+import type Parser from 'tree-sitter';
+import type { SymbolInfo } from './types.js';
+/**
+ * Extract symbol information from an AST node using specialized extractors
+ *
+ * @param node - AST node to extract info from
+ * @param content - Source code content
+ * @param parentClass - Parent class name if this is a method
+ * @param language - Programming language (for disambiguating shared node types)
+ * @returns Symbol information or null
+ */
+export declare function extractSymbolInfo(node: Parser.SyntaxNode, content: string, parentClass?: string, language?: string): SymbolInfo | null;
+/**
+ * Extract import statements from a file
+ */
+export declare function extractImports(rootNode: Parser.SyntaxNode): string[];
+//# sourceMappingURL=symbols.d.ts.map

package/dist/indexer/ast/symbols.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"symbols.d.ts","sourceRoot":"","sources":["../../../src/indexer/ast/symbols.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AACtC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AA2M7C;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,MAAM,CAAC,UAAU,EACvB,OAAO,EAAE,MAAM,EACf,WAAW,CAAC,EAAE,MAAM,EACpB,QAAQ,CAAC,EAAE,MAAM,GAChB,UAAU,GAAG,IAAI,CASnB;AAkED;;GAEG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,UAAU,GAAG,MAAM,EAAE,CAoCpE"}