std::map::equal_range
De cppreference.com
<metanoindex/>
<tbody> </tbody> std::pair<iterator,iterator> equal_range( const Key& key ); |
||
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const; |
||
Devolve uma faixa contendo todos os elementos com
key chave no recipiente. The range is defined by two iterators, one pointing to the first element that is not less than key and another pointing to the first element greater than key. The first iterator may be alternatively obtained with lower_bound(), the second - with upper_bound().Original:
Returns a range containing all elements with key
key in the container. The range is defined by two iterators, one pointing to the first element that is not less than key and another pointing to the first element greater than key. The first iterator may be alternatively obtained with lower_bound(), the second - with upper_bound().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.
Parâmetros
| key | - | valor de chave para comparar os elementos de
Original: key value to compare the elements to The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
Valor de retorno
std::pair containing a pair of iterators defining the wanted range: the first pointing to the first element that is not less than key and the second pointing to the first element greater than key.
If there are no elements not less than key, past-the-end (see end()) iterator is returned as the first element. Similarly if there are no elements greater than key, past-the-end iterator is returned as the second element.
Complexidade
Logarithmic in the size of the container.
