| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include "otcheskov_s_linear_topology/seq/include/ops_seq.hpp" | ||
| 2 | |||
| 3 | #include <cmath> | ||
| 4 | #include <cstddef> | ||
| 5 | #include <vector> | ||
| 6 | |||
| 7 | #include "otcheskov_s_linear_topology/common/include/common.hpp" | ||
| 8 | |||
| 9 | namespace otcheskov_s_linear_topology { | ||
| 10 | |||
| 11 |
1/2✓ Branch 1 taken 64 times.
✗ Branch 2 not taken.
|
64 | OtcheskovSLinearTopologySEQ::OtcheskovSLinearTopologySEQ(const InType &in) { |
| 12 | SetTypeOfTask(GetStaticTypeOfTask()); | ||
| 13 | GetInput() = in; | ||
| 14 | 64 | GetOutput() = {}; | |
| 15 | 64 | } | |
| 16 | |||
| 17 | 64 | bool OtcheskovSLinearTopologySEQ::ValidationImpl() { | |
| 18 | const auto &header = GetInput().first; | ||
| 19 | const auto &data = GetInput().second; | ||
| 20 |
6/10✓ Branch 0 taken 64 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 64 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 64 times.
✓ Branch 6 taken 48 times.
✓ Branch 7 taken 16 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 16 times.
|
64 | return header.src >= 0 && header.dest >= 0 && header.delivered == 0 && !data.empty() && |
| 21 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 16 times.
|
16 | static_cast<size_t>(header.data_size) == data.size(); |
| 22 | } | ||
| 23 | |||
| 24 | 64 | bool OtcheskovSLinearTopologySEQ::PreProcessingImpl() { | |
| 25 | 64 | return true; | |
| 26 | } | ||
| 27 | |||
| 28 | 64 | bool OtcheskovSLinearTopologySEQ::RunImpl() { | |
| 29 | GetOutput() = GetInput(); | ||
| 30 | 64 | GetOutput().first.delivered = 1; | |
| 31 | 64 | return true; | |
| 32 | } | ||
| 33 | |||
| 34 | 64 | bool OtcheskovSLinearTopologySEQ::PostProcessingImpl() { | |
| 35 | 64 | return true; | |
| 36 | } | ||
| 37 | |||
| 38 | } // namespace otcheskov_s_linear_topology | ||
| 39 |