std::reverse

 

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 BidirIt > void reverse( BidirIt first, BidirIt last );

Invierte el orden de los elementos en el rango [first, last) .

Original:

Reverses the order of the elements in the range [first, last).

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	-	el intervalo de elementos de revertir Original: the range of elements to reverse 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
- BidirIt debe reunir los requerimientos de BidirectionalIterator.
- The type of dereferenced BidirIt must meet the requirements of Swappable.

Valor de retorno

(Ninguno)

Original:

(none)

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 BidirIt>void reverse(BidirIt first, BidirIt last){while((first != last)&&(first !=--last)){std::swap(*first++, *last);}}

Ejemplo

#include <vector>#include <iostream>#include <algorithm>   int main(int argc, char** argv){std::vector<int> v({1,2,3}); std::reverse(std::begin(v), std::end(v));std::cout<< v[0]<< v[1]<< v[2]<<'\n';   int a[]={4, 5, 6, 7}; std::reverse(&a[0], &a[4]);std::cout<< a[0]<< a[1]<< a[2]<< a[3]<<'\n';}

Salida:

321 7654

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

reverse_copy

crea una copia de un rango que se invierte Original: creates a copy of a range that is reversed 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)