std::partition_copy
Da 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. |
Definido no cabeçalho <algorithm> | ||
template<class InputIt, class OutputIt1, class OutputIt2, class UnaryPredicate > | (desde C++11) | |
Copia os elementos que satisfazem o predicado
p do [first, last) intervalo para o início escala em d_first_true, e copia os elementos que não satisfaçam p ao início escala em d_first_false.Original:
Copies the elements that satisfy the predicate
p from the range [first, last) to the range beginning at d_first_true, and copies the elements that do not satisfy p to the range beginning at d_first_false.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.
Índice |
[editar]Parâmetros
| first, last | - | a gama de elementos para classificar Original: the range of elements to sort The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| d_first_true | - | o início do intervalo de saída para os elementos que satisfazem p Original: the beginning of the output range for the elements that satisfy p The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| d_first_false | - | o início do intervalo de saída para os elementos que não satisfaçam p Original: the beginning of the output range for the elements that do not satisfy p The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| p | - | unary predicate which returns true se o elemento deve ser colocado em d_first_true . Original: if the element should be placed in d_first_true The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. 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. |
| Type requirements | ||
-InputIt must meet the requirements of InputIterator. | ||
-OutputIt1 must meet the requirements of OutputIterator. | ||
-OutputIt2 must meet the requirements of OutputIterator. | ||
[editar]Valor de retorno
A pair construído a partir do iterador para o fim do intervalo de
d_first_true e o iterador para o fim do intervalo de d_first_false.Original:
A pair constructed from the iterator to the end of the
d_first_true range and the iterator to the end of the d_first_false range.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.
[editar]Complexidade
Exactamente
distance(first, last) aplicações de p.Original:
Exactly
distance(first, last) applications of p.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.
[editar]Possível implementação
template<class InputIt, class OutputIt1, class OutputIt2, class UnaryPredicate>std::pair<OutputIt1, OutputIt2> partition_copy(InputIt first, InputIt last, OutputIt1 d_first_true, OutputIt2 d_first_false, UnaryPredicate p){while(first != last){if(p(*first)){*d_first_true =*first;++d_first_true;}else{*d_first_false =*first;++d_first_false;}++first;}returnstd::pair<OutputIt1, OutputIt2>(d_first_true, d_first_false);} |
[editar]Exemplo
#include <iostream>#include <algorithm>#include <utility> int main(){int arr [10]={1,2,3,4,5,6,7,8,9,10};int true_arr [5]={0};int false_arr [5]={0}; std::partition_copy(std::begin(arr), std::end(arr), std::begin(true_arr),std::begin(false_arr), [](int i){return i >5;}); std::cout<<"true_arr: ";for(auto it =std::begin(true_arr); it !=std::end(true_arr);++it){std::cout<<*it <<' ';}std::cout<<'\n'; std::cout<<"false_arr: ";for(auto it =std::begin(false_arr); it !=std::end(false_arr);++it){std::cout<<*it <<' ';}std::cout<<'\n'; return0; }
Saída:
true_arr: 6 7 8 9 10 false_arr: 1 2 3 4 5
[editar]Veja também
divide um intervalo de elementos em dois grupos Original: divides a range of elements into two groups The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (modelo de função) | |
divide os elementos em dois grupos, preservando sua ordem relativa 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. (modelo de função) | |
