A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/algorithm/../error/../algorithm/../container/set/upper_bound.html below:

std::set<Key,Compare,Allocator>::upper_bound - cppreference.com

iterator upper_bound( const Key& key );

(1) (constexpr since C++26)

const_iterator upper_bound( const Key& key ) const;

(2) (constexpr since C++26)

template< class K >
iterator upper_bound( const K& x );

(3) (since C++14)
(constexpr since C++26)

template< class K >
const_iterator upper_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 greater than key.

3,4) Returns an iterator pointing to the first element that compares greater than x.

This overload participates in overload resolution only if

Compare

is

transparent

. It allows calling this function without constructing an instance of

Key

.

[edit] Parameters key - key value to compare the elements to x - alternative value that can be compared to Key [edit] Return value

An iterator pointing to the first element that is greater than the given key, or end() is no such element exists.

[edit] Complexity

Logarithmic in the size of the container.

Notes [edit] Example [edit] See also returns range of elements matching a specific key
(public member function) [edit] returns an iterator to the first element not less than the given key
(public member function) [edit]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4