std::multimap<Key,T,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::multimap

Member functions

multimap::multimap

multimap::~multimap

multimap::operator=

multimap::get_allocator

Iterators

multimap::beginmultimap::cbegin (C++11)

multimap::endmultimap::cend (C++11)

multimap::rbeginmultimap::crbegin (C++11)

multimap::rendmultimap::crend (C++11)

Capacity

multimap::empty

multimap::size

multimap::max_size

Modifiers

multimap::clear

multimap::insert

multimap::emplace (C++11)

multimap::emplace_hint (C++11)

multimap::erase

multimap::swap

multimap::extract (C++17)

multimap::merge (C++17)

Lookup

multimap::count

multimap::find

multimap::contains (C++20)

multimap::equal_range

multimap::lower_bound

multimap::upper_bound

Observers

multimap::key_comp

multimap::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)