[QST]From index into a coordinate (or coordniate into a index), it has two different implementations, how should one distinguish and understand the scenarios for their use?
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 10.5k
- Forks
- 2.1k
- Avg merge
- 3d 11h
- Merged PRs (30d)
- 7
Description
Implementations:
1)Function with stride: https://github.com/NVIDIA/cutlass/blob/main/include/cute/stride.hpp#L102
2)Function without stride: https://github.com/NVIDIA/cutlass/blob/main/include/cute/stride.hpp#L152
function with stride is easy to understand, but without stride, why need to compute like: i = c0 + s0 * (c1 + s1 * (c2 + s2 * ...))
How to use the last function, and also for idx2cor.
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
Start by reading include/cute/stride.hpp around lines 102 and 152, comparing the stride and no-stride implementations and the idx2coord entry point mentioned in the issue. Done means documenting when each form is used, how the nested expression is interpreted, and how idx2coord relates to the conversion.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- hpc
- Issue type
- Documentation
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100