std::map::lower_bound

From cppreference.com

iterator lower_bound( const Key& key );
const_iterator lower_bound( const Key& key ) const;

Returns an iterator pointing to the first element that is not less than key.

Contents

[edit] Parameters

key - key value to compare the elements to

[edit] Return value

iterator pointing to the first element that is not less than key. If no such element is found, a past-the-end iterator (see end()) is returned.

[edit] Complexity

Logarithmic in the size of the container.

[edit] See also

returns range of elements matching a specific key
(public member function)
returns an iterator to the first element greater than a certain value
(public member function)