| CARVIEW |
Select Language
HTTP/1.1 301 Moved Permanently
Server: nginx
Date: Thu, 24 Jul 2025 18:48:49 GMT
Content-Type: text/html; charset=UTF-8
Transfer-Encoding: chunked
Connection: keep-alive
Location: /reference/set/multiset/upper_bound/
HTTP/1.1 200 OK
Server: nginx
Date: Thu, 24 Jul 2025 18:48:49 GMT
Content-Type: text/html; charset=utf-8
Transfer-Encoding: chunked
Connection: keep-alive
ETag: W/"7fd6-KESjYk+m1U9MhgjE+Wtt1IjIUfU"
Content-Encoding: gzip
Returns an iterator pointing to the first element in the container which is considered to go after val.
The function uses its internal comparison object (key_comp) to determine this, returning an iterator to the first element for which key_comp(val,element) would return true.
If the multiset class is instantiated with the default comparison type (less), the function returns an iterator to the first element that is greater than val.
A similar member function, lower_bound, has the same behavior as upper_bound, except in the case that the multiset contains elements equivalent to val: In this case lower_bound returns an iterator pointing to the first of such elements, whereas upper_bound returns an iterator pointing to the element following the last.
Member types iterator and const_iterator are bidirectional iterator types pointing to elements.
Notice that lower_bound(30) returns an iterator to 30, whereas upper_bound(60) returns an iterator to 70.
Concurrently accessing the elements of a multiset is safe.
Reference
C library:
- <cassert> (assert.h)
- <cctype> (ctype.h)
- <cerrno> (errno.h)
-
<cfenv> (fenv.h)C++11
- <cfloat> (float.h)
-
<cinttypes> (inttypes.h)C++11
- <ciso646> (iso646.h)
- <climits> (limits.h)
- <clocale> (locale.h)
- <cmath> (math.h)
- <csetjmp> (setjmp.h)
- <csignal> (signal.h)
- <cstdarg> (stdarg.h)
-
<cstdbool> (stdbool.h)C++11
- <cstddef> (stddef.h)
-
<cstdint> (stdint.h)C++11
- <cstdio> (stdio.h)
- <cstdlib> (stdlib.h)
- <cstring> (string.h)
-
<ctgmath> (tgmath.h)C++11
- <ctime> (time.h)
-
<cuchar> (uchar.h)C++11
- <cwchar> (wchar.h)
- <cwctype> (wctype.h)
Containers:
-
<array>C++11
- <deque>
-
<forward_list>C++11
- <list>
- <map>
- <queue>
- <set>
- <stack>
-
<unordered_map>C++11
-
<unordered_set>C++11
- <vector>
-
Input/Output:
Multi-threading:
-
<atomic>C++11
-
<condition_variable>C++11
-
<future>C++11
-
<mutex>C++11
-
<thread>C++11
-
Other:
- <algorithm>
- <bitset>
-
<chrono>C++11
-
<codecvt>C++11
- <complex>
- <exception>
- <functional>
-
<initializer_list>C++11
- <iterator>
- <limits>
- <locale>
- <memory>
- <new>
- <numeric>
-
<random>C++11
-
<ratio>C++11
-
<regex>C++11
- <stdexcept>
- <string>
-
<system_error>C++11
-
<tuple>C++11
-
<type_traits>C++11
-
<typeindex>C++11
- <typeinfo>
- <utility>
- <valarray>
multiset
- multiset::~multiset
- multiset::multiset
member functions
- multiset::begin
-
multiset::cbeginC++11
-
multiset::cendC++11
- multiset::clear
- multiset::count
-
multiset::crbeginC++11
-
multiset::crendC++11
-
multiset::emplaceC++11
-
multiset::emplace_hintC++11
- multiset::empty
- multiset::end
- multiset::equal_range
- multiset::erase
- multiset::find
- multiset::get_allocator
- multiset::insert
- multiset::key_comp
- multiset::lower_bound
- multiset::max_size
- multiset::operator=
- multiset::rbegin
- multiset::rend
- multiset::size
- multiset::swap
- multiset::upper_bound
- multiset::value_comp
non-member overloads
public member function
<set>
std::multiset::upper_bound
iterator upper_bound (const value_type& val) const;
const_iterator upper_bound (const value_type& val) const; iterator upper_bound (const value_type& val);
Return iterator to upper bound
The function uses its internal comparison object (key_comp) to determine this, returning an iterator to the first element for which key_comp(val,element) would return true.
If the multiset class is instantiated with the default comparison type (less), the function returns an iterator to the first element that is greater than val.
A similar member function, lower_bound, has the same behavior as upper_bound, except in the case that the multiset contains elements equivalent to val: In this case lower_bound returns an iterator pointing to the first of such elements, whereas upper_bound returns an iterator pointing to the element following the last.
Parameters
- val
- Value to compare.
Member type value_type is the type of the elements in the container, defined in multiset as an alias of its first template parameter (T).
Return value
An iterator to the the first element in the container which is considered to go after val, or multiset::end if no elements are considered to go after val.Member types iterator and const_iterator are bidirectional iterator types pointing to elements.
Example
|
|
Notice that lower_bound(30) returns an iterator to 30, whereas upper_bound(60) returns an iterator to 70.
mymultiset contains: 10 20 50 60 70 |
Complexity
Logarithmic in size.Iterator validity
No changes.Data races
The container is accessed (neither the const nor the non-const versions modify the container).Concurrently accessing the elements of a multiset is safe.
Exception safety
Strong guarantee: if an exception is thrown, there are no changes in the container.See also
- multiset::lower_bound
- Return iterator to lower bound (public member function)
- multiset::equal_range
- Get range of equal elements (public member function)
- multiset::find
- Get iterator to element (public member function)
- multiset::count
- Count elements with a specific key (public member function)
Home page | Privacy policy
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us