std::move_backward

 

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 tareas/subprocesos (C++11)

 

Algoritmo biblioteca

Funciones Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Para no modificar la secuencia de las operaciones 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
Modificación de la secuencia de operaciones 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
Particionamiento operaciones 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)
Clasificación de las operaciones (en rangos ordenados) 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
Las operaciones binarias de búsqueda (en rangos ordenados) 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
Conjunto de operaciones (en rangos ordenados) 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
Operaciones del montón 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
Mínimo / máximo de operaciones 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
Operaciones numéricas 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
C biblioteca 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 BidirIt1, class BidirIt2 > BidirIt2 move_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last );

Mueve los elementos de la [first, last) rango, a otro final rango en d_last. Los elementos se mueven en sentido inverso (del último elemento se mueve primero), pero su orden relativo se conserva .

Original:

Moves the elements from the range [first, last), to another range ending at d_last. The elements are moved in reverse order (the last element is moved first), but their relative order is preserved.

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 los elementos de moverse Original: the range of the elements to move The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
d_last	-	final del rango de destino. Si está dentro de d_last [first, last), NJ std :: move </ span> debe ser utilizado en lugar de std::move_backward . Original: end of the destination range. If d_last is within [first, last), NJ std :: move </ span> must be used instead of std::move_backward. </div> The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. </div></div></div></div>
Type requirements
- BidirIt1, BidirIt2 must meet the requirements of BidirectionalIterator.

Valor de retorno

Iterator en el rango de destino, señalando el último elemento movido .

Original:

Iterator in the destination range, pointing at the last element moved.

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

Complejidad

Exactamente last - first mover asignaciones .

Original:

Exactly last - first move assignments.

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 BidirIt1, class BidirIt2 > BidirIt2 move_backward(BidirIt1 first, BidirIt1 last, BidirIt2 d_last) { while (first != last) { *(--d_last) = std::move(*(--last)); } return d_last; }

Ver también

move (C++11)	mueve una serie de elementos a una nueva ubicación Original: moves a range of elements to a new location The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (función de plantilla)