std::minmax

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

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.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
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.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
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.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
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.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
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.
lower_bound upper_bound	binary_search equal_range
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.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
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.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
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.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
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.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
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.
qsort	bsearch

 

Defined in header <algorithm>
template<class T > std::pair<const T&,const T&> minmax(const T& a, const T& b );	(1)	(dal C++11)
template<class T, class Compare > std::pair<const T&,const T&> minmax(const T& a, const T& b, Compare comp );	(2)	(dal C++11)
template<class T > std::pair<T,T> minmax(std::initializer_list<T> ilist);	(3)	(dal C++11)
template<class T, class Compare > std::pair<T,T> minmax(std::initializer_list<T> ilist, Compare comp );	(4)	(dal C++11)

1-2)

Restituisce il più piccolo e il maggiore dei due valori.

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.

3-4)

Restituisce la lista più piccolo e il più grande dei valori di inizializzazione 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.

I (1,3) versioni utilizzano operator< per confrontare i valori, mentre i (2,4) versioni utilizzare la funzione di confronto dato 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.

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.
comp	-	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)

Valore di ritorno

1-2)

Restituisce il risultato di std::make_pair(a, b) se a<b o se a è equivalente a b. Restituisce il risultato di std::make_pair(b, a) se 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.

3-4)

Una coppia con il valore più piccolo ilist come primo elemento e il più grande come secondo. Se alcuni elementi sono equivalenti al più piccolo, l'elemento più a sinistra come viene restituito. Se alcuni elementi sono equivalenti al più grande, l'elemento più a destra come viene restituito.

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.

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.

Possibile implementazione

First version
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);}
Second version
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);}
Third version
template<class T >std::pair<T,T> minmax(std::initializer_list ilist){auto p =std::minmax_element(ilist.begin(), ilist.end());returnstd::make_pair(*p.first, *p.second);}
Fourth version
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);returnstd::make_pair(*p.first, *p.second);}

Esempio

#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';}

Possible output:

v[2,7]: 4 1 5 9 2

Vedi anche

min	restituisce il minore dei due elementi Original: returns 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)
max	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)