multiset lower_bound() in C++ STL with Examples
The multiset::lower_bound() is a built-in function in C++ STL which returns an iterator pointing to the first element in the container which is equivalent to k passed in the parameter. In case k is not present in the set container, the function returns an iterator pointing to the immediate next element which is just greater than k. If the key passed in the parameter exceeds the maximum value in the container, then the iterator returned prints the number of elements in the container.
Parameters: This function accepts a single mandatory parameter key which specifies the element whose lower_bound is to be returned.
Return Value: The function returns an iterator.
Below program illustrate the above function:
The multiset elements are: 1 1 2 2 4 The lower bound of key 2 is 2 The lower bound of key 3 is 4 The lower bound of key 7 is 5
The multiset elements are: 1 3 3 4 5 The lower bound of key 3 is 3 The lower bound of key 2 is 3 The lower bound of key 10 is 5
My Personal Notes arrow_drop_up
Please Login to comment...