Difference between revisions of "cpp/container/map/equal range"
(Created page with "{{cpp/container/equal_range|map}}") |
m (langlinks) |
||
| (8 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | {{cpp/container/ | + | {{include page|cpp/container/equal_range_ord|map}} |
| + | |||
| + | {{langlinks|de|es|fr|it|ja|ko|pt|ru|zh}} | ||
Latest revision as of 18:11, 29 November 2021
| std::pair<iterator, iterator> equal_range( const Key& key ); |
(1) | |
| std::pair<const_iterator, const_iterator> equal_range( const Key& key ) const; |
(2) | |
template< class K > std::pair<iterator, iterator> equal_range( const K& x ); |
(3) | (since C++14) |
| template< class K > std::pair<const_iterator, const_iterator> equal_range( const K& x ) const; |
(4) | (since C++14) |
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 key and another pointing to the first element greater than key. Alternatively, the first iterator may be obtained with lower_bound(), and the second with upper_bound().
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 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
Logarithmic in the size of the container.
Notes
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_generic_associative_lookup |
201304L | (C++14) | Heterogeneous comparison lookup in associative containers, for overloads (3,4) |
[edit] Example
#include <iostream> #include <map> int main() { const std::map<int, const char*> m { {0, "zero"}, {1, "one"}, {2, "two"} }; auto p = m.equal_range(1); for (auto& q = p.first; q != p.second; ++q) std::cout << "m[" << q->first << "] = " << q->second << '\n'; if (p.second == m.find(2)) std::cout << "end of equal_range (p.second) is one-past p.first\n"; else std::cout << "unexpected; p.second expected to be one-past p.first\n"; auto pp = m.equal_range(-1); if (pp.first == m.begin()) std::cout << "pp.first is iterator to first not-less than -1\n"; else std::cout << "unexpected pp.first\n"; if (pp.second == m.begin()) std::cout << "pp.second is iterator to first element greater-than -1\n"; else std::cout << "unexpected pp.second\n"; auto ppp = m.equal_range(3); if (ppp.first == m.end()) std::cout << "ppp.first is iterator to first not-less than 3\n"; else std::cout << "unexpected ppp.first\n"; if (ppp.second == m.end()) std::cout << "ppp.second is iterator to first element greater-than 3\n"; else std::cout << "unexpected ppp.second\n"; }
Output:
m[1] = one end of equal_range (p.second) is one-past p.first pp.first is iterator to first not-less than -1 pp.second is iterator to first element greater-than -1 ppp.first is iterator to first not-less than 3 ppp.second is iterator to first element greater-than 3
[edit] See also
| finds element with specific key (public member function) | |
| (C++20) |
checks if the container contains element with specific key (public member function) |
| returns the number of elements matching specific key (public member function) | |
| returns an iterator to the first element greater than the given key (public member function) | |
| returns an iterator to the first element not less than the given key (public member function) | |
| returns range of elements matching a specific key (function template) |
