Defined in header
template< class BidirIt, class UnaryPredicate >
BidirIt stable_partition( BidirIt first, BidirIt last, UnaryPredicate p );
template< class ExecutionPolicy, class BidirIt, class UnaryPredicate >
BidirIt stable_partition( ExecutionPolicy&& policy, BidirIt first, BidirIt last, UnaryPredicate p );
[first, last)in such a way that all elements for which the predicate
preturns true precede the elements for which predicate
preturns false. Relative order of the elements is preserved.
policy. This overload only participates in overload resolution if std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true.
|first, last||-||the range of elements to reorder|
|policy||-||the execution policy to use. See execution policy for details.|
|p||-|| unary predicate which returns true if the element should be ordered before other elements. |
The signature of the predicate function should be equivalent to the following:
bool pred(const Type &a);
The signature does not need to have const &, but the function must not modify the objects passed to it.
| -The type of dereferenced |
Iterator to the first element of the second group
N = last - first
Napplications of the predicate and
O(N)swaps if there is enough extra memory. If memory is insufficient, at most
N log Nswaps.
O(N log N)swaps and
O(N)applications of the predicate
The overload with a template parameter named
ExecutionPolicy reports errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and
ExecutionPolicyis one of the three standard policies, std::terminate is called. For any other
ExecutionPolicy, the behavior is implementation-defined.
- If the algorithm fails to allocate memory, std::bad_alloc is thrown.
This function attempts to allocate a temporary buffer. If the allocation fails, the less efficient algorithm is chosen.
3 2 4 5 7 0 0 0 0
| divides a range of elements into two groups |