std::map<Key,T,Compare,Allocator>::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

[edit]

std::map

Member functions

map::map
map::~map

map::operator=
map::get_allocator

Element access
map::at
map::operator[]
Iterators
map::beginmap::cbegin (C++11)
map::endmap::cend (C++11)
map::rbeginmap::crbegin (C++11)
map::rendmap::crend (C++11)
Capacity
map::size
map::max_size
map::empty
Observers
map::key_comp
map::value_comp

Modifiers
map::clear
map::insert
map::erase
map::swap
map::extract (C++17)
map::merge (C++17)
map::insert_range (C++23)
map::insert_or_assign (C++17)
map::emplace (C++11)
map::emplace_hint (C++11)
map::try_emplace (C++17)
Lookup
map::count
map::find
map::contains (C++20)
map::equal_range
map::lower_bound
map::upper_bound

Non-member functions

operator==operator<=> (C++20)
std::swap(std::map)
erase_if(std::map) (C++20)

operator!=operator<operator>operator<=operator>=

(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)

Deduction guides(C++17)

[edit]

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 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.

Notes

Feature-test macro	Value	Std	Feature
`__cpp_lib_generic_associative_lookup`	`201304L`	(C++14)	Heterogeneous comparison lookup inassociative containers, for overloads(3,4)

[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]