std::minmax

 

C++

Suporte ao Compilador

Freestanding and hosted

Linguagem

Headers da Biblioteca Standard

Requerimentos nomeados

Feature test macros (C++20)

Biblioteca de suporte de língua

Biblioteca de conceitos(C++20)

Biblioteca de diagnósticos

Biblioteca de utilitários em geral

Biblioteca de strings

Biblioteca de containers

Ranges library(C++20)

Biblioteca de iteradores

Biblioteca de algorítmos

Biblioteca numérica

Biblioteca de localizações

Biblioteca de input/output

Biblioteca de sistema de arquivo(C++17)

Biblioteca de expressões regulares(C++11)

Biblioteca de operações atômicas(C++11)

Biblioteca de suporte de thread(C++11)

Especificações Técnicas

Índice de symbolos

Bibliotecas externas

 

Biblioteca algoritmo

Funções Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Não modificar operações de seqüência 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_ofany_ofnone_of (C++11)(C++11)(C++11) for_each countcount_if mismatch equal	findfind_iffind_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modificando operações de seqüência 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.
copycopy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n removeremove_if remove_copyremove_copy_if	replacereplace_if replace_copyreplace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffleshuffle  (C++11) unique unique_copy
Particionamento operações 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)
Operações de classificação (em intervalos 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.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binários operações de busca (em intervalos 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.
lower_bound upper_bound	binary_search equal_range
Definir operações (em intervalos 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.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Operações de pilha 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
Mínimo / máximo de operações 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
Operações 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.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
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.
qsort	bsearch

 

Definido no cabeçalho <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)

Retorna o menor e o maior dos dois 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.

3-4)

Retorna a lista menor e maior dos valores em 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.

As versões (1,3) usa operator< para comparar os valores, enquanto que as versões (2,4) utilizar a função de comparação dada 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.

Parâmetros

a, b	-	os 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 com os valores para 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	-	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)

Valor de retorno

1-2)

Retorna o resultado de se std::make_pair(a, b)a<b ou se a é equivalente a b. Retorna o resultado da 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)

A par com o menor valor na ilist como o primeiro elemento e maior que a segunda. Se vários elementos são equivalentes a menor, o elemento mais à esquerda como é retornado. Se vários elementos são equivalentes ao maior, o elemento mais à direita são devolvidas.

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.

Complexidade

1-2)

Constante

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)

Linear em 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.

Possível implementação

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

Exemplo

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

Potencial saída:

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

Veja também

min	retorna o menor dos dois elementos 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. (modelo de função)
max	devolve o maior dos dois 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. (modelo de função)