std::flat_set<Key,Compare,KeyContainer>::upper_bound

From cppreference.com

Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros(C++20)
Language support library
Concepts library(C++20)
Diagnostics library
Memory management library
Metaprogramming library(C++11)
General utilities library
Containers library
Iterators library
Ranges library(C++20)
Algorithms library
Strings library
Text processing library
Numerics library
Date and time library
Input/output library
Filesystem library(C++17)
Concurrency support library(C++11)
Execution control library(C++26)
Technical specifications
Symbols index
External libraries

[edit]

Containers library

node-handle (C++17)
Sequence
array (C++11)
vector
vector<bool>
inplace_vector (C++26)
hive (C++26)
deque
forward_list (C++11)
list
Associative
set
multiset
map
multimap
Unordered associative
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
Adaptors
stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)
Views
span (C++20)
mdspan (C++23)
Tables
Iterator invalidation
Member function table
Non-member function table

flat_set::flat_set
flat_set::operator=
Iterators
flat_set::beginflat_set::cbegin
flat_set::endflat_set::cend
flat_set::rbeginflat_set::crbegin
flat_set::rendflat_set::crend
Capacity
flat_set::size
flat_set::max_size
flat_set::empty
Observers
flat_set::key_comp
flat_set::value_comp

Modifiers
flat_set::clear
flat_set::insert
flat_set::insert_range
flat_set::emplace
flat_set::emplace_hint
flat_set::erase
flat_set::swap
flat_set::extract
flat_set::replace
Lookup
flat_set::count
flat_set::find
flat_set::contains
flat_set::equal_range
flat_set::lower_bound
flat_set::upper_bound

Non-member functions

operator==operator<=>

swap(std::flat_set)
erase_if(std::flat_set)

Helper classes

uses_allocator<std::flat_set>

iterator upper_bound(const Key& key);	(1)	(since C++23) (constexpr since C++26)
const_iterator upper_bound(const Key& key)const;	(2)	(since C++23) (constexpr since C++26)
template<class K> iterator upper_bound(const K& x);	(3)	(since C++23) (constexpr since C++26)
template<class K> const_iterator upper_bound(const K& x)const;	(4)	(since C++23) (constexpr since C++26)

1,2) Returns an iterator pointing to the first element that is greater thankey.

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

This overload participates in overload resolution only ifCompare istransparent. It allows calling this function without constructing an instance ofKey.

[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, orend() is no such element exists.

[edit]Complexity

Logarithmic in the size of the container.

[edit]Example

This section is incomplete
Reason: no example

[edit]See also

equal_range	returns range of elements matching a specific key (public member function)[edit]
lower_bound	returns an iterator to the first elementnot less than the given key (public member function)[edit]