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

 

C++

Language

Standard Library Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

span (C++20)

 

std::set

Member functions

set::set

set::~set

set::operator=

set::get_allocator

Iterators

set::beginset::cbegin (C++11)

set::endset::cend (C++11)

set::rbeginset::crbegin (C++11)

set::rendset::crend (C++11)

Capacity

set::empty

set::size

set::max_size

Modifiers

set::clear

set::insert

set::emplace (C++11)

set::emplace_hint (C++11)

set::erase

set::swap

set::extract (C++17)

set::merge (C++17)

Lookup

set::count

set::find

set::contains (C++20)

set::equal_range

set::lower_bound

set::upper_bound

Observers

set::key_comp

set::value_comp

Deduction guides(C++17)

 

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

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.

See also

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