std::swap_ranges - cppreference.com
De cppreference.com
<metanoindex/>
<tbody> </tbody>
| Definido no cabeçalho <algorithm> |
||
|
|
||
Trocas elementos entre [first1, last1) gama e uma outra gama a partir de first2.
Original:
Exchanges elements between range [first1, last1) and another range starting at first2.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Parâmetros
| first1, last1 | - | a primeira gama de elementos para trocar Original: the first range of elements to swap The text has been machine-translated via Google Translate. |
| first2 | - | início da segunda gama de elementos para trocar Original: beginning of the second range of elements to swap The text has been machine-translated via Google Translate. |
| Type requirements | ||
-ForwardIt1, ForwardIt2 must meet the requirements of ForwardIterator.
| ||
-The types of dereferenced ForwardIt1 and ForwardIt2 must meet the requirements of Swappable
| ||
Valor de retorno
Iterador para o elemento passado o último elemento trocado no início gama com first2.
Original:
Iterator to the element past the last element exchanged in the range beginning with first2.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Possível implementação
template<class ForwardIt1, class ForwardIt2> ForwardIt1 swap_ranges(ForwardIt1 first1, ForwardIt1 last1, ForwardIt2 first2) { while (first1 != last1) { std::iter_swap(first1++, first2++); } return first2; }
Exemplo
Demonstra troca de subfaixas de diferentes recipientes
Original:
Demonstrates swapping of subranges from different containers
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 <list> #include <vector> #include <iostream> int main() { std::vector<int> v = {1, 2, 3, 4, 5}; std::list<int> l = {-1, -2, -3, -4, -5}; std::swap_ranges(v.begin(), v.begin()+3, l.begin()); for(int n : v) std::cout << n << ' '; std::cout << '\n'; for(int n : l) std::cout << n << ' '; std::cout << '\n'; }
Saída:
Complexidade
linear, em que a distância entre first e last
Original:
linear in the distance between first and last
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Veja também
troca os elementos apontado por dois iteradores Original: swaps the elements pointed to by two iterators The text has been machine-translated via Google Translate. (modelo de função) [edit] | |
troca os valores dos dois objetos Original: swaps the values of two objects The text has been machine-translated via Google Translate. (modelo de função) [edit] | |