Template Function thrust::partition_point(ForwardIterator, ForwardIterator, Predicate)¶
Function Documentation¶
-
template<typename
ForwardIterator
, typenamePredicate
>
ForwardIteratorthrust
::
partition_point
(ForwardIterator first, ForwardIterator last, Predicate pred) partition_point
returns an iterator pointing to the end of the true partition of a partitioned range.partition_point
requires the input range[first,last)
to be a partition; that is, all elements which satisfypred
shall appear before those that do not.#include <thrust/partition.h> struct is_even { __host__ __device__ bool operator()(const int &x) { return (x % 2) == 0; } }; ... int A[] = {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}; int * B = thrust::partition_point(A, A + 10, is_even()); // B - A is 5 // [A, B) contains only even values
- Return
An iterator
mid
such thatall_of(first, mid, pred)
andnone_of(mid, last, pred)
are both true.- Pre
The range
[first, last)
shall be partitioned bypred
.- Note
Though similar,
partition_point
is not redundant withfind_if_not
.partition_point's
precondition provides an opportunity for a faster implemention.- Parameters
first
: The beginning of the range to consider.last
: The end of the range to consider.pred
: A function object which decides to which partition each element of the range[first, last)
belongs.
- Template Parameters
ForwardIterator
: is a model of Forward Iterator, andForwardIterator's
value_type
is convertible toPredicate's
argument_type
.Predicate
: is a model of Predicate.
- See
partition
- See
find_if_not