std::partition
De cppreference.com
 [] |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody>| Dclar dans l'en-tte <algorithm>
|
||
template< class BidirIt, class UnaryPredicate > BidirectionalIterator partition( BidirIt first, BidirIt last, UnaryPredicate p ); template< class ForwardIt, class UnaryPredicate > ForwardIt partition( ForwardIt first, ForwardIt last, UnaryPredicate p ); |
(avant C++11) (depuis C++11) |
|
Rordonne les lments de la gamme
[first, last) de telle manire que tous les lments pour lesquels le prdicat renvoie p true prcdent les lments pour lesquels prdicat retourne p false. Ordre relatif des lments ne sont pas conserves . Original:
Reorders the elements in the range
[first, last) in such a way that all elements for which the predicate p returns true precede the elements for which predicate p returns false. Relative order of the elements is not preserved. The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Paramtres
| first, last | - | l'ventail d'lments rorganiser
Original: the range of elements to reorder The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| p | - | prdicat unaire qui retourne true si l'lment doit tre command avant autres lments . Original: if the element should be ordered before other elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. L'expression |
| Type requirements | ||
-BidirIt must meet the requirements of BidirectionalIterator.
| ||
-ForwardIt must meet the requirements of ValueSwappable and ForwardIterator. However, the operation is more efficient if ForwardIt also satisfies the requirements of BidirectionalIterator
| ||
Retourne la valeur
Itrateur sur le premier lment du second groupe .
Original:
Iterator to the first element of the second group.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Complexit
Exactement
last-first applications du prdicat et la plupart des swaps last-first. Si ForwardIt rpond aux exigences de la plupart des swaps BidirectionalIterator (last-first)/2 sont fait .Original:
Exactly
last-first applications of the predicate and at most last-first swaps. If ForwardIt meets the requirements of BidirectionalIterator at most (last-first)/2 swaps are done.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Mise en uvre possible
template<class BidirIt, class UnaryPredicate>
BidirIt partition(BidirIt first, BidirIt last, UnaryPredicate p)
{
while (1) {
while ((first != last) && p(*first)) {
++first;
}
if (first == last--) break;
while ((first != last) && !p(*last)) {
--last;
}
if (first == last) break;
std::swap(*first++, *last);
}
return first;
}
|
Exemple
#include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <vector>
bool is_even(int i) { return i % 2 == 0; }
int main()
{
std::vector<int> v;
for (int i = 0; i < 10; ++i) v.push_back(i);
std::cout << "Original vector:\n ";
std::copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " "));
// Partition the vector
std::vector<int>::iterator p =
std::partition(v.begin(), v.end(), std::ptr_fun(is_even));
std::cout << "\nPartitioned vector:\n ";
std::copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " "));
std::cout << "\nBefore partition:\n ";
std::copy(v.begin(), p, std::ostream_iterator<int>(std::cout, " "));
std::cout << "\nAfter partition:\n ";
std::copy(p, v.end(), std::ostream_iterator<int>(std::cout, " "));
}
Rsultat possible :
Original vector:
0 1 2 3 4 5 6 7 8 9
Partitioned vector:
0 8 2 6 4 5 3 7 1 9
Before partition:
0 8 2 6 4
After partition:
5 3 7 1 9
Voir aussi
(C++11) |
dtermine si l'intervalle est divis par le prdicat donn Original: determines if the range is partitioned by the given predicate The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) |
divise les lments en deux groupes, tout en prservant leur ordre relatif Original: divides elements into two groups while preserving their relative order The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |