Bug: Early exit from search loop doesn't work for reverse search
Open
Nobody has claimed this yet.
bug
- Dominant language
- Go
- Stars
- 131
- Forks
- 16
- Avg merge
- 2d 4h
- Merged PRs (30d)
- 11
Description
When searching, we sort the fractions and search in a cycle, breaking the list of fractions into parts. If we have collected a sufficient number of documents, we can ignore the remaining fractions.
This optimization did not work for reverse search. Support needs to be added
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by tracing the search loop that sorts fractions and processes them in parts, then compare its normal and reverse-search paths. Verify how the sufficient document count triggers early exit, and confirm that reverse search stops without processing remaining fractions when that condition is met.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- databases, search
- Issue type
- Bug
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100