Structure containing row limits for the partitioning of the matrix product calculations.
More...
|
size_t | Arows |
| The number of rows in matrix A participating in the multiplication sub-problem. More...
|
|
size_t | Arows_end |
| The last row in matrix A participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Arows_start, Arows_end) ) More...
|
|
size_t | Arows_start |
| The firs row in matrix A participating in the multiplication sub-problem. More...
|
|
size_t | Brows |
| The number of rows in matrix B participating in the multiplication sub-problem. More...
|
|
size_t | Brows_end |
| The last row in matrix B participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Brows_start, Brows_end) ) More...
|
|
size_t | Brows_start |
| The firs row in matrix B participating in the multiplication sub-problem. More...
|
|
size_t | Crows |
| The number of rows in matrix C participating in the multiplication sub-problem. More...
|
|
size_t | Crows_end |
| The last row in matrix C participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Crows_start, Crows_end) ) More...
|
|
size_t | Crows_start |
| The firs row in matrix C participating in the multiplication sub-problem. More...
|
|
Structure containing row limits for the partitioning of the matrix product calculations.
(the partitioning follows the divide-and-conquer strategy)
Definition at line 77 of file dot.h.