std::minmax
De cppreference.com
 [] |
Esta pgina se ha traducido por ordenador/computador/computadora de la versin en ingls de la Wiki usando Google Translate.
La traduccin puede contener errores y palabras aparatosas/incorrectas. Planea sobre el texto para ver la versin original. Puedes ayudar a corregir los errores y mejorar la traduccin. Para instrucciones haz clic aqu. |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
| Definido en el archivo de encabezado <algorithm>
|
||
template< class T >
std::pair<const T&,const T&> minmax( const T& a, const T& b );
|
(1) | (desde C++11) |
template< class T, class Compare >
std::pair<const T&,const T&> minmax( const T& a, const T& b, Compare comp );
|
(2) | (desde C++11) |
template< class T >
std::pair<T,T> minmax( std::initializer_list<T> ilist);
|
(3) | (desde C++11) |
template< class T, class Compare >
std::pair<T,T> minmax( std::initializer_list<T> ilist, Compare comp );
|
(4) | (desde C++11) |
1-2)
Devuelve el menor y el mayor de los dos valores .
Original:
Returns the smaller and the greater 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.
You can help to correct and verify the translation. Click here for instructions.
3-4)
Devuelve la lista ms pequeo y el ms grande de los valores en el inicializador
ilist .Original:
Returns the smallest and the greatest 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.
You can help to correct and verify the translation. Click here for instructions.
Las versiones (1,3)
operator< utilizar para comparar los valores, mientras que las versiones (2,4) utilizar la funcin de comparacin dado comp .Original:
The (1,3) versions use
operator< to compare the values, whereas 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.
You can help to correct and verify the translation. Click here for instructions.
Parmetros
| 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. |
| comp | - | objeto funcin de comparacin (es decir, un objeto que satisface los requerimientos de Compare) que devuelve true si if a is less than b. La signatura de la funcin de comparacin deber ser equivalente a lo siguiente:
Mientras que la signatura no necesita ser |
| Requisitos 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)
Devuelve el resultado de
std::make_pair(a, b) si a<b o si a es equivalente a b. Devuelve el resultado de std::make_pair(b, a) si b<a .Original:
Returns the result of
std::make_pair(a, b) if a<b or if a is equivalent to b. Returns the result of std::make_pair(b, a) if b<a.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
3-4)
Un par con el valor ms pequeo en
ilist como el primer elemento y el ms grande como el segundo. Si varios elementos son equivalentes a los ms pequeos, el elemento tal extremo izquierdo se devuelve. Si varios elementos son equivalentes a la ms grande, el elemento ms a la derecha como se devuelve .Original:
A pair with the smallest value in
ilist as the first element and the greatest as the second. If several elements are equivalent to the smallest, the leftmost such element is returned. If several elements are equivalent to the largest, the rightmost such element is returned.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
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.
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.
You can help to correct and verify the translation. Click here for instructions.
Posible implementacin
| Primera versin |
|---|
template<class T>
std::pair<const T&,const T&> minmax(const T& a, const T& b)
{
return (b < a) ? std::make_pair(b, a)
: std::make_pair(a, b);
}
|
| Segunda versin |
template<class T, class Compare>
std::pair<const T&,const T&> minmax(const T& a, const T& b, Compare comp)
{
return comp(b, a) ? std::make_pair(b, a)
: std::make_pair(a, b);
}
|
| Tercera versin |
template< class T >
std::pair<T,T> minmax( std::initializer_list ilist)
{
auto p = std::minmax_element(ilist.begin(), ilist.end());
return std::make_pair(*p.first, *p.second);
}
|
| Cuarta versin |
template< class T, class Compare >
std::pair<T,T> minmax( std::initializer_list ilist, Compare comp )
{
auto p = std::minmax_element(ilist.begin(), ilist.end(), comp);
return std::make_pair(*p.first, *p.second);
}
|
Ejemplo
Ejecuta este cdigo
#include <algorithm>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
int main()
{
std::vector<int> v {3, 1, 4, 1, 5, 9, 2, 6};
std::srand(std::time(0));
std::pair<int,int> bounds = std::minmax(std::rand() % v.size(),
std::rand() % v.size());
std::cout << "v[" << bounds.first << "," << bounds.second << "]: ";
for (int i = bounds.first; i < bounds.second; ++i) {
std::cout << v[i] << ' ';
}
std::cout << '\n';
}
Posible salida:
v[2,7]: 4 1 5 9 2
Ver tambin
| Devuelve el menor de los elementos (plantilla de funcin) | |
| Devuelve el mayor de dos elementos (plantilla de funcin) |