std::partition

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

Algoritmo libreria

Funzioni Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Non modifica le operazioni di sequenza Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modifica delle operazioni di sequenza Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Partizionamento operazioni Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Ordinamento delle operazioni (su intervalli ordinati) Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binarie (le operazioni di ricerca sui campi ordinati) Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
Impostare le operazioni (su intervalli ordinati) Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap operazioni Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimo / massimo le operazioni Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Operazioni numeriche Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
Libreria C Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <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 );		(C fino + 11) (dal C++11)

Riordina gli elementi nel [first, last) gamma in modo tale che tutti gli elementi per cui il predicato p rendimenti true precedere gli elementi per i quali predicato p rendimenti false. Ordine relativo degli elementi non è conservato.

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.

Parametri

first, last	-	la gamma di elementi da riordinare 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	-	unary predicate which returns ​true se l'elemento deve essere ordinato prima di altri elementi 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. . 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. The type Type must be such that an object of type ForwardIt can be dereferenced and then implicitly converted to Type. ​
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

Valore di ritorno

Iteratore al primo elemento del secondo gruppo.

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.

Complessità

Esattamente last-first applicazioni del predicato e la maggior parte delle operazioni di swap last-first. Se ForwardIt soddisfa i requisiti della maggior parte delle operazioni di swap in BidirectionalIterator(last-first)/2 sono fatte.

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.

Possibile implementazione

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;}

Esempio

#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 vectorstd::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, " "));}

Possible output:

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

Vedi anche

is_partitioned (C++11)	determina se il campo è diviso dal predicato specificato 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. (funzione di modello)
stable_partition	divide gli elementi in due gruppi, mantenendo l'ordine relativo 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. (funzione di modello)