std::unordered_map::equal_range
From Cppreference
< cpp | container | unordered map
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, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.
Contents |
[edit] Parameters
key | - | key value to compare the elements to |
[edit] Return value
std::pair containing a pair of iterators defining the wanted range. If there are no such elements, past-the-end (see end()) iterators are returned as both elements of the pair.
This section is incomplete Reason: link |
[edit] Complexity
This section is incomplete |
[edit] See also
|
finds element with specific key (public member function) |