std::next_permutation

 

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 > bool next_permutation( BidirIt first, BidirIt last );	(1)
template<class BidirIt, class Compare > bool next_permutation( BidirIt first, BidirIt last, Compare comp );	(2)

Trasforma il [first, last) campo nella prossima permutazione dall'insieme di tutte le permutazioni che sono classificati in ordine lessicografico rispetto al operator< o comp. true Restituisce se esiste permutazione, trasforma altrimenti il ​​campo nella prima permutazione (come per std::sort(first, last)) e ritorna false.

Original:

Transforms the range [first, last) into the next permutation from the set of all permutations that are lexicographically ordered with respect to operator< or comp. Returns true if such permutation exists, otherwise transforms the range into the first permutation (as if by std::sort(first, last)) and returns false.

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 per permutare Original: the range of elements to permute The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
comp	-	comparison function which returns ​true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:  bool cmp(const Type1 &a, const Type2 &b); The signature does not need to have const&, but the function must not modify the objects passed to it. The types Type1 and Type2 must be such that an object of type BidirIt can be dereferenced and then implicitly converted to both of them. ​
Type requirements
- BidirIt must meet the requirements of ValueSwappable and BidirectionalIterator.

Valore di ritorno

true se la permutazione nuovo lessicograficamente maggiore del vecchio. false se la permutazione ultimo è stato raggiunto e la gamma è stato reimpostato per la permutazione prima.

Original:

true if the new permutation is lexicographically greater than the old. false if the last permutation was reached and the range was reset to the first permutation.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Complessità

Alla maggior parte degli swap N/2, dove N =std::distance(first, last).

Original:

At most N/2 swaps, where N =std::distance(first, last).

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>bool next_permutation(BidirIt first, BidirIt last){if(first == last)returnfalse; BidirIt i = last;if(first ==--i)returnfalse;   while(1){ BidirIt i1, i2;   i1 = i;if(*--i <*i1){ i2 = last;while(!(*i <*--i2));std::iter_swap(i, i2);std::reverse(i1, last);returntrue;}if(i == first){std::reverse(first, last);returnfalse;}}}

Esempio

Il codice seguente consente di stampare tutte e tre le permutazioni della stringa "aba"

Original:

The following code prints all three permutations of the string "aba"

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

#include <algorithm>#include <string>#include <iostream>   int main(){std::string s ="aba";std::sort(s.begin(), s.end());do{std::cout<< s <<'\n';}while(std::next_permutation(s.begin(), s.end()));}

Output:

aab aba baa

Vedi anche

is_permutation (C++11)	determines if a sequence is a permutation of another sequence (funzione di modello)
prev_permutation	generates the next smaller lexicographic permutation of a range of elements (funzione di modello)