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 constexpr auto size() const noexcept
212 requires
std::ranges::sized_range<underlying_range_type>
231template <std::ranges::viewable_range other_range_t>
248template <std::ranges::view underlying_range_type>
249 requires std::ranges::forward_range<underlying_range_type> && std::ranges::common_range<underlying_range_type>
250template <
typename range_type>
256 template <
typename other_range_type>
309 second_it{std::ranges::next(iter, 1, end_it)},
322 template <
typename other_range_type>
323 requires std::convertible_to<other_range_type, range_type &>
326 basic_iterator{std::move(other.first_it), std::move(other.begin_it), std::move(other.end_it)}
343 noexcept(
noexcept(std::declval<basic_iterator &>().from_index(1)))
344 requires std::random_access_iterator<underlying_iterator_type>
346 return *(*
this + index);
357 if (++second_it == end_it)
360 second_it = first_it;
368 operator++(
int )
noexcept(
noexcept(std::declval<underlying_iterator_type &>()++))
380 if (--second_it == first_it)
391 operator--(
int )
noexcept(
noexcept(std::declval<underlying_iterator_type &>()--))
392 requires std::bidirectional_iterator<underlying_iterator_type>
403 requires std::random_access_iterator<underlying_iterator_type>
405 from_index(to_index() +
offset);
412 noexcept(
noexcept(std::declval<basic_iterator &>() += 1))
413 requires std::random_access_iterator<underlying_iterator_type>
423 basic_iterator iter)
noexcept(
noexcept(std::declval<basic_iterator<range_type> &>().from_index(1)))
424 requires std::random_access_iterator<underlying_iterator_type>
434 requires std::random_access_iterator<underlying_iterator_type>
436 from_index(to_index() -
offset);
443 noexcept(
noexcept(std::declval<basic_iterator &>() -= 1))
444 requires std::random_access_iterator<underlying_iterator_type>
452 template <
typename other_range_type>
453 requires std::random_access_iterator<underlying_iterator_type>
456 noexcept(
noexcept(std::declval<basic_iterator &>().to_index()))
472 template <
typename other_range_type>
473 requires std::equality_comparable_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
476 noexcept(
noexcept(std::declval<underlying_iterator_type &>() == std::declval<underlying_iterator_type &>()))
478 return std::tie(first_it, second_it) ==
std::tie(rhs.first_it, rhs.second_it);
482 template <
typename other_range_type>
483 requires std::equality_comparable_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
486 noexcept(
noexcept(std::declval<underlying_iterator_type &>() != std::declval<underlying_iterator_type &>()))
488 return !(*
this == rhs);
492 template <
typename other_range_type>
493 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
496 noexcept(
noexcept(std::declval<underlying_iterator_type &>() < std::declval<underlying_iterator_type &>()))
498 return std::tie(first_it, second_it) <
std::tie(rhs.first_it, rhs.second_it);
502 template <
typename other_range_type>
503 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
506 noexcept(
noexcept(std::declval<underlying_iterator_type &>() > std::declval<underlying_iterator_type &>()))
509 return std::tie(first_it, second_it) >
std::tie(rhs.first_it, rhs.second_it);
513 template <
typename other_range_type>
514 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
517 noexcept(
noexcept(std::declval<underlying_iterator_type &>() <= std::declval<underlying_iterator_type &>()))
519 return std::tie(first_it, second_it) <=
std::tie(rhs.first_it, rhs.second_it);
523 template <
typename other_range_type>
524 requires std::totally_ordered_with<underlying_iterator_type, std::ranges::iterator_t<other_range_type>>
527 noexcept(
noexcept(std::declval<underlying_iterator_type &>() >= std::declval<underlying_iterator_type &>()))
529 return std::tie(first_it, second_it) >=
std::tie(rhs.first_it, rhs.second_it);
550 size_t src_size = end_it - begin_it;
551 size_t index_i = first_it - begin_it;
552 size_t index_j = second_it - begin_it;
553 return (src_size * (src_size - 1) / 2) - (src_size - index_i) * ((src_size - index_i) - 1) / 2 + index_j
561 constexpr void from_index(
size_t const index)
noexcept(
noexcept(
562 std::declval<underlying_iterator_type &>()
563 - std::declval<underlying_iterator_type &>()) &&
noexcept(std::declval<underlying_iterator_type &>() + 1))
564 requires std::random_access_iterator<underlying_iterator_type>
566 size_t src_size = end_it - begin_it;
568 src_size - 2 -
std::floor(
std::sqrt(-8 * index + 4 * src_size * (src_size - 1) - 7) / 2.0 - 0.5);
570 index + index_i + 1 - src_size * (src_size - 1) / 2 + (src_size - index_i) * ((src_size - index_i) - 1) / 2;
571 first_it = begin_it + index_i;
572 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:29
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:253
constexpr basic_iterator operator++(int) noexcept(noexcept(std::declval< underlying_iterator_type & >()++))
Post-increment operator.
Definition: pairwise_combine.hpp:368
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:561
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:433
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:402
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:342
constexpr reference operator*() const noexcept(noexcept(*std::declval< underlying_iterator_type >()))
Accesses the pointed-to element.
Definition: pairwise_combine.hpp:334
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:485
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:546
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:455
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:475
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:422
constexpr basic_iterator & operator++() noexcept(noexcept(++std::declval< underlying_iterator_type & >()))
Pre-increment operator.
Definition: pairwise_combine.hpp:355
void pointer
The pointer type.
Definition: pairwise_combine.hpp:278
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:516
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:305
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:411
constexpr basic_iterator(basic_iterator< other_range_type > other) noexcept
Constructs const iterator from non-const iterator.
Definition: pairwise_combine.hpp:325
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:495
std::ranges::iterator_t< range_type > underlying_iterator_type
Alias type for the iterator over the passed range type.
Definition: pairwise_combine.hpp:260
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:442
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:526
~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:391
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:377
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:505
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:221
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:211
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:223
~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:291
Provides seqan3::common_tuple.
@ offset
Sequence (seqan3::field::seq) relative start position (0-based), unsigned value.
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:651
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
The SeqAn namespace for views.
Definition: char_strictly_to.hpp:22
SeqAn specific customisations in the standard namespace.
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.