Structure containing row limits for the partitioning of the matrix product calculations.
More...
|
| int | Arows |
| | The number of rows in matrix A participating in the multiplication sub-problem. More...
|
| |
| int | 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...
|
| |
| int | Arows_start |
| | The firs row in matrix A participating in the multiplication sub-problem. More...
|
| |
| int | Brows |
| | The number of rows in matrix B participating in the multiplication sub-problem. More...
|
| |
| int | 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...
|
| |
| int | Brows_start |
| | The firs row in matrix B participating in the multiplication sub-problem. More...
|
| |
| int | Crows |
| | The number of rows in matrix C participating in the multiplication sub-problem. More...
|
| |
| int | 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...
|
| |
| int | 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 94 of file dot.h.