| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include "gutyansky_a_matrix_column_sum/seq/include/ops_seq.hpp" | ||
| 2 | |||
| 3 | #include <algorithm> | ||
| 4 | #include <cstddef> | ||
| 5 | #include <vector> | ||
| 6 | |||
| 7 | #include "gutyansky_a_matrix_column_sum/common/include/common.hpp" | ||
| 8 | |||
| 9 | namespace gutyansky_a_matrix_column_sum { | ||
| 10 | |||
| 11 |
1/2✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
|
56 | GutyanskyAMatrixColumnSumSEQ::GutyanskyAMatrixColumnSumSEQ(const InType &in) { |
| 12 | SetTypeOfTask(GetStaticTypeOfTask()); | ||
| 13 | |||
| 14 | GetInput() = in; | ||
| 15 | GetOutput() = {}; | ||
| 16 | 56 | } | |
| 17 | |||
| 18 |
1/2✓ Branch 0 taken 56 times.
✗ Branch 1 not taken.
|
56 | bool GutyanskyAMatrixColumnSumSEQ::ValidationImpl() { |
| 19 | 56 | return GetInput().IsValid(); | |
| 20 | } | ||
| 21 | |||
| 22 | 56 | bool GutyanskyAMatrixColumnSumSEQ::PreProcessingImpl() { | |
| 23 | 56 | return true; | |
| 24 | } | ||
| 25 | |||
| 26 | 56 | bool GutyanskyAMatrixColumnSumSEQ::RunImpl() { | |
| 27 | 56 | GetOutput().resize(GetInput().cols); | |
| 28 | std::fill(GetOutput().begin(), GetOutput().end(), 0); | ||
| 29 | |||
| 30 |
2/2✓ Branch 0 taken 8376 times.
✓ Branch 1 taken 56 times.
|
8432 | for (size_t i = 0; i < GetInput().rows; i++) { |
| 31 |
2/2✓ Branch 0 taken 8004200 times.
✓ Branch 1 taken 8376 times.
|
8012576 | for (size_t j = 0; j < GetInput().cols; j++) { |
| 32 | 8004200 | GetOutput()[j] += GetInput().data[(i * GetInput().cols) + j]; | |
| 33 | } | ||
| 34 | } | ||
| 35 | |||
| 36 | 56 | return true; | |
| 37 | } | ||
| 38 | |||
| 39 | 56 | bool GutyanskyAMatrixColumnSumSEQ::PostProcessingImpl() { | |
| 40 | 56 | return true; | |
| 41 | } | ||
| 42 | |||
| 43 | } // namespace gutyansky_a_matrix_column_sum | ||
| 44 |