Namespace
Varianti

std::min

Da cppreference.com.
< cpp‎ | algorithm

Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.

La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui.

Click here for the English version of this page

 
C++
 
Algoritmo libreria
Funzioni
Original:
Functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Non modifica le operazioni di sequenza
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.
Modifica delle operazioni di sequenza
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.
Partizionamento operazioni
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.
Ordinamento delle operazioni (su intervalli ordinati)
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.
Binarie (le operazioni di ricerca sui campi ordinati)
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.
Impostare le operazioni (su intervalli ordinati)
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.
Heap operazioni
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.
Minimo / massimo le operazioni
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.
Operazioni numeriche
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.
Libreria C
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.
 
Elemento definito nell'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) (dal C++11)
template< class T, class Compare >
T min( std::initializer_list<T> ilist, Compare comp );
 (4) (dal C++11)
1-2)
Restituisce il più piccolo dei due valori.
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)
Restituisce il più piccolo dei valori ilist inizializzatore 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.
I (1,3) versioni utilizzano operator< per confrontare i valori, i (2,4) versioni utilizzare la funzione di confronto dato 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.

Indice

[modifica] Parametri

a, b -
i valori da confrontare
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 -
inizializzatore lista con i valori da confrontare
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)

[modifica] Valore di ritorno

1-2)
Il più piccolo dei a e b. Se i valori sono equivalenti, ritorna 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)
Il valore più piccolo ilist. Se i valori sono diversi equivalenti al più piccolo, restituisce il valore più a sinistra come.
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.

[modifica] Complessità

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)
Lineare in 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.

[modifica] Possibile implementazione

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);
}

[modifica] Esempio

#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

[modifica] Vedi anche
restituisce il più grande dei due elementi
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.

(funzione di modello) [modifica]
(C++11)
restituisce l'. più grande e più piccolo dei due elementi
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.

(funzione di modello) [modifica]
restituisce l'elemento più piccolo in un intervallo
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.

(funzione di modello) [modifica]
Estratto da "https://it.cppreference.com/mwiki/index.php?title=cpp/algorithm/min&oldid=24958"