smart-explore

AST-based code exploration parses the codebase with tree-sitter to locate symbols and returns folded file views, minimizing unnecessary file reads and token usage. You can use the smart_search tool to find functions, classes, and methods across varying codebase sizes.

AST parsing enables token optimization by indexing code structurally to return ranked symbols and folded file views. This mechanism limits reads to requested symbols and outlines file structures, avoiding the token overhead of loading full file implementations.

The best way to extract a single method is using targeted unfolding, which returns the full source of a specific symbol based on AST node boundaries. This guarantees implementation completeness while avoiding full-file reads and saving tokens.

Yes, structural code search supports path, file_pattern, and max_results parameters to narrow down discovery. This allows you to precisely target specific directories and file types when locating symbols within large codebases.

Yes, tree-sitter code search provides complete AST-based skeletons for large files to outline their structure. This presents the file's organization so you can understand its layout without reading the underlying implementations.

You should avoid full-file reads when inspecting specific implementations across many services, such as locating a shutdown routine. AST-based discovery and targeted unfolding limit reads to exact symbol boundaries, preventing excessive token consumption.