std::is_sorted_until
From Cppreference
| Defined in header <algorithm>
|
||
| template< class ForwardIterator >
ForwardIterator is_sorted_until( ForwardIterator first, ForwardIterator last ); |
(1) | (C++11 feature) |
| template< class ForwardIterator, class Compare >
ForwardIterator is_sorted_until( ForwardIterator first, ForwardIterator last, |
(2) | (C++11 feature) |
Examines the range [first, last) and finds the largest range beginning at first in which the elements are sorted in ascending order. The first version of the function uses operator< to compare the elements, the second uses the given comparison function comp.
Contents |
[edit] Parameters
| first, last | - | the range of elements to examine | |||||||||
| comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. |
|||||||||
[edit] Return value
The upper bound of the largest range beginning at first in which the elements are sorted in ascending order. That is, the last iterator it for which range [first, it) is sorted.
[edit] Complexity
linear in the distance between first and last
[edit] Equivalent function
| First version |
|---|
template<class ForwardIterator> ForwardIterator is_sorted_until(ForwardIterator first, ForwardIterator last) { if (first != last) { ForwardIterator next = first; while (++next != last) { if (*next < *first) return next; first = next; } } return last; } |
| Second version |
template< class ForwardIterator, class Compare > ForwardIterator is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp) { if (first != last) { ForwardIterator next = first; while (++next != last) { if (comp(*next, *first)) return next; first = next; } } return last; |
[edit] Example
| This section is incomplete |
[edit] See also
|
checks whether a range is sorted into ascending order (function template) |
||