<algorithm>: ranges::search_n potential performance improvement
Open
Nobody has claimed this yet.
performance
- Dominant language
- C++
- Stars
- 11.1k
- Forks
- 1.7k
- Avg merge
- 4d 15h
- Merged PRs (30d)
- 22
Description
The implementation of ranges::search_n for bidirectional iterators has some opportunities to investigate for performance improvements; see the discussion that starts at https://github.com/microsoft/STL/pull/914#discussion_r446442791.
(I'll update this issue with specifics and links to sources after #914 merges.)
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 reading the discussion linked from microsoft/STL#914, then inspect the ranges::search_n implementation for bidirectional iterators. The issue does not yet name files, tests, sources, or concrete success criteria; completion would require the promised specifics and a measurable performance improvement.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 18/100