Structure containing column limits for the partitioning of the matrix product calculations.
More...
|
size_t | Acols |
| The number of cols in matrix A participating in the multiplication sub-problem. More...
|
|
size_t | Acols_end |
| The last col in matrix A participating in the multiplication sub-problem. (The cols are picked from a closed-open range [Acols_start, Acols_end) ) More...
|
|
size_t | Acols_start |
| The firs col in matrix A participating in the multiplication sub-problem. More...
|
|
size_t | Bcols |
| The number of cols in matrix B participating in the multiplication sub-problem. More...
|
|
size_t | Bcols_end |
| The last col in matrix B participating in the multiplication sub-problem. (The cols are picked from a closed-open range [Bcols_start, Bcols_end) ) More...
|
|
size_t | Bcols_start |
| The firs col in matrix B participating in the multiplication sub-problem. More...
|
|
size_t | Ccols |
| The number of cols in matrix C participating in the multiplication sub-problem. More...
|
|
size_t | Ccols_end |
| The last col in matrix C participating in the multiplication sub-problem. (The col are picked from a closed-open range [Ccols_start, Ccols_end) ) More...
|
|
size_t | Ccols_start |
| The firs col in matrix C participating in the multiplication sub-problem. More...
|
|
Structure containing column limits for the partitioning of the matrix product calculations.
(the partitioning follows the divide-and-conquer strategy)
Definition at line 103 of file dot.h.