rustdoc search: path matches that skip segments should be deprioritized
Open
Nobody has claimed this yet.
A-rustdoc-search
C-enhancement
T-rustdoc
- Dominant language
- Rust
- Stars
- 119k
- Forks
- 16.1k
- PR merge metrics
- PR metrics pending
Description
a search for collections::b matches std::collections::LinkedList::back far before it matches std::collections::BTreeMap.
ommitting segments at the start and end should not be penalized, but ommitting them in the middle should be.
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 reproducing the rustdoc search for collections::b and compare the ranking of std::collections::LinkedList::back with std::collections::BTreeMap. Trace the search-ranking entry point responsible for path matches; done means omitted middle segments are penalized while omitted leading and trailing segments are not.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- search
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100