From Cppreference
|
|
std::pair<iterator,iterator> equal_range( const Key& key );
|
|
|
|
|
|
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const;
|
|
|
|
|
|
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().
[edit] Parameters
| key
|
-
|
key value to compare the elements to
|
[edit] Return value
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
[edit] Complexity
[edit] See also
|
|
|
|
finds element with specific key
(public member function)
|
|
|
|
|
returns an iterator to the first element greater than a certain value
(public member function)
|
|
|
|
|
returns an iterator to the first element not less than the given value
(public member function)
|