The search quality should not degrade as rawq chunks code by its structure into similar sizes across the codebase, the only thing that can get worse is the full indexing time for large codebases, but it is a one-time action and depends on the hardware capabilities.
I wanted to implement HNSW to make searching faster for 50K+ chunks, but there are difficulties with that right now, I couldn’t get it to work properly, but it is on the roadmap.
1. Indexing is incremental — only changed files get re-embedded either on subsequent runs or with the watch mode command in the background. So no, it is not full re-index each time, unless forced.
2. 63k lines of Rust code took about 4 minutes on my 6 GB VRAM 3060 RTX on laptop for full indexing. For a 10k-file monorepo, I honestly haven't tested yet. The vector store is flat brute-force (no HNSW), works well under ~50k chunks. At 10k files, you'd probably hit 200k+ chunks, so that part would need work. If you have a repo that size, I'd love to know how it goes.
I wanted to implement HNSW to make searching faster for 50K+ chunks, but there are difficulties with that right now, I couldn’t get it to work properly, but it is on the roadmap.