thrust

◆ is_sorted_until() [2/4]

template<typename ForwardIterator >
ForwardIterator thrust::is_sorted_until ( ForwardIterator  first,
ForwardIterator  last 
)

This version of is_sorted_until returns the last iterator i in [first,last] for which the range [first,last) is sorted using operator<. If distance(first,last) < 2, is_sorted_until simply returns last.

Parameters
firstThe beginning of the range of interest.
lastThe end of the range of interest.
Returns
The last iterator in the input range for which it is sorted.
Template Parameters
ForwardIteratoris a model of Forward Iterator and ForwardIterator's value_type is a model of LessThan Comparable.

The following code snippet demonstrates how to use is_sorted_until to find the first position in an array where the data becomes unsorted:

#include <thrust/sort.h>
...
int A[8] = {0, 1, 2, 3, 0, 1, 2, 3};
int * B = thrust::is_sorted_until(A, A + 8);
// B - A is 4
// [A, B) is sorted
See also
is_sorted
sort
sort_by_key
stable_sort
stable_sort_by_key