Range-v3
Range algorithms, views, and actions for the Standard Library
ranges::v3::is_sorted_until_fn Struct Reference

Public Member Functions

template<typename I , typename S , typename R = ordered_less, typename P = ident, requires = (ForwardIterator<I>() && Sentinel<S, I>() && IndirectRelation<R, projected<I, P>>())>
operator() (I begin, S end, R pred=R{}, P proj=P{}) const
 template function is_sorted_until_fn::operator() More...
 
template<typename Rng , typename R = ordered_less, typename P = ident, typename I = iterator_t<Rng>, requires = (ForwardRange<Rng>() && IndirectRelation<R, projected<I, P>>())>
safe_iterator_t< Rng > operator() (Rng &&rng, R pred=R{}, P proj=P{}) const
 

Member Function Documentation

◆ operator()()

template<typename I , typename S , typename R = ordered_less, typename P = ident, requires = (ForwardIterator<I>() && Sentinel<S, I>() && IndirectRelation<R, projected<I, P>>())>
I ranges::v3::is_sorted_until_fn::operator() ( begin,
end,
pred = R{},
proj = P{} 
) const

template function is_sorted_until_fn::operator()

range-based version of the is_sorted_until std algorithm

Works on ForwardRanges

Precondition
Rng is a model of the ForwardRange concept
I is a model of the ForwardIterator concept
S and I model the Sentinel<S, I> concept
R and projected<I, P> model the IndirectRelation<R, projected<I, P>> concept

References ranges::v3::begin.