std::multiset::lower_bound

From Cppreference

Jump to: navigation, search
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, past-the-end (see end()) iterator is returned.

[edit] Complexity

[edit] See also

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