Skip to content

Source Indexing โ€‹

Problem โ€‹

Cross-file search needs an index of where every symbol is defined and used.

Why tree-sitter.zig helps โ€‹

One compiled query executed per file with a reused cursor produces (file, range, name) triples cheaply.

API โ€‹

parser.compileQuery once; parser.queryCursor() reused; setByteRange for sharding.

Architecture โ€‹

text
File list โ†’ parse each โ†’ execute shared query โ†’ index triples

Next steps โ€‹

Released under the MIT License.