@side-quest/kit 0.1.0 → 0.2.0

package/dist/lib/ast/searcher.d.ts

@@ -0,0 +1,89 @@
+/**
+ * AST Searcher
+ *
+ * Searches files using tree-sitter AST patterns.
+ * Ported from Kit's ASTSearcher class in ast_search.py.
+ *
+ * Performance optimizations:
+ * - Uses fs/promises for non-blocking I/O
+ * - Parses files in parallel chunks to maximize throughput
+ */
+import { type ASTSearchOptions, type ASTSearchResult } from './types.js';
+/**
+ * ASTSearcher performs AST-based code search using tree-sitter.
+ *
+ * It traverses the file system, parses supported files, and matches
+ * AST nodes against the given pattern.
+ */
+export declare class ASTSearcher {
+    private readonly repoPath;
+    /**
+     * Create a new AST searcher.
+     *
+     * @param repoPath - Repository path to search (defaults to KIT_DEFAULT_PATH or cwd)
+     */
+    constructor(repoPath?: string);
+    /**
+     * Search for AST patterns in the repository.
+     *
+     * Files are parsed in parallel chunks for better performance.
+     *
+     * @param options - Search options
+     * @returns Search results with matching AST nodes
+     */
+    searchPattern(options: ASTSearchOptions): Promise<ASTSearchResult>;
+    /**
+     * Get all files matching the pattern.
+     *
+     * @param filePattern - Optional glob pattern to filter files
+     * @returns Array of absolute file paths
+     */
+    private getMatchingFiles;
+    /**
+     * Recursively walk directory and collect matching files.
+     * Uses async fs methods to avoid blocking the event loop.
+     */
+    private walkDirectory;
+    /**
+     * Check if a file matches the given pattern.
+     * Uses Bun.Glob for proper glob pattern matching.
+     */
+    private matchesFilePattern;
+    /**
+     * Search a single file for pattern matches.
+     *
+     * @param filePath - Absolute path to the file
+     * @param pattern - AST pattern to match
+     * @returns Array of matches found in the file
+     */
+    private searchFile;
+    /**
+     * Recursively search AST nodes for pattern matches.
+     */
+    private searchNode;
+    /**
+     * Create an ASTMatch from a matching node.
+     */
+    private createMatch;
+    /**
+     * Get context information about a matched node.
+     */
+    private getContext;
+    /**
+     * Get the name of a named node (function, class, etc.).
+     */
+    private getNodeName;
+    /**
+     * Check if a node type is a function.
+     */
+    private isFunctionNode;
+    /**
+     * Check if a node type is a class.
+     */
+    private isClassNode;
+    /**
+     * Truncate text to maximum length.
+     */
+    private truncateText;
+}
+//# sourceMappingURL=searcher.d.ts.map

package/dist/lib/ast/searcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"searcher.d.ts","sourceRoot":"","sources":["../../../src/lib/ast/searcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAUH,OAAO,EAGN,KAAK,gBAAgB,EACrB,KAAK,eAAe,EAEpB,MAAM,YAAY,CAAA;AA0CnB;;;;;GAKG;AACH,qBAAa,WAAW;IACvB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IAEjC;;;;OAIG;gBACS,QAAQ,CAAC,EAAE,MAAM;IAI7B;;;;;;;OAOG;IACG,aAAa,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC;IA8CxE;;;;;OAKG;YACW,gBAAgB;IAM9B;;;OAGG;YACW,aAAa;IAiE3B;;;OAGG;IACH,OAAO,CAAC,kBAAkB;IAQ1B;;;;;;OAMG;YACW,UAAU;IAmBxB;;OAEG;IACH,OAAO,CAAC,UAAU;IAsBlB;;OAEG;IACH,OAAO,CAAC,WAAW;IAenB;;OAEG;IACH,OAAO,CAAC,UAAU;IAoBlB;;OAEG;IACH,OAAO,CAAC,WAAW;IAqBnB;;OAEG;IACH,OAAO,CAAC,cAAc;IAWtB;;OAEG;IACH,OAAO,CAAC,WAAW;IAQnB;;OAEG;IACH,OAAO,CAAC,YAAY;CAIpB"}

package/dist/lib/ast/searcher.js

@@ -0,0 +1,316 @@
+/**
+ * AST Searcher
+ *
+ * Searches files using tree-sitter AST patterns.
+ * Ported from Kit's ASTSearcher class in ast_search.py.
+ *
+ * Performance optimizations:
+ * - Uses fs/promises for non-blocking I/O
+ * - Parses files in parallel chunks to maximize throughput
+ */
+import { readdir, readFile, stat } from 'node:fs/promises';
+import { join, relative } from 'node:path';
+import { processInParallelChunks } from '@side-quest/core/concurrency';
+import { getAstLogger } from '../logger.js';
+import { getDefaultKitPath } from '../types.js';
+import { detectLanguage, getParser, isSupported } from './languages.js';
+import { ASTPattern } from './pattern.js';
+import { SearchMode, } from './types.js';
+/**
+ * Maximum file size to parse (5MB).
+ * Larger files are skipped to prevent memory issues.
+ */
+const MAX_FILE_SIZE = 5 * 1024 * 1024;
+/**
+ * Maximum text length to include in match results.
+ */
+const MAX_TEXT_LENGTH = 500;
+/**
+ * Number of files to parse in parallel.
+ * Balances throughput vs memory usage.
+ */
+const PARALLEL_CHUNK_SIZE = 10;
+/**
+ * Directories to skip during traversal.
+ */
+const SKIP_DIRS = new Set([
+    'node_modules',
+    '.git',
+    '.svn',
+    '.hg',
+    '__pycache__',
+    '.pytest_cache',
+    '.mypy_cache',
+    'dist',
+    'build',
+    '.next',
+    '.nuxt',
+    'coverage',
+    '.coverage',
+    'venv',
+    '.venv',
+    'env',
+    '.env',
+]);
+/**
+ * ASTSearcher performs AST-based code search using tree-sitter.
+ *
+ * It traverses the file system, parses supported files, and matches
+ * AST nodes against the given pattern.
+ */
+export class ASTSearcher {
+    repoPath;
+    /**
+     * Create a new AST searcher.
+     *
+     * @param repoPath - Repository path to search (defaults to KIT_DEFAULT_PATH or cwd)
+     */
+    constructor(repoPath) {
+        this.repoPath = repoPath ?? getDefaultKitPath();
+    }
+    /**
+     * Search for AST patterns in the repository.
+     *
+     * Files are parsed in parallel chunks for better performance.
+     *
+     * @param options - Search options
+     * @returns Search results with matching AST nodes
+     */
+    async searchPattern(options) {
+        const { pattern, mode = SearchMode.SIMPLE, filePattern, maxResults = 100, } = options;
+        const astPattern = new ASTPattern(pattern, mode);
+        // Get all files to search (async directory traversal)
+        const files = await this.getMatchingFiles(filePattern);
+        // Debug logging for MCP issues
+        const logger = getAstLogger();
+        logger.debug('File search results', {
+            fileCount: files.length,
+            repoPath: this.repoPath,
+            filePattern,
+            firstFiles: files.slice(0, 3),
+        });
+        // Process files in parallel chunks using core utility
+        const matches = await processInParallelChunks({
+            items: files,
+            chunkSize: PARALLEL_CHUNK_SIZE,
+            maxResults,
+            processor: (filePath) => this.searchFile(filePath, astPattern),
+            onError: (filePath, error) => {
+                logger.error('Error parsing file', {
+                    filePath,
+                    error: error.message,
+                });
+                return [];
+            },
+        });
+        return {
+            count: matches.length,
+            matches,
+            pattern,
+            mode,
+            path: this.repoPath,
+        };
+    }
+    /**
+     * Get all files matching the pattern.
+     *
+     * @param filePattern - Optional glob pattern to filter files
+     * @returns Array of absolute file paths
+     */
+    async getMatchingFiles(filePattern) {
+        const files = [];
+        await this.walkDirectory(this.repoPath, files, filePattern);
+        return files;
+    }
+    /**
+     * Recursively walk directory and collect matching files.
+     * Uses async fs methods to avoid blocking the event loop.
+     */
+    async walkDirectory(dir, files, filePattern) {
+        const logger = getAstLogger();
+        let entries;
+        try {
+            entries = await readdir(dir);
+        }
+        catch (error) {
+            // Directory doesn't exist or can't be read
+            logger.warn('Failed to read directory', {
+                dir,
+                error: error instanceof Error ? error.message : String(error),
+            });
+            return;
+        }
+        // Process entries in parallel for faster traversal
+        await Promise.all(entries.map(async (entry) => {
+            // Skip hidden and ignored directories
+            if (SKIP_DIRS.has(entry) || entry.startsWith('.'))
+                return;
+            const fullPath = join(dir, entry);
+            let stats;
+            try {
+                stats = await stat(fullPath);
+            }
+            catch (error) {
+                logger.debug('Failed to stat entry', {
+                    path: fullPath,
+                    error: error instanceof Error ? error.message : String(error),
+                });
+                return;
+            }
+            if (stats.isDirectory()) {
+                await this.walkDirectory(fullPath, files, filePattern);
+            }
+            else if (stats.isFile()) {
+                // Skip large files
+                if (stats.size > MAX_FILE_SIZE) {
+                    logger.warn('Skipping large file', {
+                        path: fullPath,
+                        size: stats.size,
+                        maxSize: MAX_FILE_SIZE,
+                    });
+                    return;
+                }
+                // Check if file is supported for parsing
+                if (!isSupported(fullPath))
+                    return;
+                // Apply file pattern filter if provided
+                if (filePattern && !this.matchesFilePattern(fullPath, filePattern)) {
+                    return;
+                }
+                files.push(fullPath);
+            }
+        }));
+    }
+    /**
+     * Check if a file matches the given pattern.
+     * Uses Bun.Glob for proper glob pattern matching.
+     */
+    matchesFilePattern(filePath, pattern) {
+        const relativePath = relative(this.repoPath, filePath);
+        // Use Bun.Glob for proper glob matching
+        const glob = new Bun.Glob(pattern);
+        return glob.match(relativePath);
+    }
+    /**
+     * Search a single file for pattern matches.
+     *
+     * @param filePath - Absolute path to the file
+     * @param pattern - AST pattern to match
+     * @returns Array of matches found in the file
+     */
+    async searchFile(filePath, pattern) {
+        const language = detectLanguage(filePath);
+        if (!language)
+            return [];
+        const parser = await getParser(language);
+        const source = await readFile(filePath, 'utf8');
+        const tree = parser.parse(source);
+        // Handle parse failure
+        if (!tree)
+            return [];
+        const matches = [];
+        this.searchNode(tree.rootNode, source, pattern, filePath, matches);
+        return matches;
+    }
+    /**
+     * Recursively search AST nodes for pattern matches.
+     */
+    searchNode(node, source, pattern, filePath, matches) {
+        // Check if this node matches the pattern
+        if (pattern.matches(node, source)) {
+            const match = this.createMatch(node, source, filePath);
+            matches.push(match);
+        }
+        // Recurse into children
+        for (let i = 0; i < node.childCount; i++) {
+            const child = node.child(i);
+            if (child) {
+                this.searchNode(child, source, pattern, filePath, matches);
+            }
+        }
+    }
+    /**
+     * Create an ASTMatch from a matching node.
+     */
+    createMatch(node, source, filePath) {
+        return {
+            file: relative(this.repoPath, filePath),
+            line: node.startPosition.row + 1,
+            column: node.startPosition.column,
+            nodeType: node.type,
+            text: this.truncateText(source.substring(node.startIndex, node.endIndex)),
+            context: this.getContext(node, source),
+        };
+    }
+    /**
+     * Get context information about a matched node.
+     */
+    getContext(node, source) {
+        const context = { nodeType: node.type };
+        // Walk up the tree to find parent function or class
+        let parent = node.parent;
+        while (parent) {
+            if (this.isFunctionNode(parent.type)) {
+                context.parentFunction = this.getNodeName(parent, source);
+                break;
+            }
+            if (this.isClassNode(parent.type)) {
+                context.parentClass = this.getNodeName(parent, source);
+                break;
+            }
+            parent = parent.parent;
+        }
+        return context;
+    }
+    /**
+     * Get the name of a named node (function, class, etc.).
+     */
+    getNodeName(node, source) {
+        // Try named children first
+        const nameChild = node.childForFieldName('name');
+        if (nameChild) {
+            return source.substring(nameChild.startIndex, nameChild.endIndex);
+        }
+        // Look for identifier children
+        for (let i = 0; i < node.childCount; i++) {
+            const child = node.child(i);
+            if (child &&
+                (child.type === 'identifier' || child.type === 'type_identifier')) {
+                return source.substring(child.startIndex, child.endIndex);
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Check if a node type is a function.
+     */
+    isFunctionNode(type) {
+        return [
+            'function_declaration',
+            'function_definition',
+            'function_expression',
+            'arrow_function',
+            'method_definition',
+            'generator_function_declaration',
+        ].includes(type);
+    }
+    /**
+     * Check if a node type is a class.
+     */
+    isClassNode(type) {
+        return [
+            'class_declaration',
+            'class_definition',
+            'class_expression',
+        ].includes(type);
+    }
+    /**
+     * Truncate text to maximum length.
+     */
+    truncateText(text) {
+        if (text.length <= MAX_TEXT_LENGTH)
+            return text;
+        return `${text.slice(0, MAX_TEXT_LENGTH - 3)}...`;
+    }
+}
+//# sourceMappingURL=searcher.js.map

package/dist/lib/ast/searcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"searcher.js","sourceRoot":"","sources":["../../../src/lib/ast/searcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAA;AAC1D,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC1C,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAA;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAA;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAA;AAE/C,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,EAKN,UAAU,GACV,MAAM,YAAY,CAAA;AAEnB;;;GAGG;AACH,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAA;AAErC;;GAEG;AACH,MAAM,eAAe,GAAG,GAAG,CAAA;AAE3B;;;GAGG;AACH,MAAM,mBAAmB,GAAG,EAAE,CAAA;AAE9B;;GAEG;AACH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACzB,cAAc;IACd,MAAM;IACN,MAAM;IACN,KAAK;IACL,aAAa;IACb,eAAe;IACf,aAAa;IACb,MAAM;IACN,OAAO;IACP,OAAO;IACP,OAAO;IACP,UAAU;IACV,WAAW;IACX,MAAM;IACN,OAAO;IACP,KAAK;IACL,MAAM;CACN,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IACN,QAAQ,CAAQ;IAEjC;;;;OAIG;IACH,YAAY,QAAiB;QAC5B,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,iBAAiB,EAAE,CAAA;IAChD,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,aAAa,CAAC,OAAyB;QAC5C,MAAM,EACL,OAAO,EACP,IAAI,GAAG,UAAU,CAAC,MAAM,EACxB,WAAW,EACX,UAAU,GAAG,GAAG,GAChB,GAAG,OAAO,CAAA;QAEX,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;QAEhD,sDAAsD;QACtD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAA;QAEtD,+BAA+B;QAC/B,MAAM,MAAM,GAAG,YAAY,EAAE,CAAA;QAC7B,MAAM,CAAC,KAAK,CAAC,qBAAqB,EAAE;YACnC,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,WAAW;YACX,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SAC7B,CAAC,CAAA;QAEF,sDAAsD;QACtD,MAAM,OAAO,GAAG,MAAM,uBAAuB,CAAC;YAC7C,KAAK,EAAE,KAAK;YACZ,SAAS,EAAE,mBAAmB;YAC9B,UAAU;YACV,SAAS,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC;YAC9D,OAAO,EAAE,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE;gBAC5B,MAAM,CAAC,KAAK,CAAC,oBAAoB,EAAE;oBAClC,QAAQ;oBACR,KAAK,EAAE,KAAK,CAAC,OAAO;iBACpB,CAAC,CAAA;gBACF,OAAO,EAAE,CAAA;YACV,CAAC;SACD,CAAC,CAAA;QAEF,OAAO;YACN,KAAK,EAAE,OAAO,CAAC,MAAM;YACrB,OAAO;YACP,OAAO;YACP,IAAI;YACJ,IAAI,EAAE,IAAI,CAAC,QAAQ;SACnB,CAAA;IACF,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,gBAAgB,CAAC,WAAoB;QAClD,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,WAAW,CAAC,CAAA;QAC3D,OAAO,KAAK,CAAA;IACb,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,aAAa,CAC1B,GAAW,EACX,KAAe,EACf,WAAoB;QAEpB,MAAM,MAAM,GAAG,YAAY,EAAE,CAAA;QAE7B,IAAI,OAAiB,CAAA;QACrB,IAAI,CAAC;YACJ,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAA;QAC7B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,2CAA2C;YAC3C,MAAM,CAAC,IAAI,CAAC,0BAA0B,EAAE;gBACvC,GAAG;gBACH,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;aAC7D,CAAC,CAAA;YACF,OAAM;QACP,CAAC;QAED,mDAAmD;QACnD,MAAM,OAAO,CAAC,GAAG,CAChB,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAC3B,sCAAsC;YACtC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,OAAM;YAEzD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;YAEjC,IAAI,KAAuC,CAAA;YAC3C,IAAI,CAAC;gBACJ,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC7B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBAChB,MAAM,CAAC,KAAK,CAAC,sBAAsB,EAAE;oBACpC,IAAI,EAAE,QAAQ;oBACd,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;iBAC7D,CAAC,CAAA;gBACF,OAAM;YACP,CAAC;YAED,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;gBACzB,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,KAAK,EAAE,WAAW,CAAC,CAAA;YACvD,CAAC;iBAAM,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3B,mBAAmB;gBACnB,IAAI,KAAK,CAAC,IAAI,GAAG,aAAa,EAAE,CAAC;oBAChC,MAAM,CAAC,IAAI,CAAC,qBAAqB,EAAE;wBAClC,IAAI,EAAE,QAAQ;wBACd,IAAI,EAAE,KAAK,CAAC,IAAI;wBAChB,OAAO,EAAE,aAAa;qBACtB,CAAC,CAAA;oBACF,OAAM;gBACP,CAAC;gBAED,yCAAyC;gBACzC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;oBAAE,OAAM;gBAElC,wCAAwC;gBACxC,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,WAAW,CAAC,EAAE,CAAC;oBACpE,OAAM;gBACP,CAAC;gBAED,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACrB,CAAC;QACF,CAAC,CAAC,CACF,CAAA;IACF,CAAC;IAED;;;OAGG;IACK,kBAAkB,CAAC,QAAgB,EAAE,OAAe;QAC3D,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;QAEtD,wCAAwC;QACxC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAClC,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAA;IAChC,CAAC;IAED;;;;;;OAMG;IACK,KAAK,CAAC,UAAU,CACvB,QAAgB,EAChB,OAAmB;QAEnB,MAAM,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAA;QACzC,IAAI,CAAC,QAAQ;YAAE,OAAO,EAAE,CAAA;QAExB,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,QAAQ,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;QAC/C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QAEjC,uBAAuB;QACvB,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAA;QAEpB,MAAM,OAAO,GAAe,EAAE,CAAA;QAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;QAClE,OAAO,OAAO,CAAA;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CACjB,IAAgB,EAChB,MAAc,EACd,OAAmB,EACnB,QAAgB,EAChB,OAAmB;QAEnB,yCAAyC;QACzC,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAA;YACtD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACpB,CAAC;QAED,wBAAwB;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YAC3B,IAAI,KAAK,EAAE,CAAC;gBACX,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;YAC3D,CAAC;QACF,CAAC;IACF,CAAC;IAED;;OAEG;IACK,WAAW,CAClB,IAAgB,EAChB,MAAc,EACd,QAAgB;QAEhB,OAAO;YACN,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC;YACvC,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;YAChC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM;YACjC,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC;SACtC,CAAA;IACF,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAgB,EAAE,MAAc;QAClD,MAAM,OAAO,GAAoB,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,CAAA;QAExD,oDAAoD;QACpD,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACxB,OAAO,MAAM,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtC,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;gBACzD,MAAK;YACN,CAAC;YACD,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;gBACtD,MAAK;YACN,CAAC;YACD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAA;QACvB,CAAC;QAED,OAAO,OAAO,CAAA;IACf,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAgB,EAAE,MAAc;QACnD,2BAA2B;QAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAA;QAChD,IAAI,SAAS,EAAE,CAAC;YACf,OAAO,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAA;QAClE,CAAC;QAED,+BAA+B;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YAC3B,IACC,KAAK;gBACL,CAAC,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,IAAI,KAAK,iBAAiB,CAAC,EAChE,CAAC;gBACF,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAA;YAC1D,CAAC;QACF,CAAC;QAED,OAAO,SAAS,CAAA;IACjB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAAY;QAClC,OAAO;YACN,sBAAsB;YACtB,qBAAqB;YACrB,qBAAqB;YACrB,gBAAgB;YAChB,mBAAmB;YACnB,gCAAgC;SAChC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACjB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAY;QAC/B,OAAO;YACN,mBAAmB;YACnB,kBAAkB;YAClB,kBAAkB;SAClB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACjB,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAY;QAChC,IAAI,IAAI,CAAC,MAAM,IAAI,eAAe;YAAE,OAAO,IAAI,CAAA;QAC/C,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,GAAG,CAAC,CAAC,KAAK,CAAA;IAClD,CAAC;CACD"}

package/dist/lib/ast/types.d.ts

@@ -0,0 +1,93 @@
+/**
+ * AST Search Types
+ *
+ * Type definitions for AST-based code search using tree-sitter.
+ */
+/**
+ * Search mode for AST patterns.
+ *
+ * - `simple`: Natural language patterns like "async function", "class"
+ * - `pattern`: JSON object criteria like {"type": "function_declaration"}
+ */
+export declare enum SearchMode {
+    /** Natural language patterns: "async function", "class", "try" */
+    SIMPLE = "simple",
+    /** JSON criteria: {"type": "function_declaration", "async": true} */
+    PATTERN = "pattern"
+}
+/**
+ * A single AST match found during search.
+ */
+export interface ASTMatch {
+    /** File path relative to repository root */
+    file: string;
+    /** Line number (1-indexed) */
+    line: number;
+    /** Column number (0-indexed) */
+    column: number;
+    /** Tree-sitter node type (e.g., "function_declaration") */
+    nodeType: string;
+    /** Matched source text (truncated to 500 chars) */
+    text: string;
+    /** Context about where the match was found */
+    context: ASTMatchContext;
+}
+/**
+ * Context information for an AST match.
+ */
+export interface ASTMatchContext {
+    /** The tree-sitter node type */
+    nodeType: string;
+    /** Parent function name, if match is inside a function */
+    parentFunction?: string;
+    /** Parent class name, if match is inside a class */
+    parentClass?: string;
+}
+/**
+ * Options for AST search.
+ */
+export interface ASTSearchOptions {
+    /** Search pattern (natural language or JSON depending on mode) */
+    pattern: string;
+    /** Search mode: 'simple' or 'pattern' */
+    mode?: SearchMode;
+    /** File glob pattern (default: all supported files) */
+    filePattern?: string;
+    /** Repository path to search */
+    path?: string;
+    /** Maximum results to return (default: 100) */
+    maxResults?: number;
+}
+/**
+ * Result of an AST search operation.
+ */
+export interface ASTSearchResult {
+    /** Number of matches found */
+    count: number;
+    /** Array of AST matches */
+    matches: ASTMatch[];
+    /** The search pattern used */
+    pattern: string;
+    /** The search mode used */
+    mode: SearchMode;
+    /** Repository path searched */
+    path: string;
+}
+/**
+ * Criteria for pattern mode matching.
+ */
+export interface PatternCriteria {
+    /** Tree-sitter node type to match */
+    type?: string;
+    /** Whether node should be async */
+    async?: boolean;
+    /** Text that must appear in the node */
+    textMatch?: string;
+    /** Name of the symbol to match */
+    name?: string;
+}
+/**
+ * Timeout for AST search operations (ms).
+ */
+export declare const AST_SEARCH_TIMEOUT = 60000;
+//# sourceMappingURL=types.d.ts.map

package/dist/lib/ast/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/lib/ast/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;GAKG;AACH,oBAAY,UAAU;IACrB,kEAAkE;IAClE,MAAM,WAAW;IACjB,qEAAqE;IACrE,OAAO,YAAY;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACxB,4CAA4C;IAC5C,IAAI,EAAE,MAAM,CAAA;IACZ,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAA;IACZ,gCAAgC;IAChC,MAAM,EAAE,MAAM,CAAA;IACd,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,CAAA;IAChB,mDAAmD;IACnD,IAAI,EAAE,MAAM,CAAA;IACZ,8CAA8C;IAC9C,OAAO,EAAE,eAAe,CAAA;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,gCAAgC;IAChC,QAAQ,EAAE,MAAM,CAAA;IAChB,0DAA0D;IAC1D,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,oDAAoD;IACpD,WAAW,CAAC,EAAE,MAAM,CAAA;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAChC,kEAAkE;IAClE,OAAO,EAAE,MAAM,CAAA;IACf,yCAAyC;IACzC,IAAI,CAAC,EAAE,UAAU,CAAA;IACjB,uDAAuD;IACvD,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,gCAAgC;IAChC,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,+CAA+C;IAC/C,UAAU,CAAC,EAAE,MAAM,CAAA;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,8BAA8B;IAC9B,KAAK,EAAE,MAAM,CAAA;IACb,2BAA2B;IAC3B,OAAO,EAAE,QAAQ,EAAE,CAAA;IACnB,8BAA8B;IAC9B,OAAO,EAAE,MAAM,CAAA;IACf,2BAA2B;IAC3B,IAAI,EAAE,UAAU,CAAA;IAChB,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAA;CACZ;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,qCAAqC;IACrC,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,mCAAmC;IACnC,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,wCAAwC;IACxC,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,kCAAkC;IAClC,IAAI,CAAC,EAAE,MAAM,CAAA;CACb;AAED;;GAEG;AACH,eAAO,MAAM,kBAAkB,QAAQ,CAAA"}

package/dist/lib/ast/types.js

@@ -0,0 +1,23 @@
+/**
+ * AST Search Types
+ *
+ * Type definitions for AST-based code search using tree-sitter.
+ */
+/**
+ * Search mode for AST patterns.
+ *
+ * - `simple`: Natural language patterns like "async function", "class"
+ * - `pattern`: JSON object criteria like {"type": "function_declaration"}
+ */
+export var SearchMode;
+(function (SearchMode) {
+    /** Natural language patterns: "async function", "class", "try" */
+    SearchMode["SIMPLE"] = "simple";
+    /** JSON criteria: {"type": "function_declaration", "async": true} */
+    SearchMode["PATTERN"] = "pattern";
+})(SearchMode || (SearchMode = {}));
+/**
+ * Timeout for AST search operations (ms).
+ */
+export const AST_SEARCH_TIMEOUT = 60000;
+//# sourceMappingURL=types.js.map

package/dist/lib/ast/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/lib/ast/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;GAKG;AACH,MAAM,CAAN,IAAY,UAKX;AALD,WAAY,UAAU;IACrB,kEAAkE;IAClE,+BAAiB,CAAA;IACjB,qEAAqE;IACrE,iCAAmB,CAAA;AACpB,CAAC,EALW,UAAU,KAAV,UAAU,QAKrB;AA8ED;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,KAAK,CAAA"}

package/dist/lib/commands/callers.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Callers command - Find who calls a function
+ *
+ * Uses kit grep to find all call sites of a function, filtering out the
+ * definition itself to show only actual usage locations.
+ */
+import { OutputFormat } from '../formatters/output';
+/**
+ * Execute callers command
+ *
+ * Finds all locations where a function is called by:
+ * 1. Looking up the function definition in PROJECT_INDEX.json
+ * 2. Using kit grep to find all occurrences
+ * 3. Filtering out the definition line to show only call sites
+ *
+ * @param functionName - Name of the function to find callers for
+ * @param format - Output format (markdown or JSON)
+ */
+export declare function executeCallers(functionName: string, format: OutputFormat): Promise<void>;
+//# sourceMappingURL=callers.d.ts.map

package/dist/lib/commands/callers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"callers.d.ts","sourceRoot":"","sources":["../../../src/lib/commands/callers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAS,YAAY,EAAE,MAAM,sBAAsB,CAAA;AAoF1D;;;;;;;;;;GAUG;AACH,wBAAsB,cAAc,CACnC,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,YAAY,GAClB,OAAO,CAAC,IAAI,CAAC,CAwHf"}