Namespaces
Variants
Views
Actions

std::upper_bound

From cppreference.com
< cpp‎ | algorithm
 
 
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
Non-modifying sequence operations
Batch operations
(C++17)
Search operations
(C++11)                (C++11)(C++11)

Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17)(C++11)
(C++20)(C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
Sorting operations
Binary search operations
(on partitioned ranges)
upper_bound
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
(C++11)
(C++17)
Lexicographical comparison operations
Permutation operations
C library
Numeric operations
Operations on uninitialized memory
 
Defined in header <algorithm>
template< class ForwardIt, class T >
ForwardIt upper_bound( ForwardIt first, ForwardIt last, const T& value );
(1) (constexpr since C++20)
template< class ForwardIt, class T, class Compare >

ForwardIt upper_bound( ForwardIt first, ForwardIt last, const T& value,

                       Compare comp );
(2) (constexpr since C++20)

Searches for the first element in the partitioned range [firstlast) which is ordered after value.

1) The order is determined by operator<:

Returns the first iterator iter in [firstlast) where bool(value < *iter) is true, or last if no such iter exists.

If the elements elem of [firstlast) are not partitioned with respect to the expression bool(value < elem), the behavior is undefined.

(until C++20)

Equivalent to std::upper_bound(first, last, value, std::less{}).

(since C++20)
2) The order is determined by comp:
Returns the first iterator iter in [firstlast) where bool(comp(value, *iter)) is true, or last if no such iter exists.
If the elements elem of [firstlast) are not partitioned with respect to the expression bool(comp(value, elem)), the behavior is undefined.

Contents

[edit] Parameters

first, last - the partitioned range of elements to examine
value - value to compare the elements to
comp - binary predicate which returns ​true if the first argument is ordered before the second.

The signature of the predicate function should be equivalent to the following:

 bool pred(const Type1 &a, const Type2 &b);

While the signature does not need to have const &, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1 & is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)).
The type Type1 must be such that an object of type T can be implicitly converted to Type1. The type Type2 must be such that an object of type ForwardIt can be dereferenced and then implicitly converted to Type2. ​

Type requirements
-
ForwardIt must meet the requirements of LegacyForwardIterator.
-
Compare must meet the requirements of BinaryPredicate. It is not required to satisfy Compare.

[edit] Return value

Iterator to the first element of the range [firstlast) ordered after value, or last if no such element is found.

[edit] Complexity

The number of comparisons performed is logarithmic in the distance between first and last (at most log
2
(last - first) + O(1)
comparisons).

However, for non-LegacyRandomAccessIterators, the number of iterator increments is linear. Notably, std::map, std::multimap, std::set, and std::multiset iterators are not random access, and so their member upper_bound functions should be preferred.

[edit] Notes

Although std::upper_bound only requires [firstlast) to be partitioned, this algorithm is usually used in the case where [firstlast) is sorted, so that the binary search is valid for any value.

For any iterator iter in [firstlast), std::upper_bound requires value < *iter and comp(value, *iter) to be well-formed, while std::lower_bound requires *iter < value and comp(*iter, value) to be well-formed instead.

[edit] Possible implementation

See also the implementations in libstdc++ and libc++.


upper_bound (1)
template<class ForwardIt, class T>
ForwardIt upper_bound(ForwardIt first, ForwardIt last, const T& value)
{
    ForwardIt it;
    typename std::iterator_traits<ForwardIt>::difference_type count, step;
    count = std::distance(first, last);
 
    while (count > 0)
    {
        it = first; 
        step = count / 2; 
        std::advance(it, step);
 
        if (!(value < *it))
        {
            first = ++it;
            count -= step + 1;
        } 
        else
            count = step;
    }
 
    return first;
}
upper_bound (2)
template<class ForwardIt, class T, class Compare>
ForwardIt upper_bound(ForwardIt first, ForwardIt last, const T& value, Compare comp)
{
    ForwardIt it;
    typename std::iterator_traits<ForwardIt>::difference_type count, step;
    count = std::distance(first, last);
 
    while (count > 0)
    {
        it = first; 
        step = count / 2;
        std::advance(it, step);
 
        if (!comp(value, *it))
        {
            first = ++it;
            count -= step + 1;
        } 
        else
            count = step;
    }
 
    return first;
}

[edit] Example

#include <algorithm>
#include <iostream>
#include <vector>
 
struct PriceInfo { double price; };
 
int main()
{
    const std::vector<int> data{1, 2, 4, 5, 5, 6};
 
    for (int i = 0; i < 7; ++i)
    {
        // Search first element that is greater than i
        auto upper = std::upper_bound(data.begin(), data.end(), i);
 
        std::cout << i << " < ";
        upper != data.end()
            ? std::cout << *upper << " at index " << std::distance(data.begin(), upper)
            : std::cout << "not found";
        std::cout << '\n';
    }
 
    std::vector<PriceInfo> prices{{100.0}, {101.5}, {102.5}, {102.5}, {107.3}};
 
    for (double to_find : {102.5, 110.2})
    {
        auto prc_info = std::upper_bound(prices.begin(), prices.end(), to_find,
            [](double value, const PriceInfo& info)
            {
                return value < info.price;
            });
 
        prc_info != prices.end()
            ? std::cout << prc_info->price << " at index " << prc_info - prices.begin()
            : std::cout << to_find << " not found";
        std::cout << '\n';
    }
}

Output:

0 < 1 at index 0
1 < 2 at index 1
2 < 4 at index 2
3 < 4 at index 2
4 < 5 at index 3
5 < 6 at index 5
6 < not found 
107.3 at index 4
110.2 not found

[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR Applied to Behavior as published Correct behavior
LWG 270 C++98 Compare was required to satisfy Compare and T was required
to be LessThanComparable (strict weak ordering required)
only a partitioning is required;
heterogeneous comparisons permitted
LWG 384 C++98 at most log(last - first) + 1 comparisons were allowed corrected to log
2
(last - first) + O(1)
LWG 577 C++98 last could not be returned allowed

[edit] See also

returns range of elements matching a specific key
(function template) [edit]
returns an iterator to the first element not less than the given value
(function template) [edit]
divides a range of elements into two groups
(function template) [edit]
locates the partition point of a partitioned range
(function template) [edit]
returns an iterator to the first element greater than a certain value
(niebloid)[edit]
returns an iterator to the first element greater than the given key
(public member function of std::set<Key,Compare,Allocator>) [edit]
returns an iterator to the first element greater than the given key
(public member function of std::multiset<Key,Compare,Allocator>) [edit]