mirror of
https://github.com/hanzoai/mcp.git
synced 2026-10-15 12:30:12 +00:00
zeekay
fe2e8c2a02
A search with a limit now runs in two passes: every file is weighed (matching lines counted, definitions as 2^32) without holding a hit, then hits are read from the heaviest files until the limit is met. The answer is the head of the unlimited list, checked for limits from 0 to the whole list over text, symbol, context, ties and documents. Before, every hit of every file was built, sorted and deduplicated before the limit applied: a pattern matching 1.28 million lines of a 112 MB tree took 15.6 s where it now takes 0.14 s, and rg's --max-count had bounded that case before this crate replaced it. When there is a tgrep index at or above the searched directory the search asks it which files can match. Candidates are matched against current bytes, and files whose content or name changed at or after the build are read from disk whether or not the index lists them, so the answer is the scan's. Index::Skip scans, Index::Only refuses to; the tests ask every query all three ways on the same tree, before and after edits, creations, deletions and renames, and fail if the freshness walk is disabled. hanzo-mcp index [DIR] builds one. Measured on 112 MB / 9,026 files, cores 0-4: rg 43-55 ms, scan 75-93, indexed 28-50. Without a watcher the index costs a metadata walk.