|
template<typename Cur > |
void | ranges::v3::adl_advance_detail::advance (basic_iterator< Cur > &i, difference_type_t< basic_iterator< Cur >> n) |
|
template<typename T > |
void | ranges::v3::adl_advance_detail::advance (T *&i, difference_type_t< T *> n) |
|
template<typename I > |
void | ranges::v3::adl_advance_detail::advance_impl (I &i, difference_type_t< I > n, concepts::InputIterator *) |
|
template<typename I > |
void | ranges::v3::adl_advance_detail::advance_impl (I &i, difference_type_t< I > n, concepts::BidirectionalIterator *) |
|
template<typename I > |
void | ranges::v3::adl_advance_detail::advance_impl (I &i, difference_type_t< I > n, concepts::RandomAccessIterator *) |
|
template<typename I > |
reverse_iterator< I > | ranges::v3::make_reverse_iterator (I i) |
|
template<typename I1 , typename I2 , requires = (EqualityComparable<I1, I2>())> |
bool | ranges::v3::operator!= (move_iterator< I1 > const &x, move_iterator< I2 > const &y) |
|
template<typename I , typename S , requires = (Sentinel<S, I>())> |
bool | ranges::v3::operator!= (move_iterator< S > const &i, move_sentinel< S > const &s) |
|
template<typename I , typename S , requires = (Sentinel<S, I>())> |
bool | ranges::v3::operator!= (move_sentinel< S > const &s, move_iterator< S > const &i) |
|
template<typename I , requires = (RandomAccessIterator<I>())> |
move_iterator< I > | ranges::v3::operator+ (difference_type_t< I > n, move_iterator< I > const &x) |
|
template<typename I1 , typename I2 , requires = (SizedSentinel<I1, I2>())> |
difference_type_t< I2 > | ranges::v3::operator- (move_iterator< I1 > const &x, move_iterator< I2 > const &y) |
|
template<typename I1 , typename I2 , requires = (TotallyOrdered<I1, I2>())> |
bool | ranges::v3::operator< (move_iterator< I1 > const &x, move_iterator< I2 > const &y) |
|
template<typename I1 , typename I2 , requires = (TotallyOrdered<I1, I2>())> |
bool | ranges::v3::operator<= (move_iterator< I1 > const &x, move_iterator< I2 > const &y) |
|
template<typename I1 , typename I2 , requires = (EqualityComparable<I1, I2>())> |
bool | ranges::v3::operator== (move_iterator< I1 > const &x, move_iterator< I2 > const &y) |
|
template<typename I , typename S , requires = (Sentinel<S, I>())> |
bool | ranges::v3::operator== (move_iterator< I > const &i, move_sentinel< S > const &s) |
|
template<typename I , typename S , requires = (Sentinel<S, I>())> |
bool | ranges::v3::operator== (move_sentinel< S > const &s, move_iterator< S > const &i) |
|
template<typename I1 , typename I2 , requires = (TotallyOrdered<I1, I2>())> |
bool | ranges::v3::operator> (move_iterator< I1 > const &x, move_iterator< I2 > const &y) |
|
template<typename I1 , typename I2 , requires = (TotallyOrdered<I1, I2>())> |
bool | ranges::v3::operator>= (move_iterator< I1 > const &x, move_iterator< I2 > const &y) |
|