The unordered_map::equal_range() is an inbuilt function in C++ STL which is used to return the bounds of a range that includes all the elements in the container with a key that compares equal to k. The unordered_map containers are the container where keys are unique, the range will include one element at most. The range is defined by two iterators,
- The first one pointing to the first element of the range.
- The second one pointing past the last element of the range.
Parameters: This function accepts single parameter key which is used to hold the value to be compared.
Return Value: It returns a pair which contains a pair of iterators defining the wanted range. Where its members are pair::first and pair::second. The first one is an iterator to the lower bound of the range and the second one is an iterator to its upper bound. The elements in the range are those between these two iterators, including first pair, but not second.
Below programs illustrates the unordered_map::equal_range() function in C++ STL:
first : 1 second : 3 first : 2 second : 3 first : 3 second : 1
search for 'f' : search for 'a' : [a, b]
- Average case: Linear in the number of elements with the key k, which is constant.
- worst case: Linear in the size of the container.
- Implementing upper_bound() and lower_bound() for Ordered Set in C++
- How to flatten a Vector of Vectors or 2D Vector in C++
- Difference between SOP and POS in Digital Logic
- Difference between VGA and SVGA
- Difference between Hard link and Soft link
- Difference between Monitor and Television
- Difference between JOIN and UNION in SQL
- Difference between COMMIT and ROLLBACK in SQL
- Queue of Pairs in C++ STL with Examples
- Remove odd frequency characters from the string
- Difference between Direct and Immediate Addressing Modes
- Difference between Paging and Swapping in OS
- Difference between Primary and Secondary Memory
- Difference between Indirect and Immediate Addressing Modes
- Difference between FCFS and SCAN disk scheduling algorithms
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.