std::min

 

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 T > const T& min(const T& a, const T& b );	(1)
template<class T, class Compare > const T& min(const T& a, const T& b, Compare comp );	(2)
template<class T > T min(std::initializer_list<T> ilist);	(3)	(desde C++11)
template<class T, class Compare > T min(std::initializer_list<T> ilist, Compare comp );	(4)	(desde C++11)

1-2)

Devuelve el menor de los dos valores .

Original:

Returns the smaller of the two values.

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

3-4)

Devuelve el más pequeño de los valores en ilist inicializador lista .

Original:

Returns the smallest of the values in initializer list ilist.

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

Las versiones (1,3) operator< utilizar para comparar los valores, las versiones (2,4) utilizar la función de comparación dado comp .

Original:

The (1,3) versions use operator< to compare the values, the (2,4) versions use the given comparison function comp.

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

Parámetros

a, b	-	los valores para comparar Original: the values to compare The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
ilist	-	inicializador lista con los valores a comparar Original: initializer list with the values to compare The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
cmp	-	comparison function which returns ​true if if a is less than b. The signature of the comparison function should be equivalent to the following:  bool cmp(const Type1 &a, const Type2 &b); The signature does not need to have const&, but the function must not modify the objects passed to it. The types Type1 and Type2 must be such that an object of type T can be implicitly converted to both of them. ​
Requerimientos de tipo
- T debe reunir los requerimientos de LessThanComparable. for the overloads (1) and (3)
- T debe reunir los requerimientos de CopyConstructible. for the overloads (3) and (4)

Valor de retorno

1-2)

El más pequeño de a y b. Si los valores son equivalentes, vuelve a .

Original:

The smaller of a and b. If the values are equivalent, returns a.

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

3-4)

El valor más pequeño en ilist. Si varios valores son equivalentes a los más pequeños, devuelve el valor de tal extremo izquierdo .

Original:

The smallest value in ilist. If several values are equivalent to the smallest, returns the leftmost such value.

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

Complejidad

1-2)

Constant

Original:

Constant

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

3-4)

Lineal en ilist.size()

Original:

Linear in ilist.size()

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

Primera versión
template<class T>const T& min(const T& a, const T& b){return(a < b)? a : b;}
Segunda versión
template<class T, class Compare>const T& min(const T& a, const T& b, Compare comp){return(comp(a, b))? a : b;}
Tercera versión
template<class T> T min(std::initializer_list<T> ilist){return*std::min_element(ilist.begin(), ilist.end());}
Cuarta versión
template<class T, class Compare> T min(std::initializer_list<T> ilist, Compare comp){return*std::min_element(ilist.begin(), ilist.end(), comp);}

Ejemplo

#include <algorithm>#include <iostream>   int main(){std::cout<<"smaller of 1 and 9999: "<< std::min(1, 9999)<<'\n';std::cout<<"smaller of 'a' and 'b': "<< std::min('a', 'b')<<'\n';std::cout<<"smaller of 3.5 and 2.5: "<< std::min(3.5, 2.5)<<'\n';}

Salida:

smaller of 1 and 9999: 1 smaller of 'a' and 'b': a smaller of 3.5 and 2.5: 2.5

Ver también

max	devuelve el mayor de los dos elementos Original: returns the larger of two elements 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)
minmax (C++11)	devuelve el. más grande y el más pequeño de los dos elementos Original: returns the larger and the smaller of two elements 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)
min_element	devuelve el elemento más pequeño de un rango Original: returns the smallest element 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)