28namespace seqan3::detail
32template <
template <
typename...>
typename container_type,
typename seq_alph_t,
typename... rest_t>
34constexpr auto remove_gap_from_value_type(container_type<
gapped<seq_alph_t>, rest_t...>)
35 -> container_type<seq_alph_t, rest_t...>;
38template <
template <
typename...>
typename container_type,
39 template <
typename...>
40 typename allocator_type,
46 -> container_type<seq_alph_t, allocator_type<seq_alph_t>, rest_t...>;
56 &&
requires { remove_gap_from_value_type(std::declval<t>()); }
57struct unaligned_seq<t>
60 using type =
decltype(remove_gap_from_value_type(std::declval<t>()));
67struct unaligned_seq<t>
74using unaligned_seq_t =
typename unaligned_seq<t>::type;
218 aligned_sequence<t> && std::ranges::forward_range<t> &&
requires {
typename detail::unaligned_seq_t<t>; }
219 &&
requires (t v, detail::unaligned_seq_t<t> unaligned) {
223 } -> std::same_as<std::ranges::iterator_t<t>>;
226 } -> std::same_as<std::ranges::iterator_t<t>>;
229 } -> std::same_as<std::ranges::iterator_t<t>>;
232 } -> std::same_as<std::ranges::iterator_t<t>>;
234 assign_unaligned(v, unaligned)
235 } -> std::same_as<void>;
263template <sequence_container aligned_seq_t>
264 requires detail::is_gapped_alphabet<std::iter_value_t<aligned_seq_t>>
265inline typename aligned_seq_t::iterator
insert_gap(aligned_seq_t & aligned_seq,
266 typename aligned_seq_t::const_iterator pos_it)
287template <sequence_container aligned_seq_t>
288 requires detail::is_gapped_alphabet<std::iter_value_t<aligned_seq_t>>
289inline typename aligned_seq_t::iterator
insert_gap(aligned_seq_t & aligned_seq,
290 typename aligned_seq_t::const_iterator pos_it,
291 typename aligned_seq_t::size_type
size)
315template <sequence_container aligned_seq_t>
316 requires detail::is_gapped_alphabet<std::iter_value_t<aligned_seq_t>>
317inline typename aligned_seq_t::iterator
erase_gap(aligned_seq_t & aligned_seq,
318 typename aligned_seq_t::const_iterator pos_it)
320 if (*pos_it != gap{})
321 throw gap_erase_failure(
"The position to be erased does not contain a gap.");
323 return aligned_seq.erase(pos_it);
346template <sequence_container aligned_seq_t>
347 requires detail::is_gapped_alphabet<std::iter_value_t<aligned_seq_t>>
348inline typename aligned_seq_t::iterator
erase_gap(aligned_seq_t & aligned_seq,
349 typename aligned_seq_t::const_iterator first,
350 typename aligned_seq_t::const_iterator last)
352 for (
auto it = first; it != last; ++it)
354 throw gap_erase_failure(
"The range to be erased contains at least one non-gap character.");
356 return aligned_seq.erase(first, last);
381template <sequence_container aligned_seq_t, std::ranges::forward_range unaligned_sequence_type>
382 requires detail::is_gapped_alphabet<std::iter_value_t<aligned_seq_t>>
384 std::ranges::range_reference_t<unaligned_sequence_type>>
385inline void assign_unaligned(aligned_seq_t & aligned_seq, unaligned_sequence_type && unaligned_seq)
389 tmp.resize(std::ranges::distance(unaligned_seq));
390#if SEQAN3_WORKAROUND_GCC_BOGUS_MEMCPY
391# pragma GCC diagnostic push
392# pragma GCC diagnostic ignored "-Wstringop-overflow"
395#if SEQAN3_WORKAROUND_GCC_BOGUS_MEMCPY
396# pragma GCC diagnostic pop
398 swap(aligned_seq, tmp);
422template <
typename range_type>
423 requires requires (range_type v) {
424 v.insert_gap(std::ranges::iterator_t<range_type>{});
425 v.insert_gap(std::ranges::iterator_t<range_type>{},
typename range_type::size_type{});
427std::ranges::iterator_t<range_type>
insert_gap(range_type & rng,
428 std::ranges::iterator_t<range_type>
const pos_it,
429 typename range_type::size_type
const size = 1)
431 return rng.insert_gap(pos_it,
size);
450template <
typename range_type>
451 requires requires (range_type v) { v.erase_gap(std::ranges::iterator_t<range_type>{}); }
452std::ranges::iterator_t<range_type>
erase_gap(range_type & rng, std::ranges::iterator_t<range_type>
const pos_it)
454 return rng.erase_gap(pos_it);
475template <
typename range_type>
476 requires requires (range_type v) {
477 v.erase_gap(std::ranges::iterator_t<range_type>{}, std::ranges::iterator_t<range_type>{});
479std::ranges::iterator_t<range_type>
erase_gap(range_type & rng,
480 std::ranges::iterator_t<range_type>
const first,
481 std::ranges::iterator_t<range_type>
const last)
483 return rng.erase_gap(first, last);
488namespace seqan3::detail
494template <
typename... elems>
500template <
typename... elems>
501inline constexpr bool all_model_aligned_seq<type_list<elems...>> = all_model_aligned_seq<elems...>;
Includes customized exception types for the alignment module .
A combined alphabet that can hold values of either of its alternatives..
Definition: alphabet_variant.hpp:120
aligned_seq_t::iterator insert_gap(aligned_seq_t &aligned_seq, typename aligned_seq_t::const_iterator pos_it, typename aligned_seq_t::size_type size)
An implementation of seqan3::writable_aligned_sequence::insert_gap for sequence containers.
Definition: aligned_sequence_concept.hpp:289
void assign_unaligned(aligned_seq_t &aligned_seq, unaligned_sequence_type &&unaligned_seq)
An implementation of seqan3::writable_aligned_sequence::assign_unaligned_sequence for sequence contai...
Definition: aligned_sequence_concept.hpp:385
std::ranges::iterator_t< range_type > erase_gap(range_type &rng, std::ranges::iterator_t< range_type > const first, std::ranges::iterator_t< range_type > const last)
An implementation of seqan3::writable_aligned_sequence::erase_gap for ranges with the corresponding m...
Definition: aligned_sequence_concept.hpp:479
aligned_seq_t::iterator erase_gap(aligned_seq_t &aligned_seq, typename aligned_seq_t::const_iterator pos_it)
An implementation of seqan3::writable_aligned_sequence::erase_gap for sequence containers.
Definition: aligned_sequence_concept.hpp:317
std::ranges::iterator_t< range_type > erase_gap(range_type &rng, std::ranges::iterator_t< range_type > const pos_it)
An implementation of seqan3::writable_aligned_sequence::erase_gap for ranges with the corresponding m...
Definition: aligned_sequence_concept.hpp:452
aligned_seq_t::iterator erase_gap(aligned_seq_t &aligned_seq, typename aligned_seq_t::const_iterator first, typename aligned_seq_t::const_iterator last)
An implementation of seqan3::writable_aligned_sequence::erase_gap for sequence containers.
Definition: aligned_sequence_concept.hpp:348
std::ranges::iterator_t< range_type > insert_gap(range_type &rng, std::ranges::iterator_t< range_type > const pos_it, typename range_type::size_type const size=1)
An implementation of seqan3::writable_aligned_sequence::insert_gap for ranges with the corresponding ...
Definition: aligned_sequence_concept.hpp:427
aligned_seq_t::iterator insert_gap(aligned_seq_t &aligned_seq, typename aligned_seq_t::const_iterator pos_it)
An implementation of seqan3::writable_aligned_sequence::insert_gap for sequence containers.
Definition: aligned_sequence_concept.hpp:265
constexpr size_t size
The size of a type pack.
Definition: traits.hpp:146
The generic concept for an aligned sequence.
The (most general) container concept as defined by the standard library.
The generic concept for a (biological) sequence.
Resolves to std::is_assignable_v<t>.
The generic concept for an aligned sequence that is writable.
The main SeqAn3 namespace.
Definition: aligned_sequence_concept.hpp:29
Additional non-standard concepts for ranges.
Adaptations of concepts from the standard library.