Syntax:

    #include <map>
    iterator lower_bound( const key_type& key );
    const_iterator lower_bound( const key_type& key ) const;

The lower_bound method returns an iterator to the first element whose key is not less than the supplied argument key (i.e. greater than or equal to key).

The comparison is done using the map's comparison object.

lower_bound runs in logarithmic time.

Related Topics: upper_bound, lower_bound algorithm