Николаев Денис. Технология SEQ-MPI. Нахождение наиболее отличающихся по значению соседних элементов вектора. Вариант 8 #123
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Update deadlines for task_1 and task_2
…_vec_neighbors' into nikolaev_d_most_dif_vec_neighbors
Codecov Report❌ Patch coverage is Additional details and impacted files@@ Coverage Diff @@
## master #123 +/- ##
==========================================
+ Coverage 94.03% 94.40% +0.37%
==========================================
Files 15 18 +3
Lines 486 554 +68
Branches 181 214 +33
==========================================
+ Hits 457 523 +66
- Partials 29 31 +2 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
aobolensk
reviewed
Dec 5, 2025
Comment on lines
+25
to
+33
| // input_data_.resize(kCount_); | ||
|
|
||
| // std::random_device dev; | ||
| // std::mt19937 rng(dev()); | ||
| // std::uniform_int_distribution<int> dist(-10'000, 10'000); | ||
|
|
||
| // for (size_t i = 0; i < kCount_; ++i) { | ||
| // input_data_[i] = dist(rng); | ||
| // } |
| TEST_P(NikolaevDMostDifVecNeighborsFuncTests, FuncTestsRun) { | ||
| ExecuteTest(GetParam()); | ||
| } | ||
|
|
Member
There was a problem hiding this comment.
Please, add tests for the corner cases
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Описание
Реализован алгоритм нахождение наиболее отличающихся по значению соседних элементов вектора. Разработаны 2 версии - SEQ и MPI. В MPI реализации входной вектор разбивается на непрерывные сегменты, которые рассылаются по процессам. Потом локально каждый процесс обрабатывает свой сегмент данных и возвращает результат на нулевой процесс, где ищется финальный ответ (наиболее отличающаяся пара чисел). Обе реализации успешно проходят функциональные тесты.
Чек-лист
<фамилия>_<первая_буква_имени>_<короткое_название_задачи>clang-formatлокально в моем форке (нет ошибок форматирования)clang-tidyлокально в моем форке (нет предупреждений/ошибок)nesterov_a_vector_sum), а не вmaster