std::set<Key,Compare,Allocator>::lower_bound (3) - Linux Manuals

std::set<Key,Compare,Allocator>::lower_bound: std::set<Key,Compare,Allocator>::lower_bound

NAME

std::set<Key,Compare,Allocator>::lower_bound - std::set<Key,Compare,Allocator>::lower_bound

Synopsis


iterator lower_bound( const Key& key ); (1)
const_iterator lower_bound( const Key& key ) const; (1)
template< class K > (2) (since C++14)
iterator lower_bound(const K& x);
template< class K > (2) (since C++14)
const_iterator lower_bound(const K& x) const;


1) Returns an iterator pointing to the first element that is not less than key.
2) Returns an iterator pointing to the first element that compares not less to the value x. This overload only participates in overload resolution if the qualified-id Compare::is_transparent is valid and denotes a type. They allow calling this function without constructing an instance of Key.

Parameters


key - key value to compare the elements to
x - alternative value that can be compared to Key

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.

Complexity


Logarithmic in the size of the container.

See also


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

Pages related to std::set<Key,Compare,Allocator>::lower_bound