BTreeSet should support in-place boolean operations
Nobody has claimed this yet.
- Dominant language
- Markdown
- Stars
- 6.6k
- Forks
- 1.7k
- Avg merge
- 16h 14m
- Merged PRs (30d)
- 1
Description
At the moment, the boolean operations return an iterator that must be collected into a set each time. This prevents following boolean operations for benefitting from the knowledge that the items are already sorted.
I should be able to do in-place operations that are much more efficient, and potentially operations on multiple sets at once. (For example, N-way intersection).
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
The issue names no files or tests. Start by reviewing Rust's existing BTreeSet boolean-operation APIs and the RFC process, then define the scope for in-place and multi-set operations. Done should be a concrete, agreed design suitable for an RFC rather than an implementation patch.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100