Espacios de nombres
Variantes
Acciones

std::min

De cppreference.com
< cpp‎ | algorithm

This page has been machine-translated from the English version of the wiki using Google Translate.

The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here.

Click here for the English version of this page

 
C++
 
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
 
Defined in header <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.

Contenido

[editar] 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. ​

Type requirements
-
T must meet the requirements of LessThanComparable. for the overloads (1) and (3)
-
T must meet the requirements of CopyConstructible. for the overloads (3) and (4)

[editar] 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.

[editar] 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.

[editar] Posible implementación

First version 
template<class T> 
const T& min(const T& a, const T& b)
{
    return (a < b) ? a : b;
}
Second version 
template<class T, class Compare> 
const T& min(const T& a, const T& b, Compare comp)
{
    return (comp(a, b)) ? a : b;
}
Third version 
template<class T>
T min( std::initializer_list<T> ilist)
{
    return *std::min_element(ilist.begin(), ilist.end());
}
Fourth version 
template<class T, class Compare>
T min(std::initializer_list<T> ilist, Compare comp)
{
    return *std::min_element(ilist.begin(), ilist.end(), comp);
}

[editar] 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';
}

Output: 

smaller of 1 and 9999: 1
smaller of 'a' and 'b': a
smaller of 3.5 and 2.5: 2.5
This section is incomplete

[editar] Ver también
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.

(función de plantilla) [edit]
(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.

(función de plantilla) [edit]
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.

(función de plantilla) [edit]
Obtenido de «http://es.cppreference.com/mwiki/index.php?title=cpp/algorithm/min&oldid=29811»