[FEA]: Optimize `fill` algorithm for `mdspan`
Open
- Dominant language
- C++
- Stars
- 2.5k
- Forks
- 486
- Avg merge
- 2d 6h
- Merged PRs (30d)
- 295
Description
This issue can be closed by optimizing `fill` for `mdspan` for different layouts and accessors.
Contributor guide
Research direction
Start at the existing fill algorithm for mdspan and trace how layouts and accessors are represented. Identify the relevant performance tests or benchmarks before changing anything; done means fill is optimized for the stated layout and accessor combinations while preserving its behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 42/100