| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #include "zavyalov_a_qsort_simple_merge/seq/include/ops_seq.hpp" | ||
| 2 | |||
| 3 | #include <cstdlib> | ||
| 4 | #include <vector> | ||
| 5 | |||
| 6 | #include "zavyalov_a_qsort_simple_merge/common/include/common.hpp" | ||
| 7 | |||
| 8 | namespace zavyalov_a_qsort_simple_merge { | ||
| 9 | |||
| 10 |
1/2✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
|
96 | ZavyalovAQsortSEQ::ZavyalovAQsortSEQ(const InType &in) { |
| 11 | SetTypeOfTask(GetStaticTypeOfTask()); | ||
| 12 |
1/2✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
|
96 | GetInput() = in; |
| 13 | 96 | } | |
| 14 | |||
| 15 | 96 | bool ZavyalovAQsortSEQ::ValidationImpl() { | |
| 16 | 96 | return !GetInput().empty(); | |
| 17 | } | ||
| 18 | |||
| 19 | 96 | bool ZavyalovAQsortSEQ::PreProcessingImpl() { | |
| 20 | 96 | return true; | |
| 21 | } | ||
| 22 | |||
| 23 | 96 | bool ZavyalovAQsortSEQ::RunImpl() { | |
| 24 | 96 | std::vector<double> input_copy = GetInput(); | |
| 25 |
1/2✓ Branch 0 taken 96 times.
✗ Branch 1 not taken.
|
96 | if (input_copy.data() != nullptr) { |
| 26 |
1/2✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
|
96 | MyQsort(input_copy.data(), 0, static_cast<int>(input_copy.size()) - 1); |
| 27 |
1/2✓ Branch 0 taken 96 times.
✗ Branch 1 not taken.
|
96 | if (!input_copy.empty()) { |
| 28 |
1/2✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
|
96 | GetOutput() = input_copy; |
| 29 | } | ||
| 30 | } | ||
| 31 | 96 | return true; | |
| 32 | } | ||
| 33 | |||
| 34 | 96 | bool ZavyalovAQsortSEQ::PostProcessingImpl() { | |
| 35 | 96 | return true; | |
| 36 | } | ||
| 37 | |||
| 38 | } // namespace zavyalov_a_qsort_simple_merge | ||
| 39 |