Classifies elements in a range into two disjoint sets, with those elements satisfying a unary predicate preceding those that fail to satisfy it, preserving the relative order of equivalent elements.

template<class _BidIt, class _Pr> inline  
    _BidIt stable_partition(_BidIt _First, _BidIt _Last, _Pr _Pred);  

This function behaves the same as the C++ Standard Library function stable_partition. For more information, see stable_partition.

Header: <cliext/algorithm>

Namespace: cliext

algorithm (STL/CLR)