std::rotate

 

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 ForwardIt > void rotate( ForwardIt first, ForwardIt n_first, ForwardIt last ); template<class ForwardIt > ForwardIt rotate( ForwardIt first, ForwardIt n_first, ForwardIt last );		(C fino + 11) (dal C++11)

Swap gli elementi nel [first, last) gamma in modo tale, che il n_first elemento diventa il primo elemento della nuova gamma e n_first - 1 diventa l'ultimo elemento.

Original:

Swaps the elements in the range [first, last) in such a way, that the element n_first becomes the first element of the new range and n_first - 1 becomes the last element.

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	-	l'intervallo di elementi da ruotare Original: the range of elements to rotate The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
n_first	-	l'elemento di spostare l'inizio della nuova gamma Original: the element to move to the beginning of the new range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Type requirements
- ForwardIt must meet the requirements of ValueSwappable and ForwardIterator.
- The type of dereferenced ForwardIt must meet the requirements of MoveAssignable and MoveConstructible.

Valore di ritorno

(Nessuno) (C fino + 11)

Original:

(none) (C fino + 11)

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

L'iteratore pari a first + (last - n_first)(dal C++11)

Original:

The iterator equal to first + (last - n_first)(dal C++11)

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

Complessità

lineare la distanza tra 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.

Possibile implementazione

template<class ForwardIt>void rotate(ForwardIt first, ForwardIt n_first, ForwardIt last){ ForwardIt next = n_first;while(first != next){std::swap(*first++, *next++);if(next == last){ next = n_first;}elseif(first == n_first){ n_first = next;}}}

Esempio

std :: rotate è un elemento comune in molti algoritmi. Questo esempio dimostra insertion sort in C + +

Original:

std::rotate is a common building block in many algorithms. This example demonstrates insertion sort in C++

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

#include <vector>#include <iostream>#include <algorithm>   int main(){std::vector<int> v{2, 4, 2, 0, 5, 10, 7, 3, 7, 1};   std::cout<<"before sort: ";for(int n: v)std::cout<< n <<' ';std::cout<<'\n';   // insertion sortfor(auto i = v.begin(); i != v.end();++i){ std::rotate(std::upper_bound(v.begin(), i, *i), i, i+1);}   std::cout<<"after sort: ";for(int n: v)std::cout<< n <<' ';std::cout<<'\n';   // simple rotation to the left std::rotate(v.begin(), v.begin()+1, v.end());   std::cout<<"simple rotate left  : ";for(int n: v)std::cout<< n <<' ';std::cout<<'\n';   // simple rotation to the right std::rotate(v.rbegin(), v.rbegin()+1, v.rend());   std::cout<<"simple rotate right : ";for(int n: v)std::cout<< n <<' ';std::cout<<'\n';   }

Output:

before sort: 2 4 2 0 5 10 7 3 7 1 after sort: 0 1 2 2 3 4 5 7 7 10 simple rotate left : 1 2 2 3 4 5 7 7 10 0 simple rotate right: 0 1 2 2 3 4 5 7 7 10

Vedi anche

rotate_copy	copie e ruotare una serie di elementi Original: copies and rotate a range of elements 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)