Partial search for `BTreeSet` and `BTreeMap`.
Open
Nobody has claimed this yet.
T-libs
- Dominant language
- Markdown
- Stars
- 6.6k
- Forks
- 1.7k
- Avg merge
- 16h 14m
- Merged PRs (30d)
- 1
Description
A method to find the element with the highest key equal to or less than the needle, get_under.
Contributor guide
No contributing guide indexed for this repository
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 reviewing the current BTreeSet and BTreeMap APIs and the RFC process context for this request. Compare the proposed get_under behavior with existing collection operations; done means the scope and expected behavior for finding the greatest key less than or equal to a needle are defined and accepted.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- backend-api-design
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100