mirror of
https://github.com/MarginaliaSearch/MarginaliaSearch.git
synced 2025-02-24 05:18:58 +00:00
![]() We no longer break the query into "sets" of search terms and need to adapt the code to not use this assumption. For the API service, we'll simulate the old behavior to keep the API stable. For the search service, we'll introduce a new way of calculating positions through tree aggregation. |
||
---|---|---|
.. | ||
api | ||
java/nu/marginalia | ||
test/nu/marginalia | ||
build.gradle | ||
readme.md |
The search query subsystem is responsible for parsing a query, translating it to a request, and then dispatching it to the appropriate index nodes and translating the responses back again.