std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>::equal_range
From cppreference.com
< cpp | container | flat multimap
std::pair<iterator, iterator> equal_range( const Key& key ); |
(1) | (since C++23) (constexpr since C++26) |
std::pair<const_iterator, const_iterator> equal_range( const Key& key ) const; |
(2) | (since C++23) (constexpr since C++26) |
template< class K > std::pair<iterator, iterator> equal_range( const K& x ); |
(3) | (since C++23) (constexpr since C++26) |
template< class K > std::pair<const_iterator, const_iterator> |
(4) | (since C++23) (constexpr since C++26) |
Returns a range containing all elements with the given key in the container. The range is defined by two iterators, one pointing to the first element that is not less than the given key and another pointing to the first element greater than the given key.
Alternatively, the first iterator may be obtained with lower_bound(), and the second with upper_bound().
1,2) Compares the keys to key.
3,4) Compares the keys to the value x.
This overload participates in overload resolution only if
Compare is transparent. It allows calling this function without constructing an instance of Key.Contents |
[edit] Parameters
| key | - | key value to compare the elements to |
| x | - | alternative value that can be compared to Key
|
[edit] Return value
std::pair containing a pair of iterators defining the wanted range:
- The first iterator points to the first element not less than the given key, or end() if no such element exists.
- The second iterator points to the first element greater than the given key, or end() if no such element exists.
Since emplace and unhinted insert always insert at the upper bound, the order of equivalent elements in the equal range is the order of insertion unless hinted