41template <std::ranges::view underlying_range_type>
42 requires std::ranges::forward_range<underlying_range_type> && std::ranges::common_range<underlying_range_type>
47 template <
typename range_type>
91 if (std::ranges::empty(
u_range))
97 if constexpr (std::ranges::bidirectional_range<underlying_range_type>)
104 if constexpr (std::ranges::sized_range<underlying_range_type>)
115 while (++tmp_it != std::ranges::end(
u_range));
140 template <
typename other_range_t>
142 && std::ranges::viewable_range<other_range_t>
144 std::constructible_from<underlying_range_type,
211#if SEQAN3_WORKAROUND_GCC_NON_TEMPLATE_REQUIRES
212 template <
typename = underlying_range_type>
214 constexpr auto size() const noexcept
215 requires
std::ranges::sized_range<underlying_range_type>
234template <std::ranges::viewable_range other_range_t>
251template <std::ranges::view underlying_range_type>
252 requires std::ranges::forward_range<underlying_range_type> && std::ranges::common_range<underlying_range_type>
253template <
typename range_type>
259 template <
typename other_range_type>
261#if !SEQAN3_WORKAROUND_FURTHER_CONSTRAIN_FRIEND_DECLARATION
265 friend class basic_iterator;
317 second_it{std::ranges::next(iter, 1, end_it)},
330 template <
typename other_range_type>
331 requires std::convertible_to<other_range_type, range_type &>
334 basic_iterator{std::move(other.first_it), std::move(other.begin_it), std::move(other.end_it)}
351 noexcept(
noexcept(std::declval<basic_iterator &>().from_index(1)))
352 requires std::random_access_iterator<underlying_iterator_type>
354 return *(*
this + index);
365 if (++second_it == end_it)
368 second_it = first_it;
376 operator++(
int )
noexcept(
noexcept(std::declval<underlying_iterator_type &>()++))
388 if (--second_it == first_it)
399 operator--(
int )
noexcept(
noexcept(std::declval<underlying_iterator_type &>()--))
400 requires std::bidirectional_iterator<underlying_iterator_type>
411 requires std::random_access_iterator<underlying_iterator_type>
413 from_index(to_index() +
offset);
420 noexcept(
noexcept(std::declval<basic_iterator &>() += 1))
421 requires std::random_access_iterator<underlying_iterator_type>
431 basic_iterator iter)
noexcept(
noexcept(std::declval<basic_iterator<range_type> &>().from_index(1)))
432 requires std::random_access_iterator<underlying_iterator_type>
442 requires std::random_access_iterator<underlying_iterator_type>
444 from_index(to_index() -
offset);
451 noexcept(
noexcept(std::declval<basic_iterator &>() -= 1))
452 requires std::random_access_iterator<underlying_iterator_type>
460 template <
typename other_range_type>
461 requires std::random_access_iterator<underlying_iterator_type>
464 noexcept(
noexcept(std::declval<basic_iterator &>().to_index()))
480 template <
typename other_range_type>
481 requires std::equality_comparable_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
484 noexcept(
noexcept(std::declval<underlying_iterator_type &>() == std::declval<underlying_iterator_type &>()))
486 return std::tie(first_it, second_it) ==
std::tie(rhs.first_it, rhs.second_it);
490 template <
typename other_range_type>
491 requires std::equality_comparable_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
494 noexcept(
noexcept(std::declval<underlying_iterator_type &>() != std::declval<underlying_iterator_type &>()))
496 return !(*
this == rhs);
500 template <
typename other_range_type>
501 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
504 noexcept(
noexcept(std::declval<underlying_iterator_type &>() < std::declval<underlying_iterator_type &>()))
506 return std::tie(first_it, second_it) <
std::tie(rhs.first_it, rhs.second_it);
510 template <
typename other_range_type>
511 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
514 noexcept(
noexcept(std::declval<underlying_iterator_type &>() > std::declval<underlying_iterator_type &>()))
517 return std::tie(first_it, second_it) >
std::tie(rhs.first_it, rhs.second_it);
521 template <
typename other_range_type>
522 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
525 noexcept(
noexcept(std::declval<underlying_iterator_type &>() <= std::declval<underlying_iterator_type &>()))
527 return std::tie(first_it, second_it) <=
std::tie(rhs.first_it, rhs.second_it);
531 template <
typename other_range_type>
532 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
535 noexcept(
noexcept(std::declval<underlying_iterator_type &>() >= std::declval<underlying_iterator_type &>()))
537 return std::tie(first_it, second_it) >=
std::tie(rhs.first_it, rhs.second_it);
558 size_t src_size = end_it - begin_it;
559 size_t index_i = first_it - begin_it;
560 size_t index_j = second_it - begin_it;
561 return (src_size * (src_size - 1) / 2) - (src_size - index_i) * ((src_size - index_i) - 1) / 2 + index_j
569 constexpr void from_index(
size_t const index)
noexcept(
noexcept(
570 std::declval<underlying_iterator_type &>()
571 - std::declval<underlying_iterator_type &>()) &&
noexcept(std::declval<underlying_iterator_type &>() + 1))
572 requires std::random_access_iterator<underlying_iterator_type>
574 size_t src_size = end_it - begin_it;
576 src_size - 2 -
std::floor(
std::sqrt(-8 * index + 4 * src_size * (src_size - 1) - 7) / 2.0 - 0.5);
578 index + index_i + 1 - src_size * (src_size - 1) / 2 + (src_size - index_i) * ((src_size - index_i) - 1) / 2;
579 first_it = begin_it + index_i;
580 second_it = begin_it + index_j;
Provides seqan3::detail::adaptor_for_view_without_args.
A std::tuple implementation that incorporates most changes from C++23's standard library.
Definition: common_tuple.hpp:31
Template for range adaptor closure objects that store no arguments and always delegate to the view co...
Definition: adaptor_for_view_without_args.hpp:49
The forward declared iterator type for pairwise_combine_view.
Definition: pairwise_combine.hpp:256
constexpr basic_iterator operator++(int) noexcept(noexcept(std::declval< underlying_iterator_type & >()++))
Post-increment operator.
Definition: pairwise_combine.hpp:376
constexpr void from_index(size_t const index) noexcept(noexcept(std::declval< underlying_iterator_type & >() - std::declval< underlying_iterator_type & >()) &&noexcept(std::declval< underlying_iterator_type & >()+1))
Sets the iterator to the given index.
Definition: pairwise_combine.hpp:569
constexpr basic_iterator & operator-=(difference_type const offset) noexcept(noexcept(std::declval< basic_iterator & >().from_index(1)))
Decrements the iterator by the given offset; underlying_iterator_type must model \ std::random_access...
Definition: pairwise_combine.hpp:441
constexpr basic_iterator & operator+=(difference_type const offset) noexcept(noexcept(std::declval< basic_iterator & >().from_index(1)))
Advances the iterator by the given offset; underlying_iterator_type must model \ std::random_access_i...
Definition: pairwise_combine.hpp:410
constexpr reference operator[](size_t const index) const noexcept(noexcept(std::declval< basic_iterator & >().from_index(1)))
Access the element at the given index.
Definition: pairwise_combine.hpp:350
constexpr reference operator*() const noexcept(noexcept(*std::declval< underlying_iterator_type >()))
Accesses the pointed-to element.
Definition: pairwise_combine.hpp:342
constexpr bool operator!=(basic_iterator< other_range_type > const &rhs) const noexcept(noexcept(std::declval< underlying_iterator_type & >() !=std::declval< underlying_iterator_type & >()))
Checks whether *this is not equal to rhs.
Definition: pairwise_combine.hpp:493
basic_iterator(basic_iterator const &)=default
Defaulted.
constexpr size_t to_index() const noexcept(noexcept(std::declval< underlying_iterator_type & >() - std::declval< underlying_iterator_type & >()))
Returns the index for the current iterator position.
Definition: pairwise_combine.hpp:554
constexpr difference_type operator-(basic_iterator< other_range_type > const &rhs) const noexcept(noexcept(std::declval< basic_iterator & >().to_index()))
Computes the distance between two iterators; underlying_iterator_type must model \ std::random_access...
Definition: pairwise_combine.hpp:463
basic_iterator()=default
Defaulted.
basic_iterator & operator=(basic_iterator const &)=default
Defaulted.
constexpr bool operator==(basic_iterator< other_range_type > const &rhs) const noexcept(noexcept(std::declval< underlying_iterator_type & >()==std::declval< underlying_iterator_type & >()))
Checks whether *this is equal to rhs.
Definition: pairwise_combine.hpp:483
constexpr friend basic_iterator operator+(difference_type const offset, basic_iterator iter) noexcept(noexcept(std::declval< basic_iterator< range_type > & >().from_index(1)))
Advances the iterator by the given offset; underlying_iterator_type must model \ std::random_access_i...
Definition: pairwise_combine.hpp:430
constexpr basic_iterator & operator++() noexcept(noexcept(++std::declval< underlying_iterator_type & >()))
Pre-increment operator.
Definition: pairwise_combine.hpp:363
void pointer
The pointer type.
Definition: pairwise_combine.hpp:286
constexpr bool operator<=(basic_iterator< other_range_type > const &rhs) const noexcept(noexcept(std::declval< underlying_iterator_type & >()<=std::declval< underlying_iterator_type & >()))
Checks whether *this is less than or equal to rhs.
Definition: pairwise_combine.hpp:524
constexpr basic_iterator(underlying_iterator_type iter, underlying_iterator_type begin_it, underlying_iterator_type end_it) noexcept
Constructs the iterator from the current underlying iterator and the end iterator of the underlying r...
Definition: pairwise_combine.hpp:313
constexpr basic_iterator operator+(difference_type const offset) const noexcept(noexcept(std::declval< basic_iterator & >()+=1))
Advances the iterator by the given offset; underlying_iterator_type must model \ std::random_access_i...
Definition: pairwise_combine.hpp:419
constexpr basic_iterator(basic_iterator< other_range_type > other) noexcept
Constructs const iterator from non-const iterator.
Definition: pairwise_combine.hpp:333
constexpr bool operator<(basic_iterator< other_range_type > const &rhs) const noexcept(noexcept(std::declval< underlying_iterator_type & >()< std::declval< underlying_iterator_type & >()))
Checks whether *this is less than rhs.
Definition: pairwise_combine.hpp:503
std::ranges::iterator_t< range_type > underlying_iterator_type
Alias type for the iterator over the passed range type.
Definition: pairwise_combine.hpp:268
constexpr basic_iterator operator-(difference_type const offset) const noexcept(noexcept(std::declval< basic_iterator & >() -=1))
Decrements the iterator by the given offset; underlying_iterator_type must model \ std::random_access...
Definition: pairwise_combine.hpp:450
constexpr bool operator>=(basic_iterator< other_range_type > const &rhs) const noexcept(noexcept(std::declval< underlying_iterator_type & >() >=std::declval< underlying_iterator_type & >()))
Checks whether *this is greater than or equal to rhs.
Definition: pairwise_combine.hpp:534
~basic_iterator()=default
Defaulted.
basic_iterator & operator=(basic_iterator &&)=default
Defaulted.
constexpr basic_iterator operator--(int) noexcept(noexcept(std::declval< underlying_iterator_type & >() --))
Post-decrement operator; underlying_iterator_type must model std::bidirectional_iterator.
Definition: pairwise_combine.hpp:399
basic_iterator(basic_iterator &&)=default
Defaulted.
constexpr basic_iterator & operator--() noexcept(noexcept(--std::declval< underlying_iterator_type & >()))
Pre-decrement operator; underlying_iterator_type must model std::bidirectional_iterator.
Definition: pairwise_combine.hpp:385
constexpr bool operator>(basic_iterator< other_range_type > const &rhs) const noexcept(noexcept(std::declval< underlying_iterator_type & >() > std::declval< underlying_iterator_type & >()))
Checks whether *this is greater than rhs.
Definition: pairwise_combine.hpp:513
Generates all pairwise combinations of the elements in the underlying range.
Definition: pairwise_combine.hpp:44
underlying_range_type u_range
The underling range.
Definition: pairwise_combine.hpp:224
pairwise_combine_view(pairwise_combine_view const &)=default
Defaulted.
constexpr pairwise_combine_view(other_range_t &&range)
Constructs from a view.
Definition: pairwise_combine.hpp:149
pairwise_combine_view(pairwise_combine_view &&)=default
Defaulted.
constexpr pairwise_combine_view(underlying_range_type range)
Constructs from a view.
Definition: pairwise_combine.hpp:88
constexpr iterator begin() noexcept
Returns an iterator to the first element of the range.
Definition: pairwise_combine.hpp:169
pairwise_combine_view()=default
Defaulted.
constexpr auto size() const noexcept
Computes the size based on the size of the underlying range.
Definition: pairwise_combine.hpp:214
transformation_trait_or_t< std::type_identity< basic_iterator< underlying_range_type const > >, void > const_iterator
The const iterator type. Evaluates to void if the underlying range is not const iterable.
Definition: pairwise_combine.hpp:58
pairwise_combine_view & operator=(pairwise_combine_view &&)=default
Defaulted.
std::ranges::iterator_t< underlying_range_type > back_iterator
The cached iterator pointing to the last element of the underlying range.
Definition: pairwise_combine.hpp:226
~pairwise_combine_view()=default
Defaulted.
constexpr const_iterator end() const noexcept
Returns an iterator to the element following the last element of the range.
Definition: pairwise_combine.hpp:200
constexpr const_iterator begin() const noexcept
Returns an iterator to the first element of the range.
Definition: pairwise_combine.hpp:175
pairwise_combine_view & operator=(pairwise_combine_view const &)=default
Defaulted.
constexpr iterator end() noexcept
Returns an iterator to the element following the last element of the range.
Definition: pairwise_combine.hpp:194
A generic random access iterator that delegates most operations to the range.
Definition: random_access_iterator.hpp:298
Provides seqan3::common_tuple.
constexpr auto all
Returns a view that includes all elements of the range argument.
Definition: all_view.hpp:204
@ offset
Sequence (seqan3::field::seq) relative start position (0-based), unsigned value.
constexpr size_t size
The size of a type pack.
Definition: traits.hpp:146
typename transformation_trait_or< type_t, default_t >::type transformation_trait_or_t
Helper type of seqan3::detail::transformation_trait_or (transformation_trait shortcut).
Definition: transformation_trait_or.hpp:51
constexpr auto pairwise_combine
A view adaptor that generates all pairwise combinations of the elements of the underlying range.
Definition: pairwise_combine.hpp:659
Specifies requirements of an input range type for which the const version of that type satisfies the ...
Provides various transformation traits for use on iterators.
The internal SeqAn3 namespace.
Definition: aligned_sequence_concept.hpp:29
pairwise_combine_view(other_range_t &&range) -> pairwise_combine_view< std::views::all_t< other_range_t > >
Deduces the correct template type from a non-view lvalue range by wrapping the range in std::views::a...
The SeqAn namespace for views.
Definition: char_strictly_to.hpp:22
SeqAn specific customisations in the standard namespace.
The <ranges> header from C++20's standard library.
Defines iterator_category member if underlying_iterator_t has a valid std::iterator_traits::iterator_...
Definition: iterator_traits.hpp:42
Additional non-standard concepts for ranges.