std::is_sorted_until

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class ForwardIterator >
ForwardIterator is_sorted_until( ForwardIterator first, ForwardIterator last );

</td>

<td > (1) </td> <td > Template:mark c++0x feature </td> </tr> <tr class="t-dcl ">

<td >

template< class ForwardIterator, class Compare >

ForwardIterator is_sorted_until( ForwardIterator first, ForwardIterator last,

                                 Compare comp );

</td>

<td > (2) </td> <td > Template:mark c++0x feature </td> </tr> Template:ddcl list end

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 Template:cpp to compare the elements, the second uses the given comparison function comp.

first, last	-	the range of elements to examine
comp	-	comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following: bool cmp(const Type1& a, const Type2& b); While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)). The types Type1 and Type2 must be such that an object of type ForwardIterator can be dereferenced and then implicitly converted to both of them.

The upper bound of the largest range beginning at first in which the elements are sorted in ascending order. That is, the last iterator {{tt|it}] for which range [first, it) is sorted.

linear in the distance between first and last

Template:example cpp Template:cpp/algorithm/dcl list is sorted