Retrieval and verification are separate failure points
Missing a file in the first-stage pool cannot be repaired by a later Noul. The README’s candidate-input option lets a caller evaluate a different recall strategy.
Inspect the supporting source ↗A Rust semantic-search CLI: local BM25 generates candidates, Jev checks file windows and reranks kept results, and code emits path:line matches or JSON.
Noul gates verify candidate file windows and bounded Choice reranking orders retained files; code owns candidate recall, output limits and exit status.
Adds concept-based navigation alongside literal search while preserving distinct no-match and operational-failure outcomes.
Fixed-version documentation and implementation material were inspected on 2026-10-24. No repository search or relevance benchmark was executed. Cached responses reproduce prior observations, not an independent second model trial.
Find code or documents by a semantic description while retaining grep-shaped results.
Material analysed:
Missing a file in the first-stage pool cannot be repaired by a later Noul. The README’s candidate-input option lets a caller evaluate a different recall strategy.
Inspect the supporting source ↗client.rs caches successful responses and retries transient 408/429/5xx outcomes with exponential delay. Corrupt cached records fall through to refetch instead of becoming evidence.
Inspect the supporting source ↗Useful for concept search inside a repository. Keep rg for exact literals and inspect both candidate recall and verified matches when a semantic query returns no result.
Read README’s candidates/snippets options and client.rs system_one. Trace an unparseable cached response and a non-retryable HTTP status; distinguish no matches from operational failure using the documented exit codes.