[TASK] Refactor & clean up templates in many sparse prims
Nobody has claimed this yet.
- Dominant language
- Cuda
- Stars
- 1k
- Forks
- 251
- Avg merge
- 1d 8h
- Merged PRs (30d)
- 31
Description
There are many places in the sparse prims where templates could be cleaned up (and used). We had originally adopted using int for the row & column arrays in many of the prims because that's what cusparse & scipy were limited to using but we've since started using template types for those in many cuml algorithms (and more recent sparse prims) so it's time those get cleaned up.
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 concerns templates across many sparse primitives, with newer templated patterns in cuML algorithms and sparse primitives as reference points. Start by locating the sparse primitives and comparing their row and column array types with those newer implementations. Done means consistently replacing the remaining fixed int index types where appropriate; no specific files or tests are named.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100