std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>::upper_bound
From cppreference.com
< cpp | container | flat multimap
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::flat_multimap
flat_multimap::upper_bound
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) iterator upper_bound( const K& x );
(constexpr since C++26)
template< class K >
const_iterator upper_bound( const K& x ) const;
(4)
(since C++23) const_iterator upper_bound( const K& x ) const;
(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.
[edit] Example
This section is incomplete
Reason: no example
Reason: no example
[edit] See also
returns an iterator to the first element not less than the given key
(public member function) [edit]
(public member function) [edit]