25 namespace seqan3::detail
44 struct max_score_updater_simd_global
63 template <
typename score_t,
typename coordinate_t>
65 requires (std::assignable_from<score_t &, score_t const &> &&
66 requires (coordinate_t coordinate)
68 requires simd_concept<decltype(coordinate.col)>;
69 requires simd_concept<decltype(coordinate.row)>;
72 void operator()(score_t & optimal_score,
73 coordinate_t
const & optimal_coordinate,
74 score_t current_score,
75 coordinate_t
const & current_coordinate)
const noexcept
77 auto mask = (optimal_coordinate.col == current_coordinate.col) &&
78 (optimal_coordinate.row == current_coordinate.row);
79 optimal_score = (mask) ?
std::move(current_score) : optimal_score;
87 template <
typename alignment_configuration_t, std::semiregular optimum_updater_t>
89 requires is_type_specialisation_of_v<alignment_configuration_t, configuration> &&
90 std::invocable<optimum_updater_t,
91 typename alignment_configuration_traits<alignment_configuration_t>::score_type &,
92 typename alignment_configuration_traits<alignment_configuration_t>::matrix_coordinate_type &,
93 typename alignment_configuration_traits<alignment_configuration_t>::score_type,
94 typename alignment_configuration_traits<alignment_configuration_t>::matrix_coordinate_type>
96 class policy_optimum_tracker_simd :
97 protected policy_optimum_tracker<alignment_configuration_t, optimum_updater_t>
101 using base_policy_t = policy_optimum_tracker<alignment_configuration_t, optimum_updater_t>;
104 using typename base_policy_t::traits_type;
105 using typename base_policy_t::score_type;
108 using scalar_type =
typename simd::simd_traits<score_type>::scalar_type;
110 using original_score_type =
typename traits_type::original_score_type;
112 static_assert(simd_concept<score_type>,
"Must be a simd type!");
115 using base_policy_t::compare_and_set_optimum;
116 using base_policy_t::optimal_score;
117 using base_policy_t::optimal_coordinate;
124 policy_optimum_tracker_simd() =
default;
125 policy_optimum_tracker_simd(policy_optimum_tracker_simd
const &) =
default;
126 policy_optimum_tracker_simd(policy_optimum_tracker_simd &&) =
default;
127 policy_optimum_tracker_simd & operator=(policy_optimum_tracker_simd
const &) =
default;
128 policy_optimum_tracker_simd & operator=(policy_optimum_tracker_simd &&) =
default;
129 ~policy_optimum_tracker_simd() =
default;
139 policy_optimum_tracker_simd(alignment_configuration_t
const & config) : base_policy_t{config}
141 base_policy_t::test_last_row_cell =
true;
142 base_policy_t::test_last_column_cell =
true;
198 template <std::ranges::input_range sequence1_collection_t, std::ranges::input_range sequence2_collection_t>
199 void initialise_tracker(sequence1_collection_t & sequence1_collection,
200 sequence2_collection_t & sequence2_collection)
202 using index_t =
typename traits_type::matrix_index_type;
203 using scalar_index_t =
typename simd_traits<index_t>::scalar_type;
205 scalar_index_t largest_sequence1_size{};
206 scalar_index_t largest_sequence2_size{};
211 size_t sequence_count{};
212 for (
auto && [sequence1, sequence2] : views::zip(sequence1_collection, sequence2_collection))
214 sequence1_sizes[sequence_count] = std::ranges::distance(sequence1);
215 sequence2_sizes[sequence_count] = std::ranges::distance(sequence2);
216 largest_sequence1_size =
std::max(largest_sequence1_size, sequence1_sizes[sequence_count]);
217 largest_sequence2_size =
std::max(largest_sequence2_size, sequence2_sizes[sequence_count]);
224 for (
size_t index = 0; index != sequence_count; ++index)
226 assert(sequence1_sizes[index] <= largest_sequence1_size);
227 assert(sequence2_sizes[index] <= largest_sequence2_size);
229 padding_offsets[index] =
std::min(largest_sequence1_size - sequence1_sizes[index],
230 largest_sequence2_size - sequence2_sizes[index]);
231 sequence1_sizes[index] += padding_offsets[index];
232 sequence2_sizes[index] += padding_offsets[index];
236 optimal_coordinate.col = simd::load<index_t>(sequence1_sizes.data());
237 optimal_coordinate.row = simd::load<index_t>(sequence2_sizes.data());