Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
multimap lower_bound() function in C++ STL
In this article we will be discussing the working, syntax, and examples of multimap::lower_bound() function in C++ STL.
What is Multimap in C++ STL?
Multimaps are the associative containers, which are similar to map containers. It also facilitates to store the elements formed by a combination of key-value and mapped value in a specific order. In a multimap container there can be multiple elements associated with the same key. The data is internally always sorted with the help of its associated keys.
What is multimap::lower_bound()?
multimap::lower_bound() function is an inbuilt function in C++ STL, which is defined in <map> header file. lower_bound() returns an iterator to the lower bound of the multimap container. This function returns an iterator which points to the first element which is considered to go before the key k.
Syntax
multi.lower_bound(key& k);
Parameter
This function accepts only 1 parameter −
k − The key which we want to search.
Return value
This function returns the iterator which is pointing to the first element of the key ‘k’ which is to be considered to go before the key k.
Input
multimap<char, int> newmap; multimap<char, int > newmap; newmap.insert(make_pair(‘a’, 1)); newmap.insert(make_pair(‘b’, 2)); newmap.insert(make_pair(‘c’, 3)); newmap.lower_bound(b);
Output
a:1
Example
#include <bits/stdc++.h>
using namespace std;
int main(){
//creating a multimap
multimap<int, int> mul;
mul.insert({ 2, 10 });
mul.insert({ 1, 20 });
mul.insert({ 1, 30 });
mul.insert({ 3, 40 });
mul.insert({ 3, 50 });
mul.insert({ 4, 60 });
// lower bound of 1
auto i = mul.lower_bound(1);
cout << "Lower bound of key 1 is: ";
cout << (*i).first << " " << (*i).second << endl;
// Lower bound of 2
i = mul.lower_bound(2);
cout << "Lower bound of key 2 is: ";
cout << (*i).first <<" "<<(*i).second << endl;
// Lower bound of 3
i = mul.lower_bound(3);
cout << "Lower bound of key 3 is: ";
cout << (*i).first << " " << (*i).second << endl;
return 0;
}Output
If we run the above code it will generate the following output −
Lower bound of key 1 is: 1 20 Lower bound of key 2 is: 2 10 Lower bound of key 3 is: 3 40
244 Views
