C++ Map Library - lower_bound() Function


Advertisements

Description

The C++ function std::map::lower_bound() returns an iterator pointing to the first element which is not less than key k.

Declaration

Following is the declaration for std::map::lower_bound() function form std::map header.

C++98

iterator lower_bound (const key_type& k);
const_iterator lower_bound (const key_type& k) const;

Parameters

k − Key to be searched.

Return value

If object is constant qualified then method returns a constant iterator otherwise non-constant iterator.

Exceptions

This member function doesn't throw exception.

Time complexity

Logarithmic i.e. O(log n)

Example

The following example shows the usage of std::map::lower_bound() function.

#include <iostream>
#include <map>

using namespace std;

int main(void) {
   map<char, int> m = {
            {'a', 1},
            {'b', 2},
            {'c', 3},
            {'d', 4},
            {'e', 5},
            };

   auto it = m.lower_bound('b');

   cout << "Lower bound is " << it->first << 
      " = " << it->second << endl;

   return 0;
}

Let us compile and run the above program, this will produce the following result −

Lower bound is b = 2
map.htm
Advertisements