Marcel 43595aeb8a refactor(search): replace O(n²) indexOf with HashMap for rank ordering ...

ids.indexOf() scans the full list for each document, giving O(n²) total.
Build a Map<UUID, Integer> once at O(n) and use getOrDefault at O(1) per
document. Behavior is identical; existing tests remain green.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

2026-04-15 11:35:30 +02:00

..

java/org/raddatz/familienarchiv

refactor(search): replace O(n²) indexOf with HashMap for rank ordering

2026-04-15 11:35:30 +02:00

resources

feat(fts): backfill search_vector for all existing documents (V35)

2026-04-15 11:35:30 +02:00