Search Hierarchy

This enforces a token efficient search strategy by routing queries to the right tool. It pushes you toward AST-grep for structural patterns like function definitions (around 50 tokens), LEANN for semantic questions about how systems work (around 100 tokens), and reserves grep for exact identifier searches. The hook system actually blocks inefficient tool choices and suggests alternatives, which is aggressive but probably necessary since the default behavior wastes thousands of tokens reading files you don't need. The decision tree is sensible: find files first with cheap searches, then read only what matters. Works best if you're dealing with token budgets on large codebases where a few wrong reads blow your context window.