dovenest

Search: index-free name and content search, streamed over SSE

Server: GET /api/search walks the selected root with ignore::WalkParallel
(fd/ripgrep's walker) and greps with the grep crates, emitting one SSE event
per hit. No index. Name matching is against the entry's own name, not its
path, so a file is not a hit merely for sitting inside a matching directory.
The walk unwinds when the client drops the connection.

Client: a search view with streamed results, a stop button, a single-root
select, per-file collapsible match lists, and paged result lists.

Rendering is built around the reactive-graph cost dominating the DOM cost
(the same markup from plain JS is ~28x faster), so:

- keyed <For> for every list, so a flush builds only the new nodes
- one escaped inner_html per text instead of a component per highlight
  fragment; file names and contents are untrusted, so everything goes
  through push_escaped and the only markup emitted is the <mark>
- icon_svg() as a plain function, and inner_html rather than a NodeRef
  on_load effect, to avoid an owner and an effect per icon
- one delegated click handler per list instead of a Callback per row
- writes applied in chunks sized by feedback from the previous round's
  interval, yielding to the event loop between them

Result lists page 100 rows / 20 cards at a time. Groups and open files are
hidden with `display`, never unmounted, so results survive scope toggling
and the window scroll is preserved across opening a result.

Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>