std::set::equal_range
cppreference.com
 [] |
Google. . , . , . |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody> std::pair<iterator,iterator> equal_range( const Key& key ); |
||
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const; |
||
,
key . 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().:
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().| key |
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.
Logarithmic in the size of the container.
.
| (public -) | |
| , (public -) | |
| , (public -) |