std::map<Key,T,Compare,Allocator>::lower_bound
From cppreference.com
iterator lower_bound( const Key& key ); |
(1) | (constexpr since C++26) |
const_iterator lower_bound( const Key& key ) const; |
(2) | (constexpr since C++26) |
template< class K > iterator lower_bound( const K& x ); |
(3) | (since C++14) (constexpr since C++26) |
template< class K > const_iterator lower_bound( const K& x ) const; |
(4) | (since C++14) (constexpr since C++26) |
1,2) Returns an iterator pointing to the first element that is not less than key.
3,4) Returns an iterator pointing to the first element that compares not less than x.
This overload participates in overload resolution only if
Compare is transparent. It allows calling this function without constructing an instance of Key.Contents |