|
|
template<typename I , requires = (RandomAccessIterator<I>())> |
| static void | advance (I &it, iterator_difference_t< I > n) |
| |
|
template<typename I , requires = (SizedSentinel<I, I>())> |
| static iterator_difference_t< I > | distance_to (I const &it0, I const &it1) |
| |
|
template<typename I , typename S , requires = (Sentinel<S, I>())> |
| static constexpr bool | empty (I const &it, S const &end) |
| |
|
template<typename I , requires = (EqualityComparable<I>())> |
| static bool | equal (I const &it0, I const &it1) |
| |
|
template<typename I , requires = (Iterator<I>())> |
| static iterator_reference_t< I > | get (I const &it, detail::adaptor_base_current_mem_fn={}) noexcept(noexcept(iterator_reference_t< I >(*it))) |
| |
|
template<typename I , requires = (Iterator<I>())> |
| static void | next (I &it) |
| |
|
template<typename I , requires = (BidirectionalIterator<I>())> |
| static void | prev (I &it) |
| |