std::rotate_copy

 

C++

Lenguaje

Cabeceras

Conceptos

Biblioteca de utilidades

Biblioteca de cadenas

Biblioteca de contenedores

Biblioteca de algoritmos

Biblioteca de iteradores

Biblioteca numérica

Biblioteca de entrada/salida

Biblioteca de localización

Biblioteca de expresiones regulares (C++11)

Biblioteca de operaciones atómicas (C++11)

Biblioteca de hilos/subprocesos (C++11)

 

Biblioteca de algoritmos

Políticas de ejecución (C++17)
is_execution_policy	execution::seqexecution::parexecution::par_unseq	execution::sequenced_policyexecution::parallel_policyexecution::parallel_unsequenced_policy
Operaciones no modificadoras de secuencia
all_ofany_ofnone_of (C++11)(C++11)(C++11) for_each for_each_n (C++17)	countcount_if mismatch equal adjacent_find	findfind_iffind_if_not (C++11) find_end find_first_of	search search_n lexicographical_compare lexicographical_compare_3way (C++20)
Operaciones modificadoras de secuencia
copycopy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) transform	fill fill_n generate generate_n swap iter_swap swap_ranges sample (C++17)	removeremove_if replacereplace_if reverse rotate unique random_shuffle (hasta C++17)	remove_copyremove_copy_if replace_copyreplace_copy_if reverse_copy rotate_copy unique_copy shuffle (C++11)
Operaciones en almacenamiento no inicializado
uninitialized_copy uninitialized_move (C++17)	uninitialized_copy_n (C++11) uninitialized_move_n (C++17)	uninitialized_fill	uninitialized_fill_n
Operaciones de partición
is_partitioned (C++11) partition_point (C++11)	partition partition_copy (C++11)	stable_partition
Operaciones de ordenación
is_sorted (C++11) is_sorted_until (C++11)	sort stable_sort	partial_sort partial_sort_copy	nth_element
Operaciones de búsqueda binaria
lower_bound	upper_bound	binary_search	equal_range
Operaciones de set (en rangos ordenados)
merge inplace_merge	set_difference set_intersection	set_symmetric_difference set_union	includes
Operaciones de pila
is_heap (C++11) is_heap_until (C++11)	make_heap sort_heap	push_heap pop_heap
Operaciones minimo/maximo
max max_element	min min_element	minmax (C++11) minmax_element (C++11)	clamp (C++17) compare_3way (C++20)
Permutaciones
is_permutation (C++11)	next_permutation	prev_permutation
Operaciones numéricas
iota (C++11) inner_product adjacent_difference	accumulate reduce (C++17) transform_reduce (C++17)	partial_sum inclusive_scan (C++17) exclusive_scan (C++17)	transform_inclusive_scan (C++17) transform_exclusive_scan (C++17)
Bibliotecas C
qsort	bsearch

 

Definido en la cabecera <algorithm>
template< class ForwardIt, class OutputIt > OutputIt rotate_copy( ForwardIt first, ForwardIt n_first,                       ForwardIt last, OutputIt d_first );

Copia los elementos de la [first, last) rango, a otro principio rango en d_first de tal manera, que el elemento n_first se convierte en el primer elemento de la nueva gama n_first - 1 y se convierte en el último elemento .

Original:

Copies the elements from the range [first, last), to another range beginning at d_first 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.

Parámetros

first, last	-	la gama de elementos a copiar Original: the range of elements to copy The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
n_first	-	el elemento se mueva hasta el principio de la nueva gama 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.
d_first	-	inicio del rango de destino Original: beginning of the destination range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Requerimientos de tipo
- ForwardIt debe reunir los requerimientos de ForwardIterator.
- OutputIt debe reunir los requerimientos de OutputIterator.

Valor de retorno

salida iterador al elemento más allá del último elemento copiado .

Original:

Output iterator to the element past the last element copied.

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

Posible implementación

template<class ForwardIt, class OutputIt> OutputIt rotate_copy(ForwardIt first, ForwardIt n_first, ForwardIt last, OutputIt d_first) { d_first = std::copy(n_first, last, d_first); return std::copy(first, n_first, d_first); }

Complejidad

lineal en la distancia entre first y 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.

Ver también

rotate

gira el orden de los elementos en un rango Original: rotates the order of elements in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (plantilla de función)