| title |
partition (STL/CLR) | Microsoft Docs |
| ms.custom |
|
| ms.date |
11/04/2016 |
| ms.reviewer |
|
| ms.suite |
|
| ms.technology |
|
| ms.tgt_pltfrm |
|
| ms.topic |
reference |
| f1_keywords |
|
| dev_langs |
|
| helpviewer_keywords |
partition function [STL/CLR] |
|
| ms.assetid |
3f551eb3-31ec-4b1d-b585-07718d6a1bd7 |
| caps.latest.revision |
4 |
| author |
mikeblome |
| ms.author |
mblome |
| manager |
ghogen |
Classifies elements in a range into two disjoint sets, with those elements satisfying a unary predicate preceding those that fail to satisfy it.
template<class _BidIt, class _Pr> inline
_BidIt partition(_BidIt _First, _BidIt _Last, _Pr _Pred);
Remarks
This function behaves the same as the C++ Standard Library function partition. For more information, see partition.
Header: <cliext/algorithm>
Namespace: cliext
algorithm (STL/CLR)