|
template<typename I , typename S , typename R = less, typename P = identity> |
requires forward_iterator< I > &&sentinel_for< S, I > &&indirect_strict_weak_order< R, projected< I, P > > I | ranges::is_sorted_until (I first, S last, R pred=R{}, P proj=P{}) |
| template function is_sorted_until More...
|
|
template<typename Rng , typename R = less, typename P = identity> |
requires forward_range< Rng > &&indirect_strict_weak_order< R, projected< iterator_t< Rng >, P > > borrowed_iterator_t< Rng > | ranges::is_sorted_until (Rng &&rng, R pred=R{}, P proj=P{}) |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|