From cppreference.com
iteratorupper_bound(constKey&key); (1) const_iteratorupper_bound(constKey&key)const; (2) template<classK>iteratorupper_bound(constK&x); (3)(since C++14)template<classK>const_iteratorupper_bound(constK&x)const; (4) (since C++14)1,2) Returns an iterator pointing to the first element that is greater than key.
3,4) Returns an iterator pointing to the first element that compares greater to the value x. This overload participates in overload resolution only if the qualified-id Compare::is_transparent is valid and denotes a type. It allows 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 KeyReturn value
Iterator pointing to the first element that is greater than key. If no such element is found, past-the-end (see
) iterator is returned.
Complexity
Logarithmic in the size of the container.
Notes
macroValueStdFeature
__cpp_lib_generic_associative_lookup
(C++14)Heterogeneous comparison lookup in
, for overloads (
)Example
See also
returns range of elements matching a specific key
(public member function)
returns an iterator to the first element not less than the given key
(public member function)