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

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

NAME

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

Synopsis

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

1) Returns an iterator pointing to the first element that is greater than key.
2) Returns an iterator pointing to the first element that compares greater 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 greater than key. If no such element is found, past-the-end (see end()) iterator is returned.

Complexity

Logarithmic in the size of the container.