43 template <
typename type>
45 std::ranges::input_range<std::remove_const_t<type>> &&
46 std::ranges::input_range<type const> &&
47 (std::ranges::forward_range<std::remove_const_t<type>> == std::ranges::forward_range<type const>) &&
49 (std::ranges::random_access_range<std::remove_const_t<type>> == std::ranges::random_access_range<type const>);
84 template <
typename iterator_t>
86 std::forward_iterator<iterator_t> &&
89 std::totally_ordered<iterator_t> &&
90 std::sized_sentinel_for<iterator_t, iterator_t> &&
91 requires (iterator_t i, iterator_t
const j, std::iter_difference_t<iterator_t>
const n)
93 std::same_as<decltype( i += n ), iterator_t &>;
94 std::same_as<decltype( j + n ), iterator_t>;
95 std::same_as<decltype( n + j ), iterator_t>;
96 std::same_as<decltype( --i ), iterator_t &>;
97 std::same_as<decltype( i-- ), iterator_t>;
98 std::same_as<decltype( i -= n ), iterator_t &>;
99 std::same_as<decltype( j - n ), iterator_t>;
100 std::same_as<decltype( j[n] ), std::iter_reference_t<iterator_t>>;
120 template <
typename rng_t>
122 std::ranges::forward_range<rng_t> &&
Specifies requirements of an input range type for which the const version of that type satisfies the ...
This concept checks if an iterator type models pseudo random access.
This concept checks if a type models a pseudo random access range.
The main SeqAn3 namespace.
Definition: aligned_sequence_concept.hpp:29
The <ranges> header from C++20's standard library.