linksplatform / linksplatform/doublets-rs
Use `rayon` and `bump-herd` to crazy fast parallel search
Open
Nobody has claimed this yet.
Issue:Incomplete
Issue:Middle
Parallel:Rayon
- Dominant language
- Rust
- Stars
- 6
- Forks
- 0
- Avg merge
- 1h 37m
- Merged PRs (30d)
- 1
Description
You can start with this example
fn par_each_impl(..., root: T) {
if magic_appropriate_to_join(...) {
rayon::join(
|| par_each_impl(..., left(root)),
|| par_each_impl(..., right(root)),
)
} else {
seq_each_impl(..., root)
}
}
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 locating the existing search entry point and the implementations represented by par_each_impl and seq_each_impl. Compare the issue's rayon::join example with the current traversal, then determine how bump-herd fits; the work is done when search has the requested parallel implementation and its performance is verified.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- performance, search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100