|
|
template <class BiIter, class UnPred> BiIter stable_partition(BiIter start, BiIter end, UnPred pfn);
The stable_partition( ) algorithm arranges the sequence defined by start and end such that all elements for which the predicate specified by pfn returns true come before those for which the predicate returns false. The partitioning is stable. This means that the relative ordering of the sequence is preserved. It returns an iterator to the beginning of the elements for which the predicate is false.
|
|