std::prev_permutation
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 BidirIt > bool prev_permutation( BidirIt first, BidirIt last); |
(1) | |
| template< class BidirIt, class Compare > bool prev_permutation( BidirIt first, BidirIt last, Compare comp); |
(2) | |
Transforma o
[first, last) intervalo na permutação anterior a partir do conjunto de todas as permutações que são lexicographically ordenadas em relação a operator< ou comp. Retorna true se existe tal permutação, caso contrário, transforma o intervalo na última permutação (como se por std::sort(first, last); std::reverse(first, last);) e retorna false.Original:
Transforms the range
[first, last) into the previous 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 last permutation (as if by std::sort(first, last); std::reverse(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.
You can help to correct and verify the translation. Click here for instructions.
Índice |
[editar] Parâmetros
| first, last | - | a gama de elementos para permutar
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. |
| Type requirements | ||
-BidirIt must meet the requirements of ValueSwappable and BidirectionalIterator.
| ||
[editar] Valor de retorno
true se a permutação nova precede a idade em lexicográfico ordem. false se a permutação primeiro foi alcançado ea gama foi redefinido para a permutação passado.
Original:
true if the new permutation precedes the old in lexicographical order. false if the first permutation was reached and the range was reset to the last permutation.
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
Na maioria dos swaps
(last-first)/2.Original:
At most
(last-first)/2 swaps.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 BidirIt> bool prev_permutation(BidirIt first, BidirIt last) { if (first == last) return false; BidirIt i = last; if (first == --i) return false; while (1) { BidirIt i1, i2; i1 = i; if (*i1 < *--i) { i2 = last; while (!(*--i2 < *i)) ; std::iter_swap(i, i2); std::reverse(i1, last); return true; } if (i == first) { std::reverse(first, last); return false; } } } |
[editar] Exemplo
O código a seguir imprime todas as seis permutações da cadeia "ABC" em ordem inversa
Original:
The following code prints all six permutations of the string "abc" in reverse order
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.
#include <algorithm> #include <string> #include <iostream> #include <functional> int main() { std::string s="abc"; std::sort(s.begin(), s.end(), std::greater<char>()); do { std::cout << s << ' '; } while(std::prev_permutation(s.begin(), s.end())); std::cout << '\n'; }
Saída:
cba cab bca bac acb abc
[editar] Veja também
| (C++11) |
determines if a sequence is a permutation of another sequence (modelo de função) |
| prev_permutation |
generates the next smaller lexicographic permutation of a range of elements (modelo de função) |
