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